shubhamgoel27 / ds-algo

Data Structures and Algorithms Practice

Welcome to my Data Structures and Algorithms practice repository. This collection tracks my progress, solutions, and notes for various coding challenges and algorithmic problems.

Table of Contents

• Data Structures and Algorithms Practice
  • Table of Contents
  • Overview
  • Repository Structure
  • Problem Categories
  • How to Use
  • Testing
  • Contributing
  • Resources
  • License

Overview

This repository serves as a personal collection of data structure and algorithm problems, including implementations, explanations, and test cases. It aims to provide a comprehensive guide to common problems and their solutions, making it easier to review and practice.

Repository Structure

Each problem is typically contained in its own Python file, named descriptively (e.g., binary_tree_vertical_traversal.py). Many files include both the solution and associated test cases.

Problem Categories

The repository covers a wide range of topics, including but not limited to:

• Binary Trees and Binary Search Trees
• Linked Lists
• Arrays and Strings
• Heaps and Priority Queues
• Graphs
• Dynamic Programming
• Design Problems (e.g., LRU Cache)
• Sorting and Searching
• Stack and Queue
• Hash Tables
• Two Pointers and Sliding Window
• Bit Manipulation

How to Use

1. Clone the Repository:

   git clone https://github.com/your-username/ds-algo-problems.git
   cd ds-algo-problems

2. Navigate to a Specific Problem: Browse the repository to find a problem you're interested in.

3. Run the Solution: Each solution file can be run independently:

   python path/to/solution.py

4. Explore the Code: Each file typically contains:

   • Problem description (in comments)
   • Solution implementation
   • Test cases (where applicable)

Testing

Many solutions include built-in test cases. To run the tests:

1. Navigate to the specific problem file.
2. Run the Python file directly. Most files include a if __name__ == "__main__": block that executes the tests.

Example:

python3 merge_sorted_arrays.py

Look for output indicating whether tests passed or failed.

Contributing

While this is a personal practice repository, suggestions for improvements are welcome:

1. Fork the repository
2. Create a new branch (git checkout -b feature/improvement)
3. Make your changes
4. Commit your changes (git commit -am 'Add some improvement')
5. Push to the branch (git push origin feature/improvement)
6. Create a new Pull Request

Resources

• LeetCode
• HackerRank
• "Cracking the Coding Interview" by Gayle Laakmann McDowell
• GeeksforGeeks

License

This project is licensed under the MIT License - see the LICENSE file for details.

---

Happy coding and problem-solving!