Daily_LeetCode

LeetCode Topics

Array

Problem Name	Difficulty
0001-two-sum
0011-container-with-most-water
0015-3sum
0026-remove-duplicates-from-sorted-array
0042-trapping-rain-water
0045-jump-game-ii
0055-jump-game
0080-remove-duplicates-from-sorted-array-ii
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0134-gas-station
0135-candy
0167-two-sum-ii-input-array-is-sorted
0169-majority-element
0189-rotate-array
0209-minimum-size-subarray-sum
0215-kth-largest-element-in-an-array	Medium
0238-product-of-array-except-self
0274-h-index
0283-move-zeroes
0334-increasing-triplet-subsequence
0380-insert-delete-getrandom-o1
0605-can-place-flowers
0912-sort-an-array	Medium
1528-kids-with-the-greatest-number-of-candies
1798-max-number-of-k-sum-pairs

Two Pointers

Problem Name	Difficulty
0011-container-with-most-water
0015-3sum
0026-remove-duplicates-from-sorted-array
0028-find-the-index-of-the-first-occurrence-in-a-string
0042-trapping-rain-water
0080-remove-duplicates-from-sorted-array-ii
0125-valid-palindrome
0151-reverse-words-in-a-string
0167-two-sum-ii-input-array-is-sorted
0189-rotate-array
0283-move-zeroes
0344-reverse-string
0345-reverse-vowels-of-a-string
0392-is-subsequence
0443-string-compression
1798-max-number-of-k-sum-pairs
1894-merge-strings-alternately

Hash Table

Problem Name	Difficulty
0001-two-sum
0003-longest-substring-without-repeating-characters
0012-integer-to-roman
0013-roman-to-integer
0030-substring-with-concatenation-of-all-words
0169-majority-element
0380-insert-delete-getrandom-o1
1798-max-number-of-k-sum-pairs

Divide and Conquer

Problem Name	Difficulty
0169-majority-element
0215-kth-largest-element-in-an-array	Medium
0912-sort-an-array	Medium

Sorting

Problem Name	Difficulty
0015-3sum
0169-majority-element
0215-kth-largest-element-in-an-array	Medium
0274-h-index
0912-sort-an-array	Medium
1798-max-number-of-k-sum-pairs

Counting

Problem Name	Difficulty
0169-majority-element

Math

Problem Name	Difficulty
0007-reverse-integer	Medium
0009-palindrome-number	Easy
0012-integer-to-roman
0013-roman-to-integer
0070-climbing-stairs	Easy
0189-rotate-array
0380-insert-delete-getrandom-o1
0509-fibonacci-number	Easy
1146-greatest-common-divisor-of-strings

Dynamic Programming

Problem Name	Difficulty
0042-trapping-rain-water
0045-jump-game-ii
0055-jump-game
0070-climbing-stairs	Easy
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0392-is-subsequence
0509-fibonacci-number	Easy

Greedy

Problem Name	Difficulty
0011-container-with-most-water
0045-jump-game-ii
0055-jump-game
0122-best-time-to-buy-and-sell-stock-ii
0134-gas-station
0135-candy
0334-increasing-triplet-subsequence
0605-can-place-flowers

String

Problem Name	Difficulty
0003-longest-substring-without-repeating-characters
0006-zigzag-conversion
0012-integer-to-roman
0013-roman-to-integer
0014-longest-common-prefix
0028-find-the-index-of-the-first-occurrence-in-a-string
0030-substring-with-concatenation-of-all-words
0058-length-of-last-word
0125-valid-palindrome
0151-reverse-words-in-a-string
0344-reverse-string
0345-reverse-vowels-of-a-string
0392-is-subsequence
0443-string-compression
1146-greatest-common-divisor-of-strings
1894-merge-strings-alternately

Counting Sort

Problem Name	Difficulty
0274-h-index
0912-sort-an-array	Medium

Design

Problem Name	Difficulty
0380-insert-delete-getrandom-o1

Randomized

Problem Name	Difficulty
0380-insert-delete-getrandom-o1

Prefix Sum

Problem Name	Difficulty
0209-minimum-size-subarray-sum
0238-product-of-array-except-self

String Matching

Problem Name	Difficulty
0028-find-the-index-of-the-first-occurrence-in-a-string

Trie

Problem Name	Difficulty
0014-longest-common-prefix

Stack

Problem Name	Difficulty
0042-trapping-rain-water

Monotonic Stack

Problem Name	Difficulty
0042-trapping-rain-water

Binary Search

Problem Name	Difficulty
0167-two-sum-ii-input-array-is-sorted
0209-minimum-size-subarray-sum

Sliding Window

Problem Name	Difficulty
0003-longest-substring-without-repeating-characters
0030-substring-with-concatenation-of-all-words
0209-minimum-size-subarray-sum

Recursion

Problem Name	Difficulty
0509-fibonacci-number	Easy

Memoization

Problem Name	Difficulty
0070-climbing-stairs	Easy
0509-fibonacci-number	Easy

Heap (Priority Queue)

Problem Name	Difficulty
0215-kth-largest-element-in-an-array	Medium
0912-sort-an-array	Medium

Merge Sort

Problem Name	Difficulty
0912-sort-an-array	Medium

Bucket Sort

Problem Name	Difficulty
0912-sort-an-array	Medium

Radix Sort

Problem Name	Difficulty
0912-sort-an-array	Medium

Quickselect

Problem Name	Difficulty
0215-kth-largest-element-in-an-array	Medium