🚀 LeetCode Journey

"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.

---

🎯 Goals

• ✅ Solve LeetCode problems every day
• ✅ Improve logical thinking and coding skills
• ✅ Master Data Structures & Algorithms
• ✅ Prepare for Product-Based Company interviews
• ✅ Maintain coding consistency

---

📌 Repository Structure

LeetCode/
│
├── Easy/
├── Medium/
├── Hard/
└── README.md

Each solution includes:

• ✔️ Clean and readable code
• ✔️ Optimized approach whenever possible
• ✔️ Problem name
• ✔️ Time & Space Complexity

---

💻 Languages Used

• Python 🐍

(More languages may be added in the future.)

---

📈 Progress

Difficulty	Status
🟢 Easy	✔️ Solving
🟡 Medium	✔️ Solving
🔴 Hard	✔️ Solving

---

🎓 Why This Repository?

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

---

🌟 Connect With Me

• 💼 LinkedIn: www.linkedin.com/in/dharavath-anand225
• 💻 GitHub: https://github.com/Anand2252024

---

⭐ If you find this repository helpful, don't forget to star it!

Happy Coding! 🚀

LeetCode Topics

Math

0009-palindrome-number
0060-permutation-sequence
0070-climbing-stairs
0089-gray-code
0367-valid-perfect-square
0368-largest-divisible-subset
0372-super-pow
0628-maximum-product-of-three-numbers
3014-minimum-number-of-pushes-to-type-word-i
3312-sorted-gcd-pair-queries
3513-number-of-unique-xor-triplets-i
3518-smallest-palindromic-rearrangement-ii
3536-maximum-product-of-two-digits

Binary Search

0004-median-of-two-sorted-arrays
0074-search-a-2d-matrix
0081-search-in-rotated-sorted-array-ii
0367-valid-perfect-square
0374-guess-number-higher-or-lower
0493-reverse-pairs
3312-sorted-gcd-pair-queries

Hash Table

0001-two-sum
0030-substring-with-concatenation-of-all-words
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0126-word-ladder-ii
0127-word-ladder
0128-longest-consecutive-sequence
0133-clone-graph
0138-copy-list-with-random-pointer
0139-word-break
0140-word-break-ii
0141-linked-list-cycle
0142-linked-list-cycle-ii
0383-ransom-note
0387-first-unique-character-in-a-string
0389-find-the-difference
0451-sort-characters-by-frequency
1331-rank-transform-of-an-array
3312-sorted-gcd-pair-queries
3518-smallest-palindromic-rearrangement-ii

String

0010-regular-expression-matching
0020-valid-parentheses
0030-substring-with-concatenation-of-all-words
0079-word-search
0091-decode-ways
0115-distinct-subsequences
0125-valid-palindrome
0126-word-ladder-ii
0127-word-ladder
0131-palindrome-partitioning
0132-palindrome-partitioning-ii
0139-word-break
0140-word-break-ii
0383-ransom-note
0387-first-unique-character-in-a-string
0389-find-the-difference
0451-sort-characters-by-frequency
1081-smallest-subsequence-of-distinct-characters
3014-minimum-number-of-pushes-to-type-word-i
3517-smallest-palindromic-rearrangement-i
3518-smallest-palindromic-rearrangement-ii

Counting

0383-ransom-note
0387-first-unique-character-in-a-string
0451-sort-characters-by-frequency
3312-sorted-gcd-pair-queries
3518-smallest-palindromic-rearrangement-ii

Interactive

0374-guess-number-higher-or-lower

Queue

0387-first-unique-character-in-a-string

Bit Manipulation

0078-subsets
0089-gray-code
0090-subsets-ii
0136-single-number
0137-single-number-ii
0389-find-the-difference
3513-number-of-unique-xor-triplets-i

Sorting

0368-largest-divisible-subset
0389-find-the-difference
0451-sort-characters-by-frequency
0628-maximum-product-of-three-numbers
1331-rank-transform-of-an-array
1464-maximum-product-of-two-elements-in-an-array
3517-smallest-palindromic-rearrangement-i
3536-maximum-product-of-two-digits

Array

0001-two-sum
0004-median-of-two-sorted-arrays
0051-n-queens
0074-search-a-2d-matrix
0078-subsets
0079-word-search
0080-remove-duplicates-from-sorted-array-ii
0081-search-in-rotated-sorted-array-ii
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0090-subsets-ii
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0118-pascals-triangle
0119-pascals-triangle-ii
0120-triangle
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0123-best-time-to-buy-and-sell-stock-iii
0128-longest-consecutive-sequence
0130-surrounded-regions
0134-gas-station
0135-candy
0136-single-number
0137-single-number-ii
0139-word-break
0140-word-break-ii
0368-largest-divisible-subset
0493-reverse-pairs
0628-maximum-product-of-three-numbers
1260-shift-2d-grid
1331-rank-transform-of-an-array
1464-maximum-product-of-two-elements-in-an-array
3312-sorted-gcd-pair-queries
3513-number-of-unique-xor-triplets-i

Dynamic Programming

0010-regular-expression-matching
0070-climbing-stairs
0085-maximal-rectangle
0091-decode-ways
0115-distinct-subsequences
0118-pascals-triangle
0119-pascals-triangle-ii
0120-triangle
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0123-best-time-to-buy-and-sell-stock-iii
0124-binary-tree-maximum-path-sum
0131-palindrome-partitioning
0132-palindrome-partitioning-ii
0139-word-break
0140-word-break-ii
0368-largest-divisible-subset

Database

0511-game-play-analysis-i
0550-game-play-analysis-iv
0570-managers-with-at-least-5-direct-reports
0577-employee-bonus
0584-find-customer-referee
0585-investments-in-2016
0586-customer-placing-the-largest-number-of-orders
0595-big-countries
0596-classes-with-at-least-5-students
0601-human-traffic-of-stadium
0602-friend-requests-ii-who-has-the-most-friends

Combinatorics

3312-sorted-gcd-pair-queries
3518-smallest-palindromic-rearrangement-ii

Number Theory

3312-sorted-gcd-pair-queries

Prefix Sum

3312-sorted-gcd-pair-queries

Stack

0020-valid-parentheses
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0114-flatten-binary-tree-to-linked-list
0143-reorder-list
0144-binary-tree-preorder-traversal
1081-smallest-subsequence-of-distinct-characters

Greedy

0122-best-time-to-buy-and-sell-stock-ii
0134-gas-station
0135-candy
1081-smallest-subsequence-of-distinct-characters
3014-minimum-number-of-pushes-to-type-word-i

Monotonic Stack

0084-largest-rectangle-in-histogram
0085-maximal-rectangle
1081-smallest-subsequence-of-distinct-characters

Heap (Priority Queue)

0023-merge-k-sorted-lists
0451-sort-characters-by-frequency
1464-maximum-product-of-two-elements-in-an-array

Bucket Sort

0451-sort-characters-by-frequency

Divide and Conquer

0004-median-of-two-sorted-arrays
0023-merge-k-sorted-lists
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0372-super-pow
0493-reverse-pairs

Binary Indexed Tree

0493-reverse-pairs

Segment Tree

0493-reverse-pairs

Merge Sort

0023-merge-k-sorted-lists
0493-reverse-pairs

Ordered Set

0493-reverse-pairs

Matrix

0074-search-a-2d-matrix
0079-word-search
0085-maximal-rectangle
0130-surrounded-regions
1260-shift-2d-grid

Simulation

1260-shift-2d-grid

Recursion

0010-regular-expression-matching
0021-merge-two-sorted-lists
0060-permutation-sequence
0143-reorder-list

Sliding Window

0030-substring-with-concatenation-of-all-words

Linked List

0021-merge-two-sorted-lists
0023-merge-k-sorted-lists
0082-remove-duplicates-from-sorted-list-ii
0083-remove-duplicates-from-sorted-list
0109-convert-sorted-list-to-binary-search-tree
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0138-copy-list-with-random-pointer
0141-linked-list-cycle
0142-linked-list-cycle-ii
0143-reorder-list

Memoization

0070-climbing-stairs
0139-word-break
0140-word-break-ii

Enumeration

1291-sequential-digits

Backtracking

0051-n-queens
0052-n-queens-ii
0077-combinations
0078-subsets
0079-word-search
0089-gray-code
0090-subsets-ii
0113-path-sum-ii
0126-word-ladder-ii
0131-palindrome-partitioning
0140-word-break-ii

Depth-First Search

0079-word-search
0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0130-surrounded-regions
0133-clone-graph
0144-binary-tree-preorder-traversal

Two Pointers

0080-remove-duplicates-from-sorted-array-ii
0082-remove-duplicates-from-sorted-list-ii
0125-valid-palindrome
0141-linked-list-cycle
0142-linked-list-cycle-ii
0143-reorder-list

Tree

0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0107-binary-tree-level-order-traversal-ii
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0144-binary-tree-preorder-traversal

Breadth-First Search

0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0107-binary-tree-level-order-traversal-ii
0111-minimum-depth-of-binary-tree
0112-path-sum
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0126-word-ladder-ii
0127-word-ladder
0130-surrounded-regions
0133-clone-graph

Binary Tree

0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0107-binary-tree-level-order-traversal-ii
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0144-binary-tree-preorder-traversal

Binary Search Tree

0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree

Counting Sort

3517-smallest-palindromic-rearrangement-i

Union-Find

0128-longest-consecutive-sequence
0130-surrounded-regions

Graph Theory

0133-clone-graph

Trie

0139-word-break
0140-word-break-ii