LeetCode

Consists Of LeetCode and Geeks For Geeks Solved Problems Solutions

LeetCode Topics

Array

0001-two-sum
0004-median-of-two-sorted-arrays
0011-container-with-most-water
0015-3sum
0026-remove-duplicates-from-sorted-array
0033-search-in-rotated-sorted-array
0037-sudoku-solver
0040-combination-sum-ii
0042-trapping-rain-water
0046-permutations
0047-permutations-ii
0048-rotate-image
0049-group-anagrams
0051-n-queens
0055-jump-game
0064-minimum-path-sum
0073-set-matrix-zeroes
0075-sort-colors
0078-subsets
0079-word-search
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0088-merge-sorted-array
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0130-surrounded-regions
0139-word-break
0140-word-break-ii
0150-evaluate-reverse-polish-notation
0152-maximum-product-subarray
0169-majority-element
0188-best-time-to-buy-and-sell-stock-iv
0200-number-of-islands
0212-word-search-ii
0215-kth-largest-element-in-an-array
0221-maximal-square
0260-single-number-iii
0283-move-zeroes
0287-find-the-duplicate-number
0289-game-of-life
0300-longest-increasing-subsequence
0303-range-sum-query-immutable
0304-range-sum-query-2d-immutable
0307-range-sum-query-mutable
0309-best-time-to-buy-and-sell-stock-with-cooldown
0322-coin-change
0329-longest-increasing-path-in-a-matrix
0347-top-k-frequent-elements
0403-frog-jump
0416-partition-equal-subset-sum
0421-maximum-xor-of-two-numbers-in-an-array
0435-non-overlapping-intervals
0442-find-all-duplicates-in-an-array
0462-minimum-moves-to-equal-array-elements-ii
0474-ones-and-zeroes
0493-reverse-pairs
0494-target-sum
0518-coin-change-ii
0526-beautiful-arrangement
0560-subarray-sum-equals-k
0621-task-scheduler
0628-maximum-product-of-three-numbers
0714-best-time-to-buy-and-sell-stock-with-transaction-fee
0718-maximum-length-of-repeated-subarray
0733-flood-fill
0739-daily-temperatures
0740-delete-and-earn
0854-making-a-large-island
0943-sum-of-subarray-minimums
0971-shortest-bridge
1014-k-closest-points-to-origin
1016-subarray-sums-divisible-by-k
1022-unique-paths-iii
1050-construct-binary-search-tree-from-preorder-traversal
1117-as-far-from-land-as-possible
1402-count-square-submatrices-with-all-ones
1538-maximum-points-you-can-obtain-from-cards
1700-minimum-time-to-make-rope-colorful
1762-furthest-building-you-can-reach
1792-find-the-most-competitive-subsequence
1826-maximum-xor-with-an-element-from-array
1866-restore-the-array-from-adjacent-pairs
2306-create-binary-tree-from-descriptions
2551-apply-operations-to-an-array

Binary Search

0004-median-of-two-sorted-arrays
0033-search-in-rotated-sorted-array
0222-count-complete-tree-nodes
0287-find-the-duplicate-number
0300-longest-increasing-subsequence
0493-reverse-pairs
0718-maximum-length-of-repeated-subarray

Divide and Conquer

0004-median-of-two-sorted-arrays
0023-merge-k-sorted-lists
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0148-sort-list
0169-majority-element
0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements
0493-reverse-pairs
1014-k-closest-points-to-origin

Two Pointers

0005-longest-palindromic-substring
0011-container-with-most-water
0015-3sum
0019-remove-nth-node-from-end-of-list
0026-remove-duplicates-from-sorted-array
0042-trapping-rain-water
0061-rotate-list
0075-sort-colors
0082-remove-duplicates-from-sorted-list-ii
0086-partition-list
0088-merge-sorted-array
0141-linked-list-cycle
0142-linked-list-cycle-ii
0143-reorder-list
0148-sort-list
0151-reverse-words-in-a-string
0160-intersection-of-two-linked-lists
0234-palindrome-linked-list
0283-move-zeroes
0287-find-the-duplicate-number
0680-valid-palindrome-ii
0874-backspace-string-compare
0908-middle-of-the-linked-list
2551-apply-operations-to-an-array

Sorting

0015-3sum
0049-group-anagrams
0075-sort-colors
0088-merge-sorted-array
0148-sort-list
0169-majority-element
0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements
0435-non-overlapping-intervals
0462-minimum-moves-to-equal-array-elements-ii
0621-task-scheduler
0628-maximum-product-of-three-numbers
0778-reorganize-string
1014-k-closest-points-to-origin
1029-vertical-order-traversal-of-a-binary-tree
1770-minimum-deletions-to-make-character-frequencies-unique

String

0005-longest-palindromic-substring
0014-longest-common-prefix
0020-valid-parentheses
0044-wildcard-matching
0049-group-anagrams
0067-add-binary
0079-word-search
0091-decode-ways
0127-word-ladder
0131-palindrome-partitioning
0139-word-break
0140-word-break-ii
0151-reverse-words-in-a-string
0208-implement-trie-prefix-tree
0211-design-add-and-search-words-data-structure
0212-word-search-ii
0257-binary-tree-paths
0424-longest-repeating-character-replacement
0474-ones-and-zeroes
0583-delete-operation-for-two-strings
0680-valid-palindrome-ii
0778-reorganize-string
0874-backspace-string-compare
1170-shortest-common-supersequence
1320-remove-all-adjacent-duplicates-in-string-ii
1437-minimum-insertion-steps-to-make-a-string-palindrome
1460-number-of-substrings-containing-all-three-characters
1700-minimum-time-to-make-rope-colorful
1770-minimum-deletions-to-make-character-frequencies-unique

Dynamic Programming

0005-longest-palindromic-substring
0042-trapping-rain-water
0044-wildcard-matching
0055-jump-game
0062-unique-paths
0064-minimum-path-sum
0070-climbing-stairs
0085-maximal-rectangle
0091-decode-ways
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0124-binary-tree-maximum-path-sum
0131-palindrome-partitioning
0139-word-break
0140-word-break-ii
0152-maximum-product-subarray
0188-best-time-to-buy-and-sell-stock-iv
0221-maximal-square
0300-longest-increasing-subsequence
0309-best-time-to-buy-and-sell-stock-with-cooldown
0322-coin-change
0329-longest-increasing-path-in-a-matrix
0338-counting-bits
0403-frog-jump
0416-partition-equal-subset-sum
0435-non-overlapping-intervals
0474-ones-and-zeroes
0494-target-sum
0518-coin-change-ii
0526-beautiful-arrangement
0583-delete-operation-for-two-strings
0714-best-time-to-buy-and-sell-stock-with-transaction-fee
0718-maximum-length-of-repeated-subarray
0740-delete-and-earn
0803-cheapest-flights-within-k-stops
0943-sum-of-subarray-minimums
0972-knight-dialer
1117-as-far-from-land-as-possible
1170-shortest-common-supersequence
1402-count-square-submatrices-with-all-ones
1437-minimum-insertion-steps-to-make-a-string-palindrome
1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1700-minimum-time-to-make-rope-colorful
2090-number-of-ways-to-arrive-at-destination

Hash Table

0001-two-sum
0037-sudoku-solver
0049-group-anagrams
0073-set-matrix-zeroes
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0127-word-ladder
0138-copy-list-with-random-pointer
0139-word-break
0140-word-break-ii
0141-linked-list-cycle
0142-linked-list-cycle-ii
0146-lru-cache
0160-intersection-of-two-linked-lists
0169-majority-element
0208-implement-trie-prefix-tree
0347-top-k-frequent-elements
0421-maximum-xor-of-two-numbers-in-an-array
0424-longest-repeating-character-replacement
0442-find-all-duplicates-in-an-array
0560-subarray-sum-equals-k
0621-task-scheduler
0740-delete-and-earn
0778-reorganize-string
0893-all-nodes-distance-k-in-binary-tree
0984-most-stones-removed-with-same-row-or-column
1016-subarray-sums-divisible-by-k
1029-vertical-order-traversal-of-a-binary-tree
1460-number-of-substrings-containing-all-three-characters
1770-minimum-deletions-to-make-character-frequencies-unique
1866-restore-the-array-from-adjacent-pairs
2306-create-binary-tree-from-descriptions

Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-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
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0110-balanced-binary-tree
0112-path-sum
0116-populating-next-right-pointers-in-each-node
0124-binary-tree-maximum-path-sum
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0173-binary-search-tree-iterator
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0404-sum-of-left-leaves
0530-minimum-absolute-difference-in-bst
0543-diameter-of-binary-tree
0572-subtree-of-another-tree
0617-merge-two-binary-trees
0662-maximum-width-of-binary-tree
0893-all-nodes-distance-k-in-binary-tree
0975-range-sum-of-bst
1029-vertical-order-traversal-of-a-binary-tree
1050-construct-binary-search-tree-from-preorder-traversal
1492-time-needed-to-inform-all-employees
2306-create-binary-tree-from-descriptions

Binary Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-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
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0110-balanced-binary-tree
0112-path-sum
0116-populating-next-right-pointers-in-each-node
0124-binary-tree-maximum-path-sum
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0173-binary-search-tree-iterator
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0404-sum-of-left-leaves
0530-minimum-absolute-difference-in-bst
0543-diameter-of-binary-tree
0572-subtree-of-another-tree
0617-merge-two-binary-trees
0662-maximum-width-of-binary-tree
0893-all-nodes-distance-k-in-binary-tree
0975-range-sum-of-bst
1029-vertical-order-traversal-of-a-binary-tree
1050-construct-binary-search-tree-from-preorder-traversal
2306-create-binary-tree-from-descriptions

Depth-First Search

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0112-path-sum
0116-populating-next-right-pointers-in-each-node
0124-binary-tree-maximum-path-sum
0130-surrounded-regions
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0200-number-of-islands
0211-design-add-and-search-words-data-structure
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0329-longest-increasing-path-in-a-matrix
0404-sum-of-left-leaves
0530-minimum-absolute-difference-in-bst
0543-diameter-of-binary-tree
0572-subtree-of-another-tree
0617-merge-two-binary-trees
0662-maximum-width-of-binary-tree
0684-redundant-connection
0733-flood-fill
0744-network-delay-time
0803-cheapest-flights-within-k-stops
0820-find-eventual-safe-states
0854-making-a-large-island
0893-all-nodes-distance-k-in-binary-tree
0971-shortest-bridge
0975-range-sum-of-bst
0984-most-stones-removed-with-same-row-or-column
1029-vertical-order-traversal-of-a-binary-tree
1442-number-of-operations-to-make-network-connected
1492-time-needed-to-inform-all-employees

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
0112-path-sum
0116-populating-next-right-pointers-in-each-node
0127-word-ladder
0130-surrounded-regions
0199-binary-tree-right-side-view
0200-number-of-islands
0226-invert-binary-tree
0322-coin-change
0329-longest-increasing-path-in-a-matrix
0404-sum-of-left-leaves
0530-minimum-absolute-difference-in-bst
0617-merge-two-binary-trees
0662-maximum-width-of-binary-tree
0684-redundant-connection
0733-flood-fill
0744-network-delay-time
0803-cheapest-flights-within-k-stops
0820-find-eventual-safe-states
0854-making-a-large-island
0893-all-nodes-distance-k-in-binary-tree
0971-shortest-bridge
1029-vertical-order-traversal-of-a-binary-tree
1117-as-far-from-land-as-possible
1442-number-of-operations-to-make-network-connected
1492-time-needed-to-inform-all-employees

Binary Search Tree

0098-validate-binary-search-tree
0108-convert-sorted-array-to-binary-search-tree
0173-binary-search-tree-iterator
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0530-minimum-absolute-difference-in-bst
0975-range-sum-of-bst
1050-construct-binary-search-tree-from-preorder-traversal

String Matching

0572-subtree-of-another-tree

Hash Function

0572-subtree-of-another-tree
0718-maximum-length-of-repeated-subarray

Backtracking

0037-sudoku-solver
0040-combination-sum-ii
0046-permutations
0047-permutations-ii
0051-n-queens
0077-combinations
0078-subsets
0079-word-search
0131-palindrome-partitioning
0140-word-break-ii
0212-word-search-ii
0257-binary-tree-paths
0494-target-sum
0526-beautiful-arrangement
1022-unique-paths-iii

Stack

0020-valid-parentheses
0042-trapping-rain-water
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0094-binary-tree-inorder-traversal
0143-reorder-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0150-evaluate-reverse-polish-notation
0173-binary-search-tree-iterator
0234-palindrome-linked-list
0445-add-two-numbers-ii
0739-daily-temperatures
0874-backspace-string-compare
0943-sum-of-subarray-minimums
1050-construct-binary-search-tree-from-preorder-traversal
1320-remove-all-adjacent-duplicates-in-string-ii
1792-find-the-most-competitive-subsequence

Math

0002-add-two-numbers
0048-rotate-image
0062-unique-paths
0067-add-binary
0070-climbing-stairs
0150-evaluate-reverse-polish-notation
0445-add-two-numbers-ii
0462-minimum-moves-to-equal-array-elements-ii
0628-maximum-product-of-three-numbers
1014-k-closest-points-to-origin
1411-convert-binary-number-in-a-linked-list-to-integer

Memoization

0070-climbing-stairs
0139-word-break
0140-word-break-ii
0329-longest-increasing-path-in-a-matrix

Combinatorics

0062-unique-paths

Matrix

0037-sudoku-solver
0048-rotate-image
0064-minimum-path-sum
0073-set-matrix-zeroes
0079-word-search
0085-maximal-rectangle
0130-surrounded-regions
0200-number-of-islands
0212-word-search-ii
0221-maximal-square
0289-game-of-life
0304-range-sum-query-2d-immutable
0329-longest-increasing-path-in-a-matrix
0733-flood-fill
0854-making-a-large-island
0971-shortest-bridge
1022-unique-paths-iii
1117-as-far-from-land-as-possible
1402-count-square-submatrices-with-all-ones

Sliding Window

0424-longest-repeating-character-replacement
0718-maximum-length-of-repeated-subarray
1460-number-of-substrings-containing-all-three-characters
1538-maximum-points-you-can-obtain-from-cards

Rolling Hash

0718-maximum-length-of-repeated-subarray

Monotonic Stack

0042-trapping-rain-water
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0739-daily-temperatures
0943-sum-of-subarray-minimums
1050-construct-binary-search-tree-from-preorder-traversal
1792-find-the-most-competitive-subsequence

Design

0146-lru-cache
0173-binary-search-tree-iterator
0208-implement-trie-prefix-tree
0211-design-add-and-search-words-data-structure
0303-range-sum-query-immutable
0304-range-sum-query-2d-immutable
0307-range-sum-query-mutable

Prefix Sum

0303-range-sum-query-immutable
0304-range-sum-query-2d-immutable
0560-subarray-sum-equals-k
1016-subarray-sums-divisible-by-k
1538-maximum-points-you-can-obtain-from-cards

Simulation

0067-add-binary
0289-game-of-life
0874-backspace-string-compare
2551-apply-operations-to-an-array

Binary Indexed Tree

0307-range-sum-query-mutable
0493-reverse-pairs

Segment Tree

0307-range-sum-query-mutable
0493-reverse-pairs

Merge Sort

0023-merge-k-sorted-lists
0148-sort-list
0493-reverse-pairs

Ordered Set

0493-reverse-pairs

Greedy

0011-container-with-most-water
0044-wildcard-matching
0055-jump-game
0122-best-time-to-buy-and-sell-stock-ii
0435-non-overlapping-intervals
0621-task-scheduler
0680-valid-palindrome-ii
0714-best-time-to-buy-and-sell-stock-with-transaction-fee
0778-reorganize-string
1700-minimum-time-to-make-rope-colorful
1762-furthest-building-you-can-reach
1770-minimum-deletions-to-make-character-frequencies-unique
1792-find-the-most-competitive-subsequence

Union Find

0130-surrounded-regions
0200-number-of-islands
0684-redundant-connection
0854-making-a-large-island
0984-most-stones-removed-with-same-row-or-column
1442-number-of-operations-to-make-network-connected

Graph

0329-longest-increasing-path-in-a-matrix
0684-redundant-connection
0744-network-delay-time
0803-cheapest-flights-within-k-stops
0820-find-eventual-safe-states
0984-most-stones-removed-with-same-row-or-column
1442-number-of-operations-to-make-network-connected
1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
2090-number-of-ways-to-arrive-at-destination

Linked List

0002-add-two-numbers
0019-remove-nth-node-from-end-of-list
0021-merge-two-sorted-lists
0023-merge-k-sorted-lists
0061-rotate-list
0082-remove-duplicates-from-sorted-list-ii
0083-remove-duplicates-from-sorted-list
0086-partition-list
0092-reverse-linked-list-ii
0116-populating-next-right-pointers-in-each-node
0138-copy-list-with-random-pointer
0141-linked-list-cycle
0142-linked-list-cycle-ii
0143-reorder-list
0146-lru-cache
0148-sort-list
0160-intersection-of-two-linked-lists
0203-remove-linked-list-elements
0206-reverse-linked-list
0234-palindrome-linked-list
0445-add-two-numbers-ii
0908-middle-of-the-linked-list
1411-convert-binary-number-in-a-linked-list-to-integer

Recursion

0002-add-two-numbers
0021-merge-two-sorted-lists
0044-wildcard-matching
0143-reorder-list
0203-remove-linked-list-elements
0206-reverse-linked-list
0234-palindrome-linked-list

Heap (Priority Queue)

0023-merge-k-sorted-lists
0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements
0621-task-scheduler
0744-network-delay-time
0778-reorganize-string
0803-cheapest-flights-within-k-stops
1014-k-closest-points-to-origin
1762-furthest-building-you-can-reach

Topological Sort

0329-longest-increasing-path-in-a-matrix
0820-find-eventual-safe-states
2090-number-of-ways-to-arrive-at-destination

Shortest Path

0744-network-delay-time
0803-cheapest-flights-within-k-stops
1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
2090-number-of-ways-to-arrive-at-destination

Bit Manipulation

0067-add-binary
0078-subsets
0222-count-complete-tree-nodes
0260-single-number-iii
0287-find-the-duplicate-number
0338-counting-bits
0421-maximum-xor-of-two-numbers-in-an-array
0526-beautiful-arrangement
1022-unique-paths-iii
1826-maximum-xor-with-an-element-from-array

Bucket Sort

0347-top-k-frequent-elements

Counting

0169-majority-element
0347-top-k-frequent-elements
0621-task-scheduler
0778-reorganize-string

Quickselect

0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements
1014-k-closest-points-to-origin

Bitmask

0526-beautiful-arrangement

Iterator

0173-binary-search-tree-iterator

Geometry

1014-k-closest-points-to-origin

Doubly-Linked List

0146-lru-cache

Trie

0014-longest-common-prefix
0139-word-break
0140-word-break-ii
0208-implement-trie-prefix-tree
0211-design-add-and-search-words-data-structure
0212-word-search-ii
0421-maximum-xor-of-two-numbers-in-an-array
1826-maximum-xor-with-an-element-from-array

Database

0584-find-customer-referee
0595-big-countries
1258-article-views-i
1338-queries-quality-and-percentage
1390-average-selling-price
1415-students-and-examinations
1773-percentage-of-users-attended-a-contest
1908-recyclable-and-low-fat-products
2087-confirmation-rate