This repository contains a comprehensive collection of questions covering a wide range of topics in Data Structures and Algorithms (DSA). The 450 DSA Sheet is a curated set of problems designed to help individuals enhance their problem-solving skills and excel in technical interviews.
- Arrays
- Linked Lists
- Stacks and Queues
- Trees and Binary Search Trees (BST)
- Hashing
- Heaps
- Graphs
- Greedy Algorithms
- Dynamic Programming
- Divide and Conquer
- Backtracking
- Trie
- Bit Manipulation
- Segment Tree
- Union Find (Disjoint Set)
- Strings
- Mathematics and Number Theory
- Searching and Sorting
- Advanced Data Structures
- Miscellaneous
Clone this repository to your local machine to access the entire set of DSA questions. Each topic is organized in a separate folder, and within each folder, you will find a variety of problems categorized by difficulty level.
git clone https://github.com/iamabhish23/450DSASheet.git
cd 450DSASheetContributions to this repository are welcome! If you'd like to add a new problem, improve existing solutions, or suggest enhancements, please follow these guidelines:
- Folder Structure: Make sure to place your new problem in the appropriate folder based on its topic.
- File Naming: Name your files descriptively, indicating the problem name or a brief description.
- Readme Updates: If you add a new topic or problem, update the relevant Readme files to include it in the table of contents.
If you encounter any issues with the provided solutions or have suggestions for improvement, please open an issue on GitHub. Your feedback is valuable and will contribute to the continuous enhancement of this repository.
The problems in this repository are meant for educational purposes and interview preparation. It's recommended to understand the underlying concepts and solutions rather than focusing solely on memorizing answers.
Happy Coding! 🚀