leet

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

LeetCode Topics

String

0712-minimum-ascii-delete-sum-for-two-strings
2976-minimum-cost-to-convert-string-i
2977-minimum-cost-to-convert-string-ii

Dynamic Programming

0085-maximal-rectangle
0712-minimum-ascii-delete-sum-for-two-strings
1411-number-of-ways-to-paint-n-3-grid
1458-max-dot-product-of-two-subsequences
2977-minimum-cost-to-convert-string-ii
3651-minimum-cost-path-with-teleportations

Hash Table

0496-next-greater-element-i
0865-smallest-subtree-with-all-the-deepest-nodes
0961-n-repeated-element-in-size-2n-array
2975-maximum-square-area-by-removing-fences-from-a-field
3013-divide-an-array-into-subarrays-with-minimum-cost-ii
3507-minimum-pair-removal-to-sort-array-i
3510-minimum-pair-removal-to-sort-array-ii

Tree

0865-smallest-subtree-with-all-the-deepest-nodes
1161-maximum-level-sum-of-a-binary-tree
1339-maximum-product-of-splitted-binary-tree

Depth-First Search

0865-smallest-subtree-with-all-the-deepest-nodes
1161-maximum-level-sum-of-a-binary-tree
1339-maximum-product-of-splitted-binary-tree

Breadth-First Search

0865-smallest-subtree-with-all-the-deepest-nodes
1161-maximum-level-sum-of-a-binary-tree

Binary Tree

0865-smallest-subtree-with-all-the-deepest-nodes
1161-maximum-level-sum-of-a-binary-tree
1339-maximum-product-of-splitted-binary-tree

Array

0066-plus-one
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0496-next-greater-element-i
0744-find-smallest-letter-greater-than-target
0961-n-repeated-element-in-size-2n-array
1200-minimum-absolute-difference
1266-minimum-time-visiting-all-points
1390-four-divisors
1458-max-dot-product-of-two-subsequences
1877-minimize-maximum-pair-sum-in-array
1975-maximum-matrix-sum
2943-maximize-area-of-square-hole-in-grid
2975-maximum-square-area-by-removing-fences-from-a-field
2976-minimum-cost-to-convert-string-i
2977-minimum-cost-to-convert-string-ii
3010-divide-an-array-into-subarrays-with-minimum-cost-i
3013-divide-an-array-into-subarrays-with-minimum-cost-ii
3047-find-the-largest-area-of-square-inside-two-rectangles
3314-construct-the-minimum-bitwise-array-i
3315-construct-the-minimum-bitwise-array-ii
3453-separate-squares-i
3454-separate-squares-ii
3507-minimum-pair-removal-to-sort-array-i
3510-minimum-pair-removal-to-sort-array-ii
3651-minimum-cost-path-with-teleportations

Greedy

1877-minimize-maximum-pair-sum-in-array
1975-maximum-matrix-sum

Matrix

0085-maximal-rectangle
1975-maximum-matrix-sum
3651-minimum-cost-path-with-teleportations

Math

0066-plus-one
1266-minimum-time-visiting-all-points
1390-four-divisors
3047-find-the-largest-area-of-square-inside-two-rectangles

Stack

0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0496-next-greater-element-i

Monotonic Stack

0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0496-next-greater-element-i

Geometry

1266-minimum-time-visiting-all-points
3047-find-the-largest-area-of-square-inside-two-rectangles

Binary Search

0744-find-smallest-letter-greater-than-target
3453-separate-squares-i
3454-separate-squares-ii

Segment Tree

3454-separate-squares-ii

Line Sweep

3454-separate-squares-ii

Sorting

1200-minimum-absolute-difference
1877-minimize-maximum-pair-sum-in-array
2943-maximize-area-of-square-hole-in-grid
3010-divide-an-array-into-subarrays-with-minimum-cost-i

Enumeration

2975-maximum-square-area-by-removing-fences-from-a-field
3010-divide-an-array-into-subarrays-with-minimum-cost-i

Bit Manipulation

3314-construct-the-minimum-bitwise-array-i
3315-construct-the-minimum-bitwise-array-ii

Linked List

3507-minimum-pair-removal-to-sort-array-i
3510-minimum-pair-removal-to-sort-array-ii

Heap (Priority Queue)

3013-divide-an-array-into-subarrays-with-minimum-cost-ii
3507-minimum-pair-removal-to-sort-array-i
3510-minimum-pair-removal-to-sort-array-ii
3650-minimum-cost-path-with-edge-reversals

Simulation

3507-minimum-pair-removal-to-sort-array-i
3510-minimum-pair-removal-to-sort-array-ii

Doubly-Linked List

3507-minimum-pair-removal-to-sort-array-i
3510-minimum-pair-removal-to-sort-array-ii

Ordered Set

3507-minimum-pair-removal-to-sort-array-i
3510-minimum-pair-removal-to-sort-array-ii

Two Pointers

1877-minimize-maximum-pair-sum-in-array

Graph Theory

2976-minimum-cost-to-convert-string-i
2977-minimum-cost-to-convert-string-ii
3650-minimum-cost-path-with-edge-reversals

Shortest Path

2976-minimum-cost-to-convert-string-i
2977-minimum-cost-to-convert-string-ii
3650-minimum-cost-path-with-edge-reversals

Trie

2977-minimum-cost-to-convert-string-ii

Sliding Window

3013-divide-an-array-into-subarrays-with-minimum-cost-ii