Tag Archives: complexity


Stacks are powerful data structures that can help us solve many complex programming problems. Stacks can be used in some use-cases like: Develop UNDO functionality Build Compilers Evaluate Arithmetic Expressions Develop navigation features in our application (moving forward and backward) Structure of a Stack Stacks can be visualized as a stack of books. The peculiarity […]

Linked List

Linked Lists are one of the most commonly used Linear Data Structures after arrays. They solve many problems of arrays and are used for building complex data structures. Unlike arrays, Linked Lists can grow and shrink automatically. A Linked List has a sequence of nodes. Every node has a value & address to next node […]


Arrays are built into most programming languages and we use them to SORT a list of items sequentially. Since Arrays are a type of Linear Data Structures, they store data in the memory sequentially. For example, if we have a set of 5 integers [10, 20, 30, 40, 50], they would be allocated in the […]