leetcode

Collection of LeetCode questions to ace the coding interview! - Created using LeetHub

LeetCode Topics

String

0008-string-to-integer-atoi
0014-longest-common-prefix
0017-letter-combinations-of-a-phone-number
0020-valid-parentheses
0022-generate-parentheses
0058-length-of-last-word
0115-distinct-subsequences
0151-reverse-words-in-a-string
0344-reverse-string
0392-is-subsequence
2011-final-value-of-variable-after-performing-operations
2114-maximum-number-of-words-found-in-sentences

Dynamic Programming

0022-generate-parentheses
0042-trapping-rain-water
0064-minimum-path-sum
0070-climbing-stairs
0115-distinct-subsequences
0118-pascals-triangle
0121-best-time-to-buy-and-sell-stock
0300-longest-increasing-subsequence
0392-is-subsequence

Backtracking

0017-letter-combinations-of-a-phone-number
0022-generate-parentheses
0046-permutations

Hash Table

0001-two-sum
0017-letter-combinations-of-a-phone-number
0142-linked-list-cycle-ii
0160-intersection-of-two-linked-lists
0169-majority-element
0268-missing-number
0496-next-greater-element-i
0560-subarray-sum-equals-k
1365-how-many-numbers-are-smaller-than-the-current-number

Linked List

0019-remove-nth-node-from-end-of-list
0142-linked-list-cycle-ii
0148-sort-list
0160-intersection-of-two-linked-lists
0206-reverse-linked-list
0234-palindrome-linked-list
2216-delete-the-middle-node-of-a-linked-list

Two Pointers

0011-container-with-most-water
0015-3sum
0016-3sum-closest
0019-remove-nth-node-from-end-of-list
0026-remove-duplicates-from-sorted-array
0042-trapping-rain-water
0075-sort-colors
0142-linked-list-cycle-ii
0148-sort-list
0151-reverse-words-in-a-string
0160-intersection-of-two-linked-lists
0234-palindrome-linked-list
0344-reverse-string
0392-is-subsequence
0977-squares-of-a-sorted-array
2216-delete-the-middle-node-of-a-linked-list

Array

0001-two-sum
0011-container-with-most-water
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
0035-search-insert-position
0042-trapping-rain-water
0046-permutations
0064-minimum-path-sum
0075-sort-colors
0118-pascals-triangle
0121-best-time-to-buy-and-sell-stock
0136-single-number
0162-find-peak-element
0169-majority-element
0209-minimum-size-subarray-sum
0268-missing-number
0300-longest-increasing-subsequence
0496-next-greater-element-i
0560-subarray-sum-equals-k
0704-binary-search
0724-find-pivot-index
0977-squares-of-a-sorted-array
1365-how-many-numbers-are-smaller-than-the-current-number
1470-shuffle-the-array
1480-running-sum-of-1d-array
1720-decode-xored-array
1929-concatenation-of-array
2011-final-value-of-variable-after-performing-operations
2057-smallest-index-with-equal-value
2114-maximum-number-of-words-found-in-sentences

Stack

0020-valid-parentheses
0042-trapping-rain-water
0155-min-stack
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0234-palindrome-linked-list
0496-next-greater-element-i

Recursion

0050-powx-n
0206-reverse-linked-list
0231-power-of-two
0234-palindrome-linked-list
0342-power-of-four
2050-count-good-numbers

Math

0007-reverse-integer
0009-palindrome-number
0029-divide-two-integers
0050-powx-n
0070-climbing-stairs
0231-power-of-two
0268-missing-number
0342-power-of-four
1342-number-of-steps-to-reduce-a-number-to-zero
2050-count-good-numbers
3370-smallest-number-with-all-set-bits

Greedy

0011-container-with-most-water

Trie

0014-longest-common-prefix

Sorting

0015-3sum
0016-3sum-closest
0075-sort-colors
0148-sort-list
0169-majority-element
0268-missing-number
0977-squares-of-a-sorted-array
1365-how-many-numbers-are-smaller-than-the-current-number

Binary Search

0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0162-find-peak-element
0209-minimum-size-subarray-sum
0268-missing-number
0300-longest-increasing-subsequence
0704-binary-search

Memoization

0070-climbing-stairs

Tree

0101-symmetric-tree
0104-maximum-depth-of-binary-tree

Depth-First Search

0101-symmetric-tree
0104-maximum-depth-of-binary-tree

Breadth-First Search

0101-symmetric-tree
0104-maximum-depth-of-binary-tree

Binary Tree

0101-symmetric-tree
0104-maximum-depth-of-binary-tree

Divide and Conquer

0148-sort-list
0169-majority-element
0191-number-of-1-bits

Merge Sort

0148-sort-list

Design

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

Queue

0225-implement-stack-using-queues
0232-implement-queue-using-stacks

Monotonic Stack

0042-trapping-rain-water
0496-next-greater-element-i

Matrix

0064-minimum-path-sum

Simulation

1929-concatenation-of-array
2011-final-value-of-variable-after-performing-operations

Prefix Sum

0209-minimum-size-subarray-sum
0560-subarray-sum-equals-k
0724-find-pivot-index
1480-running-sum-of-1d-array

Counting Sort

0169-majority-element
1365-how-many-numbers-are-smaller-than-the-current-number

Bit Manipulation

0029-divide-two-integers
0136-single-number
0191-number-of-1-bits
0201-bitwise-and-of-numbers-range
0231-power-of-two
0268-missing-number
0342-power-of-four
0461-hamming-distance
1342-number-of-steps-to-reduce-a-number-to-zero
1720-decode-xored-array
2220-minimum-bit-flips-to-convert-number
3370-smallest-number-with-all-set-bits

Sliding Window

0209-minimum-size-subarray-sum