Skip to content

README.md

Latest commit

 

History

History
33 lines (24 loc) · 1.21 KB

README.md

File metadata and controls

33 lines (24 loc) · 1.21 KB
Raw

Data Structures Implementations

This directory contains clean, to-the-point references and implementations of linear data structures in Python, designed for Competitive Programming (CP) and Data Structures & Algorithms (DSA).

Linear Data Structures

Linear data structures arrange elements sequentially or in a linear sequence, where each element is connected to its previous and next adjacent elements.

Currently documented structures:

  • Arrays (Dynamic Arrays / Python Lists): 01_arrays - Core reference for dynamic array operations, complexities, and basic search/reverse algorithms.
  • Stacks (Last-In-First-Out): 02_stacks - Reference for stack operations and their application in parentheses validation.
  • Queues (First-In-First-Out): 03_queues - Reference for queue operations with list, deque, and custom linked node implementations.

Repository File Structure

data_structures/
├── README.md
├── 01_arrays/
│   ├── README.md
│   └── arrays.py
├── 02_stacks/
│   ├── README.md
│   └── stacks.py
└── 03_queues/
    ├── README.md
    └── queues.py