HALOWERKDatenvertragswerk
shortest binary superstring inventory
For0to4 binary input words of length1to3, construct ALL minimum-length strings containing each original word as a contiguous substring. Solutions sort lexicographically. Return each entire solution and every overlapping zero-based start offset for every original input word, preserving input order and duplicates. Duplicate/contained constraints do not alter the feasible language; original occurrence witnesses remain. Empty input has one shortest empty string. Whole ordered solution-list claim.
POST https://datenvertrag.halowerk.com/v1/shortest-binary-superstring-inventoryEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| words | Siehe Schema | Ja | |
| claimed_superstrings | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"words",
"claimed_superstrings"
],
"properties": {
"words": {
"anyOf": [
{
"type": "array",
"maxItems": 4,
"items": {
"type": "string",
"minLength": 1,
"maxLength": 3,
"pattern": "^[01]+$"
}
},
{
"type": "null"
}
]
},
"claimed_superstrings": {
"anyOf": [
{
"type": "array",
"maxItems": 24,
"items": {
"type": "string",
"minLength": 0,
"maxLength": 12,
"pattern": "^[01]*$"
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"words": [
"01",
"10"
],
"claimed_superstrings": [
"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