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

LeetCode Topics

Stack

0020-valid-parentheses
0042-trapping-rain-water
0155-min-stack
0232-implement-queue-using-stacks
0402-remove-k-digits
0496-next-greater-element-i
0503-next-greater-element-ii
0735-asteroid-collision
0943-sum-of-subarray-minimums

Design

0155-min-stack
0232-implement-queue-using-stacks

Queue

0232-implement-queue-using-stacks
0239-sliding-window-maximum

String

0020-valid-parentheses
0402-remove-k-digits

Array

0004-median-of-two-sorted-arrays
0026-remove-duplicates-from-sorted-array
0027-remove-element
0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0040-combination-sum-ii
0042-trapping-rain-water
0074-search-a-2d-matrix
0078-subsets
0081-search-in-rotated-sorted-array-ii
0153-find-minimum-in-rotated-sorted-array
0162-find-peak-element
0239-sliding-window-maximum
0410-split-array-largest-sum
0496-next-greater-element-i
0503-next-greater-element-ii
0540-single-element-in-a-sorted-array
0735-asteroid-collision
0943-sum-of-subarray-minimums
1056-capacity-to-ship-packages-within-d-days
1408-find-the-smallest-divisor-given-a-threshold
1605-minimum-number-of-days-to-make-m-bouquets
1646-kth-missing-positive-number
3612-adjacent-increasing-subarrays-detection-i

Hash Table

0496-next-greater-element-i

Monotonic Stack

0042-trapping-rain-water
0402-remove-k-digits
0496-next-greater-element-i
0503-next-greater-element-ii
0943-sum-of-subarray-minimums

Two Pointers

0026-remove-duplicates-from-sorted-array
0027-remove-element
0042-trapping-rain-water

Dynamic Programming

0042-trapping-rain-water
0410-split-array-largest-sum
0943-sum-of-subarray-minimums

Simulation

0735-asteroid-collision

Greedy

0402-remove-k-digits
0410-split-array-largest-sum

Sliding Window

0239-sliding-window-maximum

Heap (Priority Queue)

0239-sliding-window-maximum

Monotonic Queue

0239-sliding-window-maximum

Binary Search

0004-median-of-two-sorted-arrays
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
0153-find-minimum-in-rotated-sorted-array
0162-find-peak-element
0410-split-array-largest-sum
0540-single-element-in-a-sorted-array
1056-capacity-to-ship-packages-within-d-days
1408-find-the-smallest-divisor-given-a-threshold
1605-minimum-number-of-days-to-make-m-bouquets
1646-kth-missing-positive-number

Prefix Sum

0410-split-array-largest-sum

Divide and Conquer

0004-median-of-two-sorted-arrays

Matrix

0074-search-a-2d-matrix

Backtracking

0040-combination-sum-ii
0078-subsets

Bit Manipulation

0078-subsets