Skip to main content

For challenges involving stack-like data structures (see tag wiki for details), including interpreters of stack-based programming languages and challenges specifically about call stacks.

For challenges involving stack-like data structures, such as interpreters of stack-based programming languages.

This tag covers data structures based off the traditional last in, first out stack. The data structure may have additional operations compared to the traditional stack, such as swapping or rotating elements. However, the structure should be linear and operations should be applied primarily to one end, such that the notion of a "top" of the stack still makes sense.