Welcome to the ultimate hub for Love Babbar's DSA Supreme Batch! This repository is your one-stop destination for everything related to the DSA Supreme Batch by Love Babbar. From comprehensive DSA questions to detailed solutions, homework assignments, presentation materials, and code snippets - we've got it all covered!
This repository aims to provide a comprehensive collection of Data Structures and Algorithms questions with their solutions. Whether you're a beginner learning DSA or an experienced programmer revising concepts, this repository can serve as a valuable resource.
You can navigate through the topics mentioned in the table of contents to find questions and solutions related to specific data structures and algorithms. Feel free to explore the codes, understand the implementations, and contribute your own solutions or suggest improvements.
Contributions are welcome! If you have a new question to add, found a bug in existing code, or want to improve documentation, please follow these steps:
- Fork the repository.
- Create a new branch (
git checkout -b feature/add-new-question). - Make your changes.
- Commit your changes (
git commit -am 'Add new question: [question name]'). - Push to the branch (
git push origin feature/add-new-question). - Create a pull request.
Please ensure your pull request follows the repository's guidelines and includes a clear description of the changes made.
Here are the different topics covered in this repository along with links to their respective directories:
- Questions related to basics of programming - 1: Basics of Programming - 1
- Questions related to basics of programming - 2: Basics of Programming - 2
- Questions related to arrays, time complexity, and space complexity: Arrays, Time & Space Complexity
- Questions related to searching and sorting algorithms: Searching & Sorting
- Questions related to character arrays and strings: Char Arrays & Strings
- Questions related to basic mathematics and pointers: Basic Maths & Pointers
- Questions related to recursion and backtracking: Recursion & Backtracking
- Questions related to divide and conquer, time complexity, and space complexity: Divide & Conquer, Time Complexity & Space Complexity
- Questions related to Object-Oriented Programming: OOP
- Questions related to linked lists: Linked Lists
- Questions related to stacks: Stacks
- Questions related to queues: Queues
- Questions related to trees - 1: Trees - 1
- Questions related to binary search trees: Binary Search Trees
This repository is licensed under the MIT License. Feel free to use the code and contribute to the repository following the guidelines mentioned in the Contributing section.