Competitive-Programming

LeetCode Topics

Array

0033-search-in-rotated-sorted-array
0049-group-anagrams
0078-subsets
0081-search-in-rotated-sorted-array-ii
0128-longest-consecutive-sequence
0150-evaluate-reverse-polish-notation
0167-two-sum-ii-input-array-is-sorted
0215-kth-largest-element-in-an-array
0217-contains-duplicate
0219-contains-duplicate-ii
0347-top-k-frequent-elements
0506-relative-ranks
0658-find-k-closest-elements
0692-top-k-frequent-words
0792-binary-search
1014-k-closest-points-to-origin
1127-last-stone-weight
1353-find-resultant-array-after-removing-anagrams
1556-make-two-arrays-equal-by-reversing-subarrays
1574-maximum-product-of-two-elements-in-an-array
1781-check-if-two-string-arrays-are-equivalent
2058-concatenation-of-array
2094-remove-stones-to-minimize-the-total
2113-find-the-kth-largest-integer-in-the-array
2116-count-number-of-pairs-with-absolute-difference-k
2310-minimum-operations-to-halve-array-sum
2329-maximum-product-after-k-increments
2350-find-closest-number-to-zero
2436-make-array-zero-by-subtracting-equal-amounts
2616-maximal-score-after-applying-k-operations
2692-take-gifts-from-the-richest-pile
2977-check-if-a-string-is-an-acronym-of-words
3226-minimum-number-game
3332-minimum-operations-to-exceed-threshold-value-ii
3495-k-th-nearest-obstacle-queries
3555-final-array-state-after-k-multiplication-operations-i

Hash Table

0013-roman-to-integer
0049-group-anagrams
0128-longest-consecutive-sequence
0217-contains-duplicate
0219-contains-duplicate-ii
0242-valid-anagram
0347-top-k-frequent-elements
0451-sort-characters-by-frequency
0653-two-sum-iv-input-is-a-bst
0692-top-k-frequent-words
1353-find-resultant-array-after-removing-anagrams
1469-minimum-number-of-steps-to-make-two-strings-anagram
1556-make-two-arrays-equal-by-reversing-subarrays
2053-check-if-all-characters-have-equal-number-of-occurrences
2116-count-number-of-pairs-with-absolute-difference-k
2293-minimum-number-of-steps-to-make-two-strings-anagram-ii
2436-make-array-zero-by-subtracting-equal-amounts

String

0013-roman-to-integer
0049-group-anagrams
0242-valid-anagram
0412-fizz-buzz
0451-sort-characters-by-frequency
0692-top-k-frequent-words
1353-find-resultant-array-after-removing-anagrams
1469-minimum-number-of-steps-to-make-two-strings-anagram
1781-check-if-two-string-arrays-are-equivalent
2053-check-if-all-characters-have-equal-number-of-occurrences
2113-find-the-kth-largest-integer-in-the-array
2293-minimum-number-of-steps-to-make-two-strings-anagram-ii
2977-check-if-a-string-is-an-acronym-of-words

Sorting

0049-group-anagrams
0215-kth-largest-element-in-an-array
0217-contains-duplicate
0242-valid-anagram
0295-find-median-from-data-stream
0347-top-k-frequent-elements
0451-sort-characters-by-frequency
0506-relative-ranks
0658-find-k-closest-elements
0692-top-k-frequent-words
1014-k-closest-points-to-origin
1353-find-resultant-array-after-removing-anagrams
1556-make-two-arrays-equal-by-reversing-subarrays
1574-maximum-product-of-two-elements-in-an-array
2113-find-the-kth-largest-integer-in-the-array
2436-make-array-zero-by-subtracting-equal-amounts
2646-kth-largest-sum-in-a-binary-tree
3226-minimum-number-game

Counting

0347-top-k-frequent-elements
0451-sort-characters-by-frequency
0692-top-k-frequent-words
1469-minimum-number-of-steps-to-make-two-strings-anagram
2053-check-if-all-characters-have-equal-number-of-occurrences
2116-count-number-of-pairs-with-absolute-difference-k
2293-minimum-number-of-steps-to-make-two-strings-anagram-ii

Simulation

0412-fizz-buzz
2058-concatenation-of-array
2288-count-operations-to-obtain-zero
2436-make-array-zero-by-subtracting-equal-amounts
2692-take-gifts-from-the-richest-pile
3226-minimum-number-game
3332-minimum-operations-to-exceed-threshold-value-ii
3555-final-array-state-after-k-multiplication-operations-i

Math

0013-roman-to-integer
0150-evaluate-reverse-polish-notation
0231-power-of-two
0326-power-of-three
0342-power-of-four
0412-fizz-buzz
1013-fibonacci-number
1014-k-closest-points-to-origin
1444-number-of-steps-to-reduce-a-number-to-zero
2288-count-operations-to-obtain-zero
3555-final-array-state-after-k-multiplication-operations-i

Sliding Window

0219-contains-duplicate-ii
0658-find-k-closest-elements

Greedy

2094-remove-stones-to-minimize-the-total
2310-minimum-operations-to-halve-array-sum
2329-maximum-product-after-k-increments
2436-make-array-zero-by-subtracting-equal-amounts
2616-maximal-score-after-applying-k-operations

Heap (Priority Queue)

0215-kth-largest-element-in-an-array
0295-find-median-from-data-stream
0347-top-k-frequent-elements
0451-sort-characters-by-frequency
0506-relative-ranks
0658-find-k-closest-elements
0692-top-k-frequent-words
0789-kth-largest-element-in-a-stream
1014-k-closest-points-to-origin
1127-last-stone-weight
1574-maximum-product-of-two-elements-in-an-array
2094-remove-stones-to-minimize-the-total
2113-find-the-kth-largest-integer-in-the-array
2310-minimum-operations-to-halve-array-sum
2329-maximum-product-after-k-increments
2436-make-array-zero-by-subtracting-equal-amounts
2616-maximal-score-after-applying-k-operations
2692-take-gifts-from-the-richest-pile
3226-minimum-number-game
3332-minimum-operations-to-exceed-threshold-value-ii
3495-k-th-nearest-obstacle-queries
3555-final-array-state-after-k-multiplication-operations-i

Union Find

0128-longest-consecutive-sequence
2121-find-if-path-exists-in-graph

Divide and Conquer

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

Quickselect

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

Bucket Sort

0347-top-k-frequent-elements
0451-sort-characters-by-frequency
0692-top-k-frequent-words

Tree

0094-binary-tree-inorder-traversal
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
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
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0226-invert-binary-tree
0515-find-largest-value-in-each-tree-row
0543-diameter-of-binary-tree
0637-average-of-levels-in-binary-tree
0653-two-sum-iv-input-is-a-bst
0764-n-ary-tree-level-order-traversal
0774-maximum-depth-of-n-ary-tree
0783-search-in-a-binary-search-tree
0789-kth-largest-element-in-a-stream
1035-cousins-in-binary-tree
1116-maximum-level-sum-of-a-binary-tree
1254-deepest-leaves-sum
1731-even-odd-tree
2646-kth-largest-sum-in-a-binary-tree

Design

0295-find-median-from-data-stream
0789-kth-largest-element-in-a-stream

Binary Search Tree

0033-search-in-rotated-sorted-array
0081-search-in-rotated-sorted-array-ii
0167-two-sum-ii-input-array-is-sorted
0653-two-sum-iv-input-is-a-bst
0658-find-k-closest-elements
0783-search-in-a-binary-search-tree
0789-kth-largest-element-in-a-stream
0792-binary-search

Binary Tree

0094-binary-tree-inorder-traversal
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
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
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0226-invert-binary-tree
0515-find-largest-value-in-each-tree-row
0543-diameter-of-binary-tree
0637-average-of-levels-in-binary-tree
0653-two-sum-iv-input-is-a-bst
0783-search-in-a-binary-search-tree
0789-kth-largest-element-in-a-stream
1035-cousins-in-binary-tree
1116-maximum-level-sum-of-a-binary-tree
1254-deepest-leaves-sum
1731-even-odd-tree
2646-kth-largest-sum-in-a-binary-tree

Data Stream

0295-find-median-from-data-stream
0789-kth-largest-element-in-a-stream

Two Pointers

0167-two-sum-ii-input-array-is-sorted
0295-find-median-from-data-stream
0653-two-sum-iv-input-is-a-bst
0658-find-k-closest-elements

Trie

0692-top-k-frequent-words

Geometry

1014-k-closest-points-to-origin

Dynamic Programming

1013-fibonacci-number

Recursion

0231-power-of-two
0326-power-of-three
0342-power-of-four
1013-fibonacci-number

Memoization

1013-fibonacci-number

Bit Manipulation

0078-subsets
0231-power-of-two
0342-power-of-four
1444-number-of-steps-to-reduce-a-number-to-zero

Depth-First Search

0094-binary-tree-inorder-traversal
0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
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
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0226-invert-binary-tree
0515-find-largest-value-in-each-tree-row
0543-diameter-of-binary-tree
0637-average-of-levels-in-binary-tree
0653-two-sum-iv-input-is-a-bst
0774-maximum-depth-of-n-ary-tree
1035-cousins-in-binary-tree
1116-maximum-level-sum-of-a-binary-tree
1254-deepest-leaves-sum
2121-find-if-path-exists-in-graph

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
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
0199-binary-tree-right-side-view
0226-invert-binary-tree
0515-find-largest-value-in-each-tree-row
0637-average-of-levels-in-binary-tree
0653-two-sum-iv-input-is-a-bst
0764-n-ary-tree-level-order-traversal
0774-maximum-depth-of-n-ary-tree
1035-cousins-in-binary-tree
1116-maximum-level-sum-of-a-binary-tree
1254-deepest-leaves-sum
1731-even-odd-tree
2121-find-if-path-exists-in-graph
2646-kth-largest-sum-in-a-binary-tree

Linked List

0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii

Stack

0094-binary-tree-inorder-traversal
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0150-evaluate-reverse-polish-notation

Backtracking

0078-subsets

Graph

2121-find-if-path-exists-in-graph