Leetcode Study Vault

This repository was created as a way to deepen understanding of algorithms and data structures by solving problems from Leetcode. Each solution is documented to serve as both a reference and a personal learning log.

It is structured in a way that makes it easy to review, revisit, and expand my problem-solving knowledge over time.

Topics

All the topics organized in a logical order to study.

1. Arrays
2. Linked Lists
3. Recursion
4. Sorting
5. Binary Search
6. Trees
7. Backtracking
8. Heap
9. Hashing
10. Graphs
11. Dynamic Programming
12. Bit Manipulation

How to Study with This Repository

1. Start with Core Skills

   • Each topic begins with fundamental problems where the goal is to learn/implement the algorithm or concept from scratch.
   • Example: Writing your own sorting algorithm instead of just using std::sort.

2. Move on to Practice Questions

   • Once the concept is clear, continue with progressively harder problems.
   • These problems are numbered and organized, so you can follow them like a syllabus.

3. Review and Revisit

   • Each folder has a README.md summarizing concepts and key takeaways.

Repository Structure

Organized by topic (e.g., arrays, graph, dp). Each problem is in a numbered folder with a slug:

📁 arrays/
  ├── 001_two_sum/
  │   ├── solution.cpp
  │   └── README.md

Content Documentation: How to Add a New Problem

This repo includes a helper script to standardize documentation:

1. Make the script executable:

chmod +x add_problem.sh

2. Run it:

./add_problem.sh

It will prompt you for:

• Category (e.g., arrays/binarysearch)
• Problem title
• Difficulty (optional)

It then creates a folder with:

• solution.cpp
• README.md And updates all README files automatically.

Author info

Made with dedication by Shellyda