Repository Structure

The repository is organized by topic to make it easier to navigate:

• Arrays: Basic operations, searching, and sorting.
• Linked Lists: Singly, doubly, and circular linked lists.
• Stacks & Queues: Implementations using arrays and pointers.
• Recursion: Classic problems and divide-and-conquer techniques.
• Trees & Graphs: Binary trees, BSTs, traversals, and graph algorithms.
• Sorting & Searching: Bubble, selection, insertion, quicksort, mergesort, and binary search.

How to Run

Most of the programs in this repository are written in C++. To run any specific file, ensure you have a C++ compiler (like g++) installed.

1. Clone the repository:

   git clone https://github.com/VINODvoid/dsa.git
   cd dsa

2. Compile a specific file:

   g++ path/to/your/file.cpp -o output

3. Execute the file:

   ./output

Purpose

This repository serves as a personal archive for:

• Practicing competitive programming problems.
• Understanding the time and space complexity of different approaches.
• Refreshing core concepts for interviews and academic coursework.

Contributing

While this is a personal project, I appreciate any feedback! If you find a bug in my logic or want to suggest a more optimized solution for a specific problem, feel free to open a Pull Request or start an Issue.

---

Happy coding!