Implement N Stacks Using a Single Array | Programming Challenges

Introduction

In computer science, a stack is an abstract data type that serves as a collection of elements, with two main operations: push, which adds an element to the collection, and pop, which removes the most recently added element that was not yet removed. In this challenge, we will implement n stacks using a single array.

Skills Graph

%%%%{init: {'theme':'neutral'}}%%%% flowchart RL algorithm(("`Algorithm`")) -.-> algorithm/BasicAlgorithmsGroup(["`Basic Algorithms`"]) python(("`Python`")) -.-> python/ControlFlowGroup(["`Control Flow`"]) python(("`Python`")) -.-> python/DataStructuresGroup(["`Data Structures`"]) python(("`Python`")) -.-> python/FunctionsGroup(["`Functions`"]) python(("`Python`")) -.-> python/ObjectOrientedProgrammingGroup(["`Object-Oriented Programming`"]) python(("`Python`")) -.-> python/ErrorandExceptionHandlingGroup(["`Error and Exception Handling`"]) algorithm/BasicAlgorithmsGroup -.-> algorithm/stacks_queues("`Stacks Queues`") python/ControlFlowGroup -.-> python/conditional_statements("`Conditional Statements`") python/DataStructuresGroup -.-> python/lists("`Lists`") python/DataStructuresGroup -.-> python/tuples("`Tuples`") python/FunctionsGroup -.-> python/function_definition("`Function Definition`") python/ObjectOrientedProgrammingGroup -.-> python/classes_objects("`Classes and Objects`") python/ObjectOrientedProgrammingGroup -.-> python/constructor("`Constructor`") python/ObjectOrientedProgrammingGroup -.-> python/polymorphism("`Polymorphism`") python/ObjectOrientedProgrammingGroup -.-> python/encapsulation("`Encapsulation`") python/ErrorandExceptionHandlingGroup -.-> python/raising_exceptions("`Raising Exceptions`") subgraph Lab Skills algorithm/stacks_queues -.-> lab-268883{{"`Implementing Multiple Stacks Using Array`"}} python/conditional_statements -.-> lab-268883{{"`Implementing Multiple Stacks Using Array`"}} python/lists -.-> lab-268883{{"`Implementing Multiple Stacks Using Array`"}} python/tuples -.-> lab-268883{{"`Implementing Multiple Stacks Using Array`"}} python/function_definition -.-> lab-268883{{"`Implementing Multiple Stacks Using Array`"}} python/classes_objects -.-> lab-268883{{"`Implementing Multiple Stacks Using Array`"}} python/constructor -.-> lab-268883{{"`Implementing Multiple Stacks Using Array`"}} python/polymorphism -.-> lab-268883{{"`Implementing Multiple Stacks Using Array`"}} python/encapsulation -.-> lab-268883{{"`Implementing Multiple Stacks Using Array`"}} python/raising_exceptions -.-> lab-268883{{"`Implementing Multiple Stacks Using Array`"}} end

N Stacks

Problem

Implement n stacks using a single array. The stacks and array are fixed size and equally sized. Pushing to a full stack results in an exception, and popping from an empty stack also results in an exception. We can assume the user passed in stack index is valid, and that this fits memory.

Requirements

To implement n stacks using a single array, we need to meet the following requirements:

The stacks and array are fixed size.

The stacks are equally sized.

Pushing to a full stack results in an exception.

Popping from an empty stack results in an exception.

We can assume the user passed in stack index is valid.

We can assume this fits memory.

Example Usage

To test the implementation of n stacks using a single array, we can perform the following actions on the three stacks:

Push to full stack -> Exception

Push to non-full stack

Pop on empty stack -> Exception

Pop on non-empty stack

Implementing Multiple Stacks Using Array