LeetCode

This repository, which was created using LeetHub, contains my solutions to the LeetCode problems I solve.

To visit my LeetCode profile, please click here.

NOTE: While some solutions are marked with a runtime of 0ms, that is most likely due to an error with LeetCode's code runner and not their actual runtime.

LeetCode Topics

Stack

0071-simplify-path
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0150-evaluate-reverse-polish-notation
0957-minimum-add-to-make-parentheses-valid
1197-parsing-a-boolean-expression
1497-design-a-stack-with-increment-operation
2800-minimum-string-length-after-removing-substrings

Tree

0101-symmetric-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0116-populating-next-right-pointers-in-each-node
0129-sum-root-to-leaf-numbers
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
1254-deepest-leaves-sum
1450-delete-leaves-with-a-given-value
1484-linked-list-in-binary-tree

Depth-First Search

0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0116-populating-next-right-pointers-in-each-node
0129-sum-root-to-leaf-numbers
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0200-number-of-islands
1254-deepest-leaves-sum
1396-count-servers-that-communicate
1450-delete-leaves-with-a-given-value
1484-linked-list-in-binary-tree

Binary Tree

0101-symmetric-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0116-populating-next-right-pointers-in-each-node
0129-sum-root-to-leaf-numbers
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
1254-deepest-leaves-sum
1450-delete-leaves-with-a-given-value
1484-linked-list-in-binary-tree

Array

0045-jump-game-ii
0054-spiral-matrix
0059-spiral-matrix-ii
0064-minimum-path-sum
0066-plus-one
0074-search-a-2d-matrix
0075-sort-colors
0078-subsets
0088-merge-sorted-array
0108-convert-sorted-array-to-binary-search-tree
0118-pascals-triangle
0120-triangle
0136-single-number
0150-evaluate-reverse-polish-notation
0153-find-minimum-in-rotated-sorted-array
0169-majority-element
0189-rotate-array
0200-number-of-islands
0204-count-primes
0238-product-of-array-except-self
0240-search-a-2d-matrix-ii
0413-arithmetic-slices
0475-heaters
0816-design-hashset
0859-design-circular-deque
1027-sum-of-even-numbers-after-queries
1256-rank-transform-of-an-array
1325-path-with-maximum-probability
1396-count-servers-that-communicate
1435-xor-queries-of-a-subarray
1468-check-if-n-and-its-double-exist
1497-design-a-stack-with-increment-operation
1510-find-lucky-integer-in-an-array
1524-string-matching-in-an-array
1620-check-if-array-pairs-are-divisible-by-k
1786-count-the-number-of-consistent-strings
2006-find-the-student-that-will-replace-the-chalk
2155-find-missing-observations
2179-most-beautiful-item-for-each-query
2232-adding-spaces-to-a-string
2358-number-of-ways-to-split-array
2432-number-of-zero-filled-subarrays
2476-check-distances-between-same-letters
2497-maximum-matching-of-players-with-trainers
2503-longest-subarray-with-maximum-bitwise-and
2581-divide-players-into-teams-of-equal-skill
2685-first-completely-painted-row-or-column
2718-minimum-operations-to-make-all-array-elements-equal
2728-sum-in-a-matrix
3165-find-indices-with-index-and-value-difference-i
3309-count-prefix-and-suffix-pairs-i
3324-split-the-array
3429-special-array-i
3501-delete-nodes-from-linked-list-present-in-array
3691-minimum-operations-to-make-columns-strictly-increasing
3747-maximum-difference-between-adjacent-elements-in-a-circular-array
3788-maximum-unique-subarray-sum-after-deletion

Graph

1325-path-with-maximum-probability

Heap (Priority Queue)

1325-path-with-maximum-probability
2728-sum-in-a-matrix

Shortest Path

1325-path-with-maximum-probability

Binary Search

0074-search-a-2d-matrix
0153-find-minimum-in-rotated-sorted-array
0240-search-a-2d-matrix-ii
0441-arranging-coins
0475-heaters
1468-check-if-n-and-its-double-exist
2006-find-the-student-that-will-replace-the-chalk
2179-most-beautiful-item-for-each-query
2718-minimum-operations-to-make-all-array-elements-equal

Simulation

0054-spiral-matrix
0059-spiral-matrix-ii
1027-sum-of-even-numbers-after-queries
1800-concatenation-of-consecutive-binary-numbers
2006-find-the-student-that-will-replace-the-chalk
2155-find-missing-observations
2232-adding-spaces-to-a-string
2645-pass-the-pillow
2728-sum-in-a-matrix
2800-minimum-string-length-after-removing-substrings

Prefix Sum

0238-product-of-array-except-self
1435-xor-queries-of-a-subarray
2006-find-the-student-that-will-replace-the-chalk
2358-number-of-ways-to-split-array
2718-minimum-operations-to-make-all-array-elements-equal

Math

0029-divide-two-integers
0066-plus-one
0150-evaluate-reverse-polish-notation
0189-rotate-array
0202-happy-number
0204-count-primes
0223-rectangle-area
0326-power-of-three
0342-power-of-four
0382-linked-list-random-node
0441-arranging-coins
1800-concatenation-of-consecutive-binary-numbers
2155-find-missing-observations
2432-number-of-zero-filled-subarrays
2645-pass-the-pillow
2903-insert-greatest-common-divisors-in-linked-list
3553-check-if-two-chessboard-squares-have-the-same-color
3567-convert-date-to-binary

Linked List

0061-rotate-list
0086-partition-list
0109-convert-sorted-list-to-binary-search-tree
0116-populating-next-right-pointers-in-each-node
0138-copy-list-with-random-pointer
0141-linked-list-cycle
0142-linked-list-cycle-ii
0148-sort-list
0160-intersection-of-two-linked-lists
0237-delete-node-in-a-linked-list
0382-linked-list-random-node
0725-split-linked-list-in-parts
0816-design-hashset
0838-design-linked-list
0859-design-circular-deque
1484-linked-list-in-binary-tree
2903-insert-greatest-common-divisors-in-linked-list
3501-delete-nodes-from-linked-list-present-in-array

Breadth-First Search

0101-symmetric-tree
0102-binary-tree-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
0200-number-of-islands
1254-deepest-leaves-sum
1396-count-servers-that-communicate
1484-linked-list-in-binary-tree

Hash Table

0138-copy-list-with-random-pointer
0141-linked-list-cycle
0142-linked-list-cycle-ii
0160-intersection-of-two-linked-lists
0169-majority-element
0202-happy-number
0299-bulls-and-cows
0389-find-the-difference
0816-design-hashset
1256-rank-transform-of-an-array
1297-maximum-number-of-balloons
1468-check-if-n-and-its-double-exist
1510-find-lucky-integer-in-an-array
1620-check-if-array-pairs-are-divisible-by-k
1786-count-the-number-of-consistent-strings
1915-check-if-one-string-swap-can-make-strings-equal
2427-first-letter-to-appear-twice
2476-check-distances-between-same-letters
2581-divide-players-into-teams-of-equal-skill
2685-first-completely-painted-row-or-column
3324-split-the-array
3501-delete-nodes-from-linked-list-present-in-array
3788-maximum-unique-subarray-sum-after-deletion

Two Pointers

0061-rotate-list
0075-sort-colors
0086-partition-list
0088-merge-sorted-array
0141-linked-list-cycle
0142-linked-list-cycle-ii
0148-sort-list
0151-reverse-words-in-a-string
0160-intersection-of-two-linked-lists
0165-compare-version-numbers
0189-rotate-array
0202-happy-number
0344-reverse-string
0475-heaters
1468-check-if-n-and-its-double-exist
2232-adding-spaces-to-a-string
2497-maximum-matching-of-players-with-trainers
2581-divide-players-into-teams-of-equal-skill
3165-find-indices-with-index-and-value-difference-i
3195-separate-black-and-white-balls

String

0071-simplify-path
0151-reverse-words-in-a-string
0165-compare-version-numbers
0299-bulls-and-cows
0344-reverse-string
0389-find-the-difference
0520-detect-capital
0812-rotate-string
0957-minimum-add-to-make-parentheses-valid
1197-parsing-a-boolean-expression
1297-maximum-number-of-balloons
1302-delete-characters-to-make-fancy-string
1524-string-matching-in-an-array
1786-count-the-number-of-consistent-strings
1915-check-if-one-string-swap-can-make-strings-equal
2232-adding-spaces-to-a-string
2427-first-letter-to-appear-twice
2476-check-distances-between-same-letters
2580-circular-sentence
2800-minimum-string-length-after-removing-substrings
3195-separate-black-and-white-balls
3309-count-prefix-and-suffix-pairs-i
3451-string-compression-iii
3553-check-if-two-chessboard-squares-have-the-same-color
3567-convert-date-to-binary
3617-find-the-original-typed-string-i

Number Theory

0204-count-primes
2903-insert-greatest-common-divisors-in-linked-list

Dynamic Programming

0045-jump-game-ii
0064-minimum-path-sum
0118-pascals-triangle
0120-triangle
0397-integer-replacement
0413-arithmetic-slices

Greedy

0045-jump-game-ii
0397-integer-replacement
0957-minimum-add-to-make-parentheses-valid
2497-maximum-matching-of-players-with-trainers
3195-separate-black-and-white-balls
3691-minimum-operations-to-make-columns-strictly-increasing
3788-maximum-unique-subarray-sum-after-deletion

Bit Manipulation

0029-divide-two-integers
0078-subsets
0136-single-number
0190-reverse-bits
0191-number-of-1-bits
0342-power-of-four
0389-find-the-difference
0397-integer-replacement
1435-xor-queries-of-a-subarray
1441-minimum-flips-to-make-a-or-b-equal-to-c
1786-count-the-number-of-consistent-strings
1800-concatenation-of-consecutive-binary-numbers
2323-minimum-bit-flips-to-convert-number
2427-first-letter-to-appear-twice
2503-longest-subarray-with-maximum-bitwise-and

Reservoir Sampling

0382-linked-list-random-node

Randomized

0382-linked-list-random-node

Matrix

0054-spiral-matrix
0059-spiral-matrix-ii
0064-minimum-path-sum
0074-search-a-2d-matrix
0200-number-of-islands
0240-search-a-2d-matrix-ii
1396-count-servers-that-communicate
2685-first-completely-painted-row-or-column
2728-sum-in-a-matrix
3691-minimum-operations-to-make-columns-strictly-increasing

Counting

0169-majority-element
0299-bulls-and-cows
1297-maximum-number-of-balloons
1396-count-servers-that-communicate
1510-find-lucky-integer-in-an-array
1620-check-if-array-pairs-are-divisible-by-k
1786-count-the-number-of-consistent-strings
1915-check-if-one-string-swap-can-make-strings-equal
2427-first-letter-to-appear-twice
3324-split-the-array

Brainteaser

2503-longest-subarray-with-maximum-bitwise-and

Sorting

0075-sort-colors
0088-merge-sorted-array
0148-sort-list
0169-majority-element
0389-find-the-difference
0475-heaters
1256-rank-transform-of-an-array
1468-check-if-n-and-its-double-exist
2179-most-beautiful-item-for-each-query
2497-maximum-matching-of-players-with-trainers
2581-divide-players-into-teams-of-equal-skill
2718-minimum-operations-to-make-all-array-elements-equal
2728-sum-in-a-matrix

Backtracking

0078-subsets
0113-path-sum-ii

Divide and Conquer

0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0148-sort-list
0169-majority-element
0190-reverse-bits
0191-number-of-1-bits
0240-search-a-2d-matrix-ii

Design

0816-design-hashset
0838-design-linked-list
0859-design-circular-deque
1497-design-a-stack-with-increment-operation

Queue

0859-design-circular-deque

Hash Function

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

Merge Sort

0148-sort-list

Enumeration

0204-count-primes

Recursion

0326-power-of-three
0342-power-of-four
1197-parsing-a-boolean-expression

Binary Search Tree

0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree

Union Find

0200-number-of-islands
1396-count-servers-that-communicate

Geometry

0223-rectangle-area

String Matching

0812-rotate-string
1524-string-matching-in-an-array
3309-count-prefix-and-suffix-pairs-i

Trie

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

Rolling Hash

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

Memoization

0397-integer-replacement

Sliding Window

0413-arithmetic-slices