This repository is a comprehensive collection of my efforts in Data Structures and Algorithms (DSA). It's designed to be a personal learning log, a reference for common DSA concepts, and a place to showcase solutions to various algorithmic problems.
This repository is organized by DSA topics, with each topic having its own dedicated folder. Inside each topic folder, you'll find:
-
Detailed Explanations: A
README.mdfile explaining the core concepts, common algorithms, and problem-solving approaches related to that topic. -
Code Implementations: Solutions to various problems, typically implemented in C++.
You can explore specific DSA topics by clicking on the links below. Each link will take you to the README.md file for that topic, providing an overview and links to the relevant code files.
Here are the topics covered in this repository:
- Sorting Techniques
- Arrays
- Backtracking
- Recursion
- Divide And Conquer
- Time And Space Complexity
- Bitwise
- Linked List
- Matrices
- Stack
- Queue
- Tree
- Heap/Priority Queue
- Hashing
- Trie
-
For Learning : Feel free to browse through the topics, read the explanations, and examine the code implementations.
-
For Referance : If you need a quick refresher on a specific algorithm or data structure, this repository can serve as a handy reference.
Follow Me On :
This Repository is Maintain By Me & Kajal Yadhuvanshi
Open your terminal and paste the following links
git clone https://github.com/Afzal14786/DSA-Revision.git
cd DSA-Revision