Leetcode-Submissions

Collection of LeetCode questions to ace the coding interview! - Created using LeetHub

Array

0853-most-profit-assigning-work

Two Pointers

0853-most-profit-assigning-work

Binary Search

0853-most-profit-assigning-work

Greedy

0853-most-profit-assigning-work
1285-balance-a-binary-search-tree

Sorting

0853-most-profit-assigning-work

Divide and Conquer

1285-balance-a-binary-search-tree

Tree

1285-balance-a-binary-search-tree

Depth-First Search

1285-balance-a-binary-search-tree

Binary Search Tree

1285-balance-a-binary-search-tree

Binary Tree

1285-balance-a-binary-search-tree

LeetCode Topics

String

0038-count-and-say
0072-edit-distance
0126-word-ladder-ii
0132-palindrome-partitioning-ii
0140-word-break-ii
0212-word-search-ii
0214-shortest-palindrome
0402-remove-k-digits
0686-repeated-string-match
0768-partition-labels
0957-minimum-add-to-make-parentheses-valid
1744-number-of-ways-to-form-a-target-string-given-a-dictionary
2755-extra-characters-in-a-string
3482-construct-string-with-minimum-cost

Dynamic Programming

0064-minimum-path-sum
0072-edit-distance
0085-maximal-rectangle
0132-palindrome-partitioning-ii
0140-word-break-ii
0152-maximum-product-subarray
0312-burst-balloons
0322-coin-change
0803-cheapest-flights-within-k-stops
0819-minimum-swaps-to-make-sequences-increasing
0943-sum-of-subarray-minimums
0967-minimum-falling-path-sum
1042-minimum-cost-to-merge-stones
1290-make-array-strictly-increasing
1393-maximum-value-of-k-coins-from-piles
1398-number-of-ways-to-stay-in-the-same-place-after-some-steps
1457-minimum-difficulty-of-a-job-schedule
1744-number-of-ways-to-form-a-target-string-given-a-dictionary
1986-largest-color-value-in-a-directed-graph
2176-parallel-courses-iii
2755-extra-characters-in-a-string
3105-minimum-edge-reversals-so-every-node-is-reachable
3482-construct-string-with-minimum-cost
3536-find-the-count-of-monotonic-pairs-ii
3563-select-cells-in-grid-with-maximum-score

Array

0011-container-with-most-water
0031-next-permutation
0036-valid-sudoku
0064-minimum-path-sum
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0128-longest-consecutive-sequence
0140-word-break-ii
0152-maximum-product-subarray
0153-find-minimum-in-rotated-sorted-array
0167-two-sum-ii-input-array-is-sorted
0212-word-search-ii
0312-burst-balloons
0322-coin-change
0407-trapping-rain-water-ii
0421-maximum-xor-of-two-numbers-in-an-array
0794-swim-in-rising-water
0819-minimum-swaps-to-make-sequences-increasing
0854-making-a-large-island
0876-hand-of-straights
0943-sum-of-subarray-minimums
0960-minimize-malware-spread
0967-minimum-falling-path-sum
0989-largest-component-size-by-common-factor
1024-triples-with-bitwise-and-equal-to-zero
1034-subarrays-with-k-different-integers
1042-minimum-cost-to-merge-stones
1095-two-city-scheduling
1127-last-stone-weight
1257-rank-transform-of-a-matrix
1290-make-array-strictly-increasing
1325-path-with-maximum-probability
1393-maximum-value-of-k-coins-from-piles
1447-jump-game-iv
1457-minimum-difficulty-of-a-job-schedule
1744-number-of-ways-to-form-a-target-string-given-a-dictionary
2026-merge-triplets-to-form-target-triplet
2176-parallel-courses-iii
2505-number-of-good-paths
2755-extra-characters-in-a-string
3482-construct-string-with-minimum-cost
3514-shortest-distance-after-road-addition-queries-ii
3536-find-the-count-of-monotonic-pairs-ii
3563-select-cells-in-grid-with-maximum-score
3680-count-connected-components-in-lcm-graph

Hash Table

0036-valid-sudoku
0126-word-ladder-ii
0128-longest-consecutive-sequence
0140-word-break-ii
0146-lru-cache
0421-maximum-xor-of-two-numbers-in-an-array
0768-partition-labels
0876-hand-of-straights
0960-minimize-malware-spread
0989-largest-component-size-by-common-factor
1024-triples-with-bitwise-and-equal-to-zero
1029-vertical-order-traversal-of-a-binary-tree
1034-subarrays-with-k-different-integers
1447-jump-game-iv
1986-largest-color-value-in-a-directed-graph
2505-number-of-good-paths
2755-extra-characters-in-a-string
3680-count-connected-components-in-lcm-graph

Bit Manipulation

0421-maximum-xor-of-two-numbers-in-an-array
1024-triples-with-bitwise-and-equal-to-zero
3563-select-cells-in-grid-with-maximum-score

Trie

0140-word-break-ii
0212-word-search-ii
0421-maximum-xor-of-two-numbers-in-an-array
2755-extra-characters-in-a-string

Backtracking

0126-word-ladder-ii
0140-word-break-ii
0212-word-search-ii

Breadth-First Search

0103-binary-tree-zigzag-level-order-traversal
0126-word-ladder-ii
0199-binary-tree-right-side-view
0322-coin-change
0407-trapping-rain-water-ii
0662-maximum-width-of-binary-tree
0794-swim-in-rising-water
0803-cheapest-flights-within-k-stops
0820-find-eventual-safe-states
0854-making-a-large-island
0960-minimize-malware-spread
1029-vertical-order-traversal-of-a-binary-tree
1447-jump-game-iv
2213-find-all-people-with-secret
3105-minimum-edge-reversals-so-every-node-is-reachable

Depth-First Search

0114-flatten-binary-tree-to-linked-list
0199-binary-tree-right-side-view
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0662-maximum-width-of-binary-tree
0794-swim-in-rising-water
0803-cheapest-flights-within-k-stops
0820-find-eventual-safe-states
0854-making-a-large-island
0960-minimize-malware-spread
1029-vertical-order-traversal-of-a-binary-tree
2213-find-all-people-with-secret
3105-minimum-edge-reversals-so-every-node-is-reachable

Graph

0803-cheapest-flights-within-k-stops
0820-find-eventual-safe-states
0960-minimize-malware-spread
1257-rank-transform-of-a-matrix
1325-path-with-maximum-probability
1701-remove-max-number-of-edges-to-keep-graph-fully-traversable
1986-largest-color-value-in-a-directed-graph
2176-parallel-courses-iii
2213-find-all-people-with-secret
2505-number-of-good-paths
3105-minimum-edge-reversals-so-every-node-is-reachable
3514-shortest-distance-after-road-addition-queries-ii

Topological Sort

0820-find-eventual-safe-states
1257-rank-transform-of-a-matrix
1986-largest-color-value-in-a-directed-graph
2176-parallel-courses-iii

Matrix

0036-valid-sudoku
0064-minimum-path-sum
0085-maximal-rectangle
0212-word-search-ii
0407-trapping-rain-water-ii
0794-swim-in-rising-water
0854-making-a-large-island
0967-minimum-falling-path-sum
1257-rank-transform-of-a-matrix
3563-select-cells-in-grid-with-maximum-score

Heap (Priority Queue)

0407-trapping-rain-water-ii
0794-swim-in-rising-water
0803-cheapest-flights-within-k-stops
1127-last-stone-weight
1325-path-with-maximum-probability

Shortest Path

0803-cheapest-flights-within-k-stops
1325-path-with-maximum-probability

Union Find

0128-longest-consecutive-sequence
0794-swim-in-rising-water
0854-making-a-large-island
0960-minimize-malware-spread
0989-largest-component-size-by-common-factor
1257-rank-transform-of-a-matrix
1701-remove-max-number-of-edges-to-keep-graph-fully-traversable
2213-find-all-people-with-secret
2505-number-of-good-paths
3680-count-connected-components-in-lcm-graph

Two Pointers

0011-container-with-most-water
0031-next-permutation
0167-two-sum-ii-input-array-is-sorted
0768-partition-labels

Binary Search

0153-find-minimum-in-rotated-sorted-array
0167-two-sum-ii-input-array-is-sorted
0794-swim-in-rising-water
1290-make-array-strictly-increasing

Greedy

0011-container-with-most-water
0402-remove-k-digits
0768-partition-labels
0876-hand-of-straights
0957-minimum-add-to-make-parentheses-valid
1095-two-city-scheduling
2026-merge-triplets-to-form-target-triplet
3514-shortest-distance-after-road-addition-queries-ii

Suffix Array

3482-construct-string-with-minimum-cost

Sorting

0876-hand-of-straights
1029-vertical-order-traversal-of-a-binary-tree
1095-two-city-scheduling
1257-rank-transform-of-a-matrix
1290-make-array-strictly-increasing
2213-find-all-people-with-secret
2505-number-of-good-paths

Ordered Set

3514-shortest-distance-after-road-addition-queries-ii

Linked List

0025-reverse-nodes-in-k-group
0114-flatten-binary-tree-to-linked-list
0146-lru-cache
0237-delete-node-in-a-linked-list

Stack

0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0114-flatten-binary-tree-to-linked-list
0402-remove-k-digits
0937-online-stock-span
0943-sum-of-subarray-minimums
0957-minimum-add-to-make-parentheses-valid

Tree

0103-binary-tree-zigzag-level-order-traversal
0114-flatten-binary-tree-to-linked-list
0199-binary-tree-right-side-view
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
0662-maximum-width-of-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
2505-number-of-good-paths

Binary Tree

0103-binary-tree-zigzag-level-order-traversal
0114-flatten-binary-tree-to-linked-list
0199-binary-tree-right-side-view
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
0662-maximum-width-of-binary-tree
1029-vertical-order-traversal-of-a-binary-tree

Design

0146-lru-cache
0937-online-stock-span

Monotonic Stack

0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0402-remove-k-digits
0937-online-stock-span
0943-sum-of-subarray-minimums

Data Stream

0937-online-stock-span

Binary Search Tree

0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst

String Matching

0214-shortest-palindrome
0686-repeated-string-match

Rolling Hash

0214-shortest-palindrome

Hash Function

0214-shortest-palindrome

Memoization

0140-word-break-ii
1986-largest-color-value-in-a-directed-graph

Math

0989-largest-component-size-by-common-factor
3536-find-the-count-of-monotonic-pairs-ii
3680-count-connected-components-in-lcm-graph

Combinatorics

3536-find-the-count-of-monotonic-pairs-ii

Prefix Sum

1042-minimum-cost-to-merge-stones
1393-maximum-value-of-k-coins-from-piles
3536-find-the-count-of-monotonic-pairs-ii

Number Theory

0989-largest-component-size-by-common-factor
3680-count-connected-components-in-lcm-graph

Bitmask

3563-select-cells-in-grid-with-maximum-score

Counting

1034-subarrays-with-k-different-integers
1986-largest-color-value-in-a-directed-graph

Doubly-Linked List

0146-lru-cache

Recursion

0025-reverse-nodes-in-k-group

Sliding Window

1034-subarrays-with-k-different-integers