One problem at a time. Every day.
"Consistency beats intensity. Show up. Solve. Repeat."
This is my personal DSA and LeetCode practice log — a running record of every problem I solve, written cleanly with explanations and multiple approaches where applicable.
The goal isn't just to solve problems. It's to understand them deeply — brute force first, then optimized, then optimal. Every solution here is something I've worked through from scratch.
Files are named directly by LeetCode problem number and title — flat structure, no subfolders, no language-based grouping.
DSA_Practice/
├── 1. Two Sum
├── 2. Add Two Numbers
├── 3. Longest Substring Without Repeating Characters
├── 4. Median of Two Sorted Arrays
├── 5. Longest Palindromic Substring
├── 6. Zigzag Conversion
├── 7. Reverse Integer
├── 8. String to Integer (atoi)
├── 9. Palindrome Number
├── 10. Regular Expression Matching
└── ...
One file per problem. Organized by problem number. Simple and consistent.
Every solution follows a structured thinking pattern:
| Step | What it means |
|---|---|
| 🔴 Brute Force | The most straightforward naive solution — just make it work |
| 🟡 Better | Eliminate redundant work — think before optimizing |
| 🟢 Optimal | Best possible time and space complexity with clean code |
Not every problem needs all three steps — but every problem gets thought through properly.
- Solve 250+ LeetCode problems across multiple topics and languages
- Complete the LeetCode 75 list
- Complete the SQL 50 list
- Complete the Introduction to Pandas list
- Cover all major DSA topics:
Arrays·Strings·Linked Lists·Trees·Graphs·Dynamic Programming·Sorting·Binary Search·SQL - Maintain a daily practice streak
LeetCode supports many languages — I use whichever fits the problem best.
If you're also grinding DSA, let's connect!
Updated regularly · Built with consistency by Samridhi Gupta