leetcode-submissions

A collection of LeetCode questions to ace the coding interview! - Created using LeetHub v2

LeetCode Topics

Array

0001-two-sum
0014-longest-common-prefix
0015-3sum
0016-3sum-closest
0026-remove-duplicates-from-sorted-array
0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0056-merge-intervals
0074-search-a-2d-matrix
0081-search-in-rotated-sorted-array-ii
0088-merge-sorted-array
0108-convert-sorted-array-to-binary-search-tree
0118-pascals-triangle
0119-pascals-triangle-ii
0121-best-time-to-buy-and-sell-stock
0128-longest-consecutive-sequence
0217-contains-duplicate
0219-contains-duplicate-ii
0228-summary-ranges
0229-majority-element-ii
0347-top-k-frequent-elements
0454-4sum-ii
0485-max-consecutive-ones
0575-distribute-candies
0645-set-mismatch
0665-non-decreasing-array
0674-longest-continuous-increasing-subsequence
0792-binary-search
0816-design-hashset
0837-most-common-word
0879-maximize-distance-to-closest-person
0882-peak-index-in-a-mountain-array
1019-squares-of-a-sorted-array
1127-last-stone-weight
1426-find-n-unique-integers-sum-up-to-zero
1603-running-sum-of-1d-array
1791-richest-customer-wealth
2210-find-target-indices-after-sorting-array
2292-counting-words-with-a-given-prefix
2350-find-closest-number-to-zero
3194-find-words-containing-character
3309-count-prefix-and-suffix-pairs-i
3324-split-the-array

Hash Table

0001-two-sum
0012-integer-to-roman
0013-roman-to-integer
0017-letter-combinations-of-a-phone-number
0128-longest-consecutive-sequence
0141-linked-list-cycle
0142-linked-list-cycle-ii
0160-intersection-of-two-linked-lists
0202-happy-number
0217-contains-duplicate
0219-contains-duplicate-ii
0229-majority-element-ii
0347-top-k-frequent-elements
0383-ransom-note
0454-4sum-ii
0575-distribute-candies
0645-set-mismatch
0816-design-hashset
0837-most-common-word
2059-unique-length-3-palindromic-subsequences
2487-optimal-partition-of-string
3324-split-the-array
3353-existence-of-a-substring-in-a-string-and-its-reverse

Two Pointers

0015-3sum
0016-3sum-closest
0019-remove-nth-node-from-end-of-list
0026-remove-duplicates-from-sorted-array
0088-merge-sorted-array
0125-valid-palindrome
0141-linked-list-cycle
0142-linked-list-cycle-ii
0143-reorder-list
0160-intersection-of-two-linked-lists
0202-happy-number
0234-palindrome-linked-list
0345-reverse-vowels-of-a-string
0392-is-subsequence
0908-middle-of-the-linked-list
1019-squares-of-a-sorted-array
1894-merge-strings-alternately

String

0012-integer-to-roman
0013-roman-to-integer
0014-longest-common-prefix
0017-letter-combinations-of-a-phone-number
0020-valid-parentheses
0022-generate-parentheses
0043-multiply-strings
0125-valid-palindrome
0171-excel-sheet-column-number
0257-binary-tree-paths
0345-reverse-vowels-of-a-string
0383-ransom-note
0392-is-subsequence
0412-fizz-buzz
0482-license-key-formatting
0521-longest-uncommon-subsequence-i
0837-most-common-word
1146-greatest-common-divisor-of-strings
1537-maximum-score-after-splitting-a-string
1894-merge-strings-alternately
2059-unique-length-3-palindromic-subsequences
2292-counting-words-with-a-given-prefix
2487-optimal-partition-of-string
3194-find-words-containing-character
3309-count-prefix-and-suffix-pairs-i
3353-existence-of-a-substring-in-a-string-and-its-reverse

Math

0002-add-two-numbers
0009-palindrome-number
0012-integer-to-roman
0013-roman-to-integer
0043-multiply-strings
0171-excel-sheet-column-number
0172-factorial-trailing-zeroes
0202-happy-number
0231-power-of-two
0258-add-digits
0263-ugly-number
0367-valid-perfect-square
0412-fizz-buzz
0507-perfect-number
1013-fibonacci-number
1146-greatest-common-divisor-of-strings
1426-find-n-unique-integers-sum-up-to-zero
1585-the-kth-factor-of-n
2050-count-good-numbers
3371-harshad-number

Trie

0014-longest-common-prefix
3309-count-prefix-and-suffix-pairs-i

Sorting

0015-3sum
0016-3sum-closest
0056-merge-intervals
0088-merge-sorted-array
0217-contains-duplicate
0229-majority-element-ii
0347-top-k-frequent-elements
0645-set-mismatch
1019-squares-of-a-sorted-array
2210-find-target-indices-after-sorting-array

Divide and Conquer

0108-convert-sorted-array-to-binary-search-tree
0347-top-k-frequent-elements

Heap (Priority Queue)

0347-top-k-frequent-elements
1127-last-stone-weight

Bucket Sort

0347-top-k-frequent-elements

Counting

0229-majority-element-ii
0347-top-k-frequent-elements
0383-ransom-note
0837-most-common-word
3324-split-the-array

Quickselect

0347-top-k-frequent-elements

Database

0175-combine-two-tables

Number Theory

0258-add-digits
1585-the-kth-factor-of-n

Greedy

2487-optimal-partition-of-string

Linked List

0002-add-two-numbers
0019-remove-nth-node-from-end-of-list
0141-linked-list-cycle
0142-linked-list-cycle-ii
0143-reorder-list
0160-intersection-of-two-linked-lists
0206-reverse-linked-list
0234-palindrome-linked-list
0816-design-hashset
0908-middle-of-the-linked-list

Recursion

0002-add-two-numbers
0143-reorder-list
0206-reverse-linked-list
0231-power-of-two
0234-palindrome-linked-list
1013-fibonacci-number
2050-count-good-numbers

Dynamic Programming

0022-generate-parentheses
0118-pascals-triangle
0119-pascals-triangle-ii
0121-best-time-to-buy-and-sell-stock
0392-is-subsequence
1013-fibonacci-number
2408-number-of-people-aware-of-a-secret

Stack

0020-valid-parentheses
0094-binary-tree-inorder-traversal
0143-reorder-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0234-palindrome-linked-list
0775-n-ary-tree-preorder-traversal
0776-n-ary-tree-postorder-traversal
0933-increasing-order-search-tree

Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0108-convert-sorted-array-to-binary-search-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0222-count-complete-tree-nodes
0226-invert-binary-tree
0257-binary-tree-paths
0404-sum-of-left-leaves
0501-find-mode-in-binary-search-tree
0530-minimum-absolute-difference-in-bst
0764-n-ary-tree-level-order-traversal
0775-n-ary-tree-preorder-traversal
0776-n-ary-tree-postorder-traversal
0799-minimum-distance-between-bst-nodes
0904-leaf-similar-trees
0933-increasing-order-search-tree
0975-range-sum-of-bst
1005-univalued-binary-tree
2568-minimum-fuel-cost-to-report-to-the-capital

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
0111-minimum-depth-of-binary-tree
0112-path-sum
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0226-invert-binary-tree
0257-binary-tree-paths
0404-sum-of-left-leaves
0501-find-mode-in-binary-search-tree
0530-minimum-absolute-difference-in-bst
0775-n-ary-tree-preorder-traversal
0776-n-ary-tree-postorder-traversal
0799-minimum-distance-between-bst-nodes
0904-leaf-similar-trees
0933-increasing-order-search-tree
0975-range-sum-of-bst
1005-univalued-binary-tree
2568-minimum-fuel-cost-to-report-to-the-capital

Binary Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0108-convert-sorted-array-to-binary-search-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0222-count-complete-tree-nodes
0226-invert-binary-tree
0257-binary-tree-paths
0404-sum-of-left-leaves
0501-find-mode-in-binary-search-tree
0530-minimum-absolute-difference-in-bst
0799-minimum-distance-between-bst-nodes
0904-leaf-similar-trees
0933-increasing-order-search-tree
0975-range-sum-of-bst
1005-univalued-binary-tree

Breadth-First Search

0100-same-tree
0101-symmetric-tree
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0226-invert-binary-tree
0404-sum-of-left-leaves
0530-minimum-absolute-difference-in-bst
0764-n-ary-tree-level-order-traversal
0799-minimum-distance-between-bst-nodes
1005-univalued-binary-tree
2568-minimum-fuel-cost-to-report-to-the-capital

Rolling Hash

3309-count-prefix-and-suffix-pairs-i

String Matching

2292-counting-words-with-a-given-prefix
3309-count-prefix-and-suffix-pairs-i

Hash Function

0816-design-hashset
3309-count-prefix-and-suffix-pairs-i

Bit Manipulation

0222-count-complete-tree-nodes
0231-power-of-two
0476-number-complement
0645-set-mismatch
2059-unique-length-3-palindromic-subsequences

Prefix Sum

1537-maximum-score-after-splitting-a-string
1603-running-sum-of-1d-array
2059-unique-length-3-palindromic-subsequences

Union Find

0128-longest-consecutive-sequence

Design

0816-design-hashset

Sliding Window

0219-contains-duplicate-ii

Binary Search

0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0074-search-a-2d-matrix
0081-search-in-rotated-sorted-array-ii
0222-count-complete-tree-nodes
0278-first-bad-version
0367-valid-perfect-square
0792-binary-search
0882-peak-index-in-a-mountain-array
2210-find-target-indices-after-sorting-array

Backtracking

0017-letter-combinations-of-a-phone-number
0022-generate-parentheses
0257-binary-tree-paths

Simulation

0043-multiply-strings
0258-add-digits
0412-fizz-buzz
2408-number-of-people-aware-of-a-secret

Memoization

1013-fibonacci-number

Graph

2568-minimum-fuel-cost-to-report-to-the-capital

Binary Search Tree

0098-validate-binary-search-tree
0108-convert-sorted-array-to-binary-search-tree
0501-find-mode-in-binary-search-tree
0530-minimum-absolute-difference-in-bst
0799-minimum-distance-between-bst-nodes
0933-increasing-order-search-tree
0975-range-sum-of-bst

Matrix

0074-search-a-2d-matrix
1791-richest-customer-wealth

Interactive

0278-first-bad-version

Queue

2408-number-of-people-aware-of-a-secret