💻 Daily coding challenges solved by Sayam, powered by consistent DSA practice. 🧠 Exploring algorithms, sharpening problem-solving skills, and building consistency through LeetCode — one challenge at a time. 🚀
Welcome to my daily LeetCode journey! 🚀
This repository contains my solutions to LeetCode problems, maintained as a growing archive of my Data Structures & Algorithms practice.
The goal isn't just to solve problems — it's to develop consistency, logical thinking, algorithmic intuition, and efficient problem-solving skills over time.
Every solved problem represents another step toward becoming a better programmer. 💻
Solve → Learn → Improve → Repeat. 🔁
This repository is built around a few simple objectives:
- 🧠 Strengthen Data Structures & Algorithms fundamentals
- 💻 Solve coding problems consistently
- ⚡ Improve algorithmic thinking and optimization
- 🔍 Learn different approaches to the same problem
- 📈 Track long-term problem-solving progress
- 🔥 Build a habit of coding every day
- 🏗️ Create a personal archive of solved problems
- 🚀 Prepare for technical interviews and competitive programming
Solutions may cover a wide range of DSA topics:
| Topic | Examples |
|---|---|
| 🔢 Arrays | Searching, Prefix Sum, Two Pointer |
| 🔤 Strings | Manipulation, Pattern Matching |
| 🔗 Linked Lists | Traversal, Reversal, Cycles |
| 📚 Stack & Queue | Monotonic Stack, BFS |
| 🌳 Trees | Traversal, BST, Recursion |
| 🕸️ Graphs | DFS, BFS, Shortest Path |
| 🔄 Recursion | Backtracking, Divide & Conquer |
| ⚡ Dynamic Programming | Memoization, Tabulation |
| 🔍 Searching | Binary Search |
| 📊 Sorting | Classic & Optimized Algorithms |
| 🧮 Mathematics | Number Theory, Bit Manipulation |
| 💡 Greedy | Optimization-based Problems |
| 🗺️ Hashing | Hash Maps, Sets, Frequency |
| 🧠 Advanced DSA | As the journey progresses |
Problems are organized based on their LeetCode problem number and title.
leetcode-daily/
│
├── 0001-two-sum/
│ └── solution.ext
│
├── 0009-palindrome-number/
│ └── solution.ext
│
├── 0013-roman-to-integer/
│ └── solution.ext
│
├── 0020-valid-parentheses/
│ └── solution.ext
│
├── ...
│
└── README.md
The exact structure and filenames may vary depending on the language and synchronization format.
Solutions are uploaded to this repository through LeetHub V2, helping automate the process of syncing solved LeetCode problems with GitHub.
Solve Problem on LeetCode
↓
Submit Solution
↓
LeetHub V2
↓
GitHub Repository
↓
Contribution Graph 📈
This keeps the repository continuously updated while allowing me to focus primarily on solving and learning.
The language used for a solution depends on the problem and my learning goals.
Currently focusing on:
- 🟦 C++
- 🟨 JavaScript
- 🐍 Python
- ☕ Java
More languages may be added as the journey evolves.
Problems are solved across different difficulty levels:
- 🟢 Easy — Building fundamentals
- 🟡 Medium — Developing deeper problem-solving skills
- 🔴 Hard — Challenging algorithms and advanced concepts
The objective is not simply to maximize the number of problems solved, but to understand why a solution works and how it can be improved.
For each problem, the general approach is:
1. Understand the problem
↓
2. Identify constraints
↓
3. Think of possible approaches
↓
4. Choose an efficient algorithm
↓
5. Implement the solution
↓
6. Analyze Time & Space Complexity
↓
7. Submit & Learn
Whenever possible, I focus on improving both:
⏱️ Time Complexity 💾 Space Complexity
This repository will continuously evolve as more problems are solved.
Consistency over perfection.
Rather than chasing a particular number of problems, the focus is on maintaining a sustainable habit of solving, understanding, and improving every day.
Daily Practice → Better Logic
Better Logic → Better Solutions
Better Solutions → Stronger DSA
Stronger DSA → Better Problem Solving 🚀
Some milestones I'll track along the way:
- 🎯 10 Problems
- 🎯 25 Problems
- 🎯 50 Problems
- 🎯 100 Problems
- 🔥 150 Problems
- 🔥 250 Problems
- 🚀 500 Problems
- 🏆 1000 Problems
Every milestone is a checkpoint, not the destination. 🧠
DSA isn't something that can be mastered overnight.
It requires:
Consistency + Practice + Failure + Analysis + Repetition
This repository serves as a public record of that process.
Some solutions may be simple. Some may be optimized. Some may initially be imperfect.
But every solution contributes to the same objective:
Become a better problem solver, one problem at a time. 💻🧠
This is primarily a personal learning repository, so pull requests are not generally required.
However, if you notice:
- 🐛 An incorrect solution
- ⚡ A significantly better approach
- 🧠 A useful optimization
- 📝 A mistake in explanation or complexity
feel free to open an issue or suggest an improvement.
Learning is better when knowledge is shared. 🤝
These solutions are primarily intended for learning and reference.
I strongly recommend attempting each problem yourself before looking at the solution.
Don't just copy the code. Understand the logic behind it. 🧠
If you'd like to follow my development journey:
- 💼 LinkedIn: Sayam Mukherjee
- 🐙 GitHub: Sayam Mukherjee
- 💻 LeetCode: Sayam Mukherjee
If this repository helps you with your own DSA journey, consider giving it a ⭐
Every star is appreciated! 🚀
| 0005-longest-palindromic-substring |
| 0115-distinct-subsequences |
| 0005-longest-palindromic-substring |
| 0115-distinct-subsequences |
| 0005-longest-palindromic-substring |
| 0005-longest-palindromic-substring |
| 0033-search-in-rotated-sorted-array |
| 0033-search-in-rotated-sorted-array |