Skip to content

parth13m/100-Leetcode-problems

 
 

Repository files navigation

🧠 100 Days of LeetCode

This repository contains my solutions to 100 essential LeetCode problems, covering Data Structures and Algorithms commonly asked in FAANG / top product-based company interviews.

The goal of this repo is to:

  • Build strong DSA fundamentals
  • Practice patterns, not just problems
  • Improve problem-solving + coding speed
  • Become interview-ready

🚀 Progress

Status Count
✅ Problems Solved 0 / 100
🕒 Ongoing Yes
🎯 Goal Complete within 100 Days

I update this repository daily.


📂 Topic-wise Problem Categories

This repository is organized by DSA topics to help understand patterns instead of random problem solving.

Folder Name Description
Array Problems based on traversal, prefix sums, sorting, searching, etc.
String Pattern matching, frequency maps, transformations, substring logic.
LinkedList Node operations, reversing, merging, cycle detection, etc.
Stack Parenthesis problems, monotonic stack, evaluators, backtracking helper.
Queue FIFO operations, circular queues, and queue-based patterns.
Hashing Problems using hash maps/sets for fast lookup and frequency counts.
TwoPointers Problems involving two indices narrowing or expanding across arrays/strings.
BinarySearch Classic binary search + binary search on answer problems.
SlidingWindow Subarray/substring problems optimizing using dynamic windows.
Trees Binary trees, traversal techniques, recursive DFS, BFS.
Graphs Graph traversal (BFS, DFS), shortest paths, connectivity problems.
DynamicProgramming Optimization problems using memoization/tabulation.

Each problem goes inside the correct topic folder.

File name format: ProblemName.cpp ProblemName.py ProblemName.java


💻 Supported Languages

You may submit solutions in:

  • C++
  • Python
  • Java

🤝 How to Contribute

1. Fork the repository

Click the Fork button on top-right.

2. Clone your fork

git clone https://github.com/ /100-LeetCode-Problems.git cd 100-LeetCode-Problems

3. Create a new branch

git checkout -b add-solution-problemname

4. Add your solution

Place your file correctly. Example:

5. (Optional but encouraged) Add explanation

Inside the same folder, add a short explanation: Approach

Explain your logic in 3-6 lines.

Complexity

Time: O(...) Space: O(...)

6. Commit and push your changes

git add . git commit -m "Added Two Sum solution in C++" git push origin add-solution-problemname

7. Open Pull Request (PR)

Go to your fork → Compare & pull request → Submit → Done ✅
We will review and merge.


✅ Contribution Guidelines

Rule Description
Write clean code Make it easy to understand
Add comments if needed Especially for tricky logic
Prefer optimized solution Brute force allowed only with explanation
Add time & space complexity Required
No copy-paste answers Must be your own understanding

🌟 Contributors

This section will include contributors as PRs are merged.

Made with ❤️ by Your Name

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Java 100.0%