"Consistency beats intensity."
Welcome to my LeetCode repository! 👋
This repository contains my daily LeetCode solutions as part of my commitment to improving my problem-solving skills, strengthening Data Structures & Algorithms, and preparing for Software Engineering interviews.
- ✅ Solve LeetCode problems every day
- ✅ Improve logical thinking and coding skills
- ✅ Master Data Structures & Algorithms
- ✅ Prepare for Product-Based Company interviews
- ✅ Maintain coding consistency
LeetCode/
│
├── Easy/
├── Medium/
├── Hard/
└── README.md
Each solution includes:
- ✔️ Clean and readable code
- ✔️ Optimized approach whenever possible
- ✔️ Problem name
- ✔️ Time & Space Complexity
- Python 🐍
(More languages may be added in the future.)
| Difficulty | Status |
|---|---|
| 🟢 Easy | ✔️ Solving |
| 🟡 Medium | ✔️ Solving |
| 🔴 Hard | ✔️ Solving |
I believe consistency is the key to becoming a better software engineer.
By solving problems daily, I'm improving:
- Problem Solving
- Algorithms
- Data Structures
- Coding Speed
- Interview Readiness
- 💼 LinkedIn: www.linkedin.com/in/dharavath-anand225
- 💻 GitHub: https://github.com/Anand2252024
Happy Coding! 🚀
| 0004-median-of-two-sorted-arrays |
| 0367-valid-perfect-square |
| 0374-guess-number-higher-or-lower |
| 0493-reverse-pairs |
| 3312-sorted-gcd-pair-queries |
| 0383-ransom-note |
| 0387-first-unique-character-in-a-string |
| 0451-sort-characters-by-frequency |
| 3312-sorted-gcd-pair-queries |
| 0374-guess-number-higher-or-lower |
| 0387-first-unique-character-in-a-string |
| 0389-find-the-difference |
| 3513-number-of-unique-xor-triplets-i |
| 0368-largest-divisible-subset |
| 0389-find-the-difference |
| 0451-sort-characters-by-frequency |
| 1331-rank-transform-of-an-array |
| 0010-regular-expression-matching |
| 0070-climbing-stairs |
| 0368-largest-divisible-subset |
| 3312-sorted-gcd-pair-queries |
| 3312-sorted-gcd-pair-queries |
| 3312-sorted-gcd-pair-queries |
| 0020-valid-parentheses |
| 1081-smallest-subsequence-of-distinct-characters |
| 1081-smallest-subsequence-of-distinct-characters |
| 1081-smallest-subsequence-of-distinct-characters |
| 0023-merge-k-sorted-lists |
| 0451-sort-characters-by-frequency |
| 0451-sort-characters-by-frequency |
| 0004-median-of-two-sorted-arrays |
| 0023-merge-k-sorted-lists |
| 0372-super-pow |
| 0493-reverse-pairs |
| 0493-reverse-pairs |
| 0493-reverse-pairs |
| 0023-merge-k-sorted-lists |
| 0493-reverse-pairs |
| 0493-reverse-pairs |
| 1260-shift-2d-grid |
| 1260-shift-2d-grid |
| 0010-regular-expression-matching |
| 0021-merge-two-sorted-lists |
| 0060-permutation-sequence |
| 0030-substring-with-concatenation-of-all-words |
| 0021-merge-two-sorted-lists |
| 0023-merge-k-sorted-lists |
| 0083-remove-duplicates-from-sorted-list |
| 0070-climbing-stairs |
| 1291-sequential-digits |
| 0051-n-queens |
| 0052-n-queens-ii |