PhD Candidate in Computer Engineering | Passionate about Algorithms and Scalable Backend Systems.
- Algorithms: Dynamic Programming, Graph Theory (BFS/DFS), Backtracking, and Divide & Conquer.
- Data Structures: Advanced Trees (Tries, Segment Trees), Heaps, Graphs, and HashTables.
- System Logic: String Processing, Sliding Window Optimization, and Two-Pointers.
- Complexity: Rigorous Time & Space Complexity Analysis for all solutions.
Collection of LeetCode questions to ace the coding interview! - Created using LeetHub-3.0
| Problem Name | Difficulty |
|---|---|
| 0053-maximum-subarray | Medium |
| 3653-xor-after-range-multiplication-queries-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0053-maximum-subarray | Medium |
| 0062-unique-paths | Medium |
| 0063-unique-paths-ii | Medium |
| 0064-minimum-path-sum | Medium |
| 0091-decode-ways | Medium |
| 0120-triangle | Medium |
| 0122-best-time-to-buy-and-sell-stock-ii | Medium |
| 0213-house-robber-ii | Medium |
| 0392-is-subsequence | Easy |
| 0931-minimum-falling-path-sum | Medium |
| 1262-greatest-sum-divisible-by-three | Medium |
| 1289-minimum-falling-path-sum-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 2363-merge-similar-items | Easy |
| Problem Name | Difficulty |
|---|---|
| 1455-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence | Easy |
| Problem Name | Difficulty |
|---|---|
| 2976-minimum-cost-to-convert-string-i | Medium |
| 3600-maximize-spanning-tree-stability-with-upgrades | Hard |
| 3650-minimum-cost-path-with-edge-reversals | Medium |
| Problem Name | Difficulty |
|---|---|
| 0621-task-scheduler | Medium |
| 1878-get-biggest-three-rhombus-sums-in-a-grid | Medium |
| 2500-delete-greatest-value-in-each-row | Easy |
| 3264-final-array-state-after-k-multiplication-operations-i | Easy |
| 3650-minimum-cost-path-with-edge-reversals | Medium |
| Problem Name | Difficulty |
|---|---|
| 2976-minimum-cost-to-convert-string-i | Medium |
| 3650-minimum-cost-path-with-edge-reversals | Medium |
| Problem Name | Difficulty |
|---|---|
| 0071-simplify-path | Medium |
| 0084-largest-rectangle-in-histogram | Hard |
| 0739-daily-temperatures | Medium |
| 1047-remove-all-adjacent-duplicates-in-string | Easy |
| 1475-final-prices-with-a-special-discount-in-a-shop | Easy |
| 1614-maximum-nesting-depth-of-the-parentheses | Easy |
| 1700-number-of-students-unable-to-eat-lunch | Easy |
| 2000-reverse-prefix-of-word | Easy |
| 2751-robot-collisions | Hard |
| 3174-clear-digits | Easy |
| Problem Name | Difficulty |
|---|---|
| 0084-largest-rectangle-in-histogram | Hard |
| 0739-daily-temperatures | Medium |
| 1475-final-prices-with-a-special-discount-in-a-shop | Easy |
| Problem Name | Difficulty |
|---|---|
| 0744-find-smallest-letter-greater-than-target | Easy |
| 0852-peak-index-in-a-mountain-array | Medium |
| 1346-check-if-n-and-its-double-exist | Easy |
| 3600-maximize-spanning-tree-stability-with-upgrades | Hard |
| 3634-minimum-removals-to-balance-array | Medium |
| Problem Name | Difficulty |
|---|---|
| 0130-surrounded-regions | Medium |
| 3600-maximize-spanning-tree-stability-with-upgrades | Hard |
| Problem Name | Difficulty |
|---|---|
| 3600-maximize-spanning-tree-stability-with-upgrades | Hard |
| Problem Name | Difficulty |
|---|---|
| 2778-sum-of-squares-of-special-elements | Easy |
| 2843-count-symmetric-integers | Easy |
| 2951-find-the-peaks | Easy |
| 2975-maximum-square-area-by-removing-fences-from-a-field | Medium |
| 3546-equal-sum-grid-partition-i | Medium |
| 3548-equal-sum-grid-partition-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 0039-combination-sum | Medium |
| 1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n | Medium |
| Problem Name | Difficulty |
|---|---|
| 2221-find-triangular-sum-of-an-array | Medium |
| 3334-find-the-maximum-factor-score-of-array | Medium |
| Problem Name | Difficulty |
|---|---|
| 3227-vowels-game-in-a-string | Medium |
| 3577-count-the-number-of-computer-unlocking-permutations | Medium |
| Problem Name | Difficulty |
|---|---|
| 0843-guess-the-word | Hard |
| 3227-vowels-game-in-a-string | Medium |
| Problem Name | Difficulty |
|---|---|
| 1700-number-of-students-unable-to-eat-lunch | Easy |
| Problem Name | Difficulty |
|---|---|
| 3304-find-the-k-th-character-in-string-game-i | Easy |
| 3307-find-the-k-th-character-in-string-game-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 0062-unique-paths | Medium |
| 2221-find-triangular-sum-of-an-array | Medium |
| 3577-count-the-number-of-computer-unlocking-permutations | Medium |
| Problem Name | Difficulty |
|---|---|
| 0380-insert-delete-getrandom-o1 | Medium |
| 1476-subrectangle-queries | Medium |
| 2069-walking-robot-simulation-ii | Medium |
| Problem Name | Difficulty |
|---|---|
| 0843-guess-the-word | Hard |
| Problem Name | Difficulty |
|---|---|
| 0380-insert-delete-getrandom-o1 | Medium |
| Problem Name | Difficulty |
|---|---|
| 0019-remove-nth-node-from-end-of-list | Medium |
| 0237-delete-node-in-a-linked-list | Medium |
| 0876-middle-of-the-linked-list | Easy |
| Problem Name | Difficulty |
|---|---|
| 0130-surrounded-regions | Medium |
| Problem Name | Difficulty |
|---|---|
| 0130-surrounded-regions | Medium |