Daily Practice Problem - LeetCode Questions

This repository contains daily LeetCode practice problems organized by topic/category.

Repository Structure

Problems are organized into folders based on their primary topic:

• array/ - Array manipulation and operations
• linked-list/ - Linked list problems
• tree/ - Binary trees, BST, and tree traversal problems
• string/ - String manipulation problems
• hash-table/ - Hash table and hash map problems
• two-pointers/ - Two pointers technique problems
• sliding-window/ - Sliding window technique problems
• binary-search/ - Binary search problems
• stack/ - Stack data structure problems
• queue/ - Queue data structure problems
• heap/ - Heap/Priority queue problems
• graph/ - Graph theory problems
• dp/ - Dynamic programming problems
• backtracking/ - Backtracking algorithm problems
• greedy/ - Greedy algorithm problems

How to Use

Each problem is stored in its own folder within the appropriate category. The folder name follows the LeetCode convention: {problem-number}-{problem-name}.

Each problem folder contains:

• README.md - Problem description from LeetCode
• Solution files (e.g., .cpp, .java, .py, etc.)
• Notes.md - (Optional) Additional notes and explanations

Contributing

When adding a new problem:

1. Create a new folder in the appropriate category
2. Name it following the convention: {number}-{problem-name}
3. Add the problem description and solution files

Happy coding! 🚀