Skip to content
HALOWERK

Datenvertragswerk

pop stack permutation image

Compute the full image of one captured permutation under ONE deterministic POP-STACK pass. Read left to right. Before pushing a new value, if it exceeds the current stack top, empty the ENTIRE stack into the output; after the final input, empty the stack. Equivalently reverse each maximal consecutive decreasing run, retaining the order of those runs. Return the entire output word. For example, [2,0,1] maps to [0,2,1]. This is a different complete map from the West single-stack pass, which.

POST https://datenvertrag.halowerk.com/v1/pop-stack-permutation-image

Inputs

Fields of the published input schema
FieldTypeRequiredDescription
permutationSee schemaYes
claimSee schemaYes
Show full input schema
{
  "type": "object",
  "properties": {
    "permutation": {
      "anyOf": [
        {
          "type": "array",
          "items": {
            "type": "integer",
            "minimum": 0,
            "maximum": 5
          },
          "minItems": 0,
          "maxItems": 6,
          "uniqueItems": true
        },
        {
          "type": "null"
        }
      ]
    },
    "claim": {
      "anyOf": [
        {
          "type": "array",
          "items": {
            "type": "integer",
            "minimum": 0,
            "maximum": 5
          },
          "minItems": 0,
          "maxItems": 6,
          "uniqueItems": true
        },
        {
          "type": "null"
        }
      ]
    }
  },
  "required": [
    "permutation",
    "claim"
  ],
  "additionalProperties": false
}

Open original schema

Published input example

{
  "permutation": [],
  "claim": []
}

Result & documentation

Machine-readable documentation of this hub

Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.

More endpoints in this hub

All endpoints in this hub โ†’