HALOWERKDatenvertragswerk
longest common subsequence family
For two supplied binary strings of length0..5, return ALL DISTINCT maximum-length common subsequence WORDS, sorted lexicographically, their length/count, and the lexicographically earliest zero-based index tuple embedding each word in each original. Gaps are allowed; contiguous substrings are not required. Empty commonword is the unique answer when no nonempty match exists, with empty index witnesses. Distinct spellings are counted, not the number of alignments or embeddings. Compare the.
POST https://datenvertrag.halowerk.com/v1/longest-common-subsequence-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| left | Siehe Schema | Ja | |
| right | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"left",
"right",
"claim"
],
"properties": {
"left": {
"anyOf": [
{
"type": "string",
"maxLength": 5,
"pattern": "^[01]*$"
},
{
"type": "null"
}
]
},
"right": {
"anyOf": [
{
"type": "string",
"maxLength": 5,
"pattern": "^[01]*$"
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"maxItems": 32,
"items": {
"type": "string",
"maxLength": 5,
"pattern": "^[01]*$"
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"left": "01",
"right": "10",
"claim": [
"0",
"1"
]
}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