HALOWERKDatenvertragswerk
shortest common supersequence family
Given two original binary words each length 0..4, construct ALL distinct minimum-length words that contain BOTH originals as subsequences (gaps allowed). Return lexicographically sorted family, exact minimum length/count and zero-based lexicographically earliest embedding positions of each original in every member. Empty originals and repeated letters supported; each output word counted once irrespective of embedding multiplicity. Whole ordered-wordfamily claim compared, object-key order.
POST https://datenvertrag.halowerk.com/v1/shortest-common-supersequence-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| left | Siehe Schema | Ja | |
| right | Siehe Schema | Ja | |
| claimed_words | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"left",
"right",
"claimed_words"
],
"properties": {
"left": {
"anyOf": [
{
"type": "string",
"pattern": "^[01]*$",
"maxLength": 4
},
{
"type": "null"
}
]
},
"right": {
"anyOf": [
{
"type": "string",
"pattern": "^[01]*$",
"maxLength": 4
},
{
"type": "null"
}
]
},
"claimed_words": {
"anyOf": [
{
"type": "array",
"maxItems": 70,
"items": {
"type": "string",
"pattern": "^[01]*$",
"maxLength": 8
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"left": "01",
"right": "10",
"claimed_words": [
"010",
"101"
]
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- Datenvertragswerk0,003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden