- rule PR -> 두 사람 리뷰 코멘트 -> 마지막 리뷰 한 사람이 merge
leetcode 문제 풀이
No | Category | Title | Difficulty |
---|---|---|---|
01 | Array, Greedy, Queue | 621. Task Scheduler | medium |
02 | Hash Table, Stack | 739. Daily Temperatures | medium |
03 | Tree, BFS | 102. Binary Tree Level Order Traversal | medium |
04 | Tree | 226. Invert Binary Tree | easy |
05 | Backtracking | 46. Permutations | medium |
06 | Dynamic Programming | 931. Minimum Falling Path Sum | medium |
07 | Tree, Binary Search | 230. Kth Smallest Element in a BST | medium |
08 | Array, Backtracking | 39. Combination Sum | medium |
09 | Dynamic Programming, Binary Search | 300. Longest Increasing Subsequence | medium |
10 | Design | 146. LRU Cache | medium |
11 | Tree, Dynamic Programming | 96. Unique Binary Search Trees | medium |
12 | String, Backtracking, Dfs, Recursion | 17. Letter Combinations of a Phone Number | medium |
13 | Array, Union Find | 128. Longest Consecutive Sequence | hard |
14 | Graph, Dfs, Bfs, Recursion | 1306. Jump Game III | medium |
15 | Array, Two Pointers | 11. Container With Most Water | medium |
16 | LinkedList, Sort | 148. Sort List | medium |
17 | Union Find, Graph | 990. Satisfiability of Equality Equations | medium |
18 | String, Backtracking | 22. Generate Parentheses | medium |
19 | Dynamic Programming | 213. House Robber II | medium |
20 | Dfs, Bfs, Topological Sort | 207. Course Schedule | medium |
21 | Backtracking | 51. N-Queens | hard |
22 | Dynamic Programming, Bit Manipulation | 338. Counting Bits | medium |
22 | Topological Sort, Dfs, Memoization | 329. Longest Increasing Path in a Matrix | hard |
23 | Array, Dfs | 695. Max Area of Island | medium |
24 | Array, Tree, Dfs | 105. Construct Binary Tree from Preorder and Inorder Traversal | medium |
25 | Hash Table, Two Pointers, String, Sliding Window | 3. Longest Substring Without Repeating Characters | medium |
26 | Array, Binary Search | 153. Find Minimum in Rotated Sorted Array | medium |
27 | Hash Table, Bit Manipulation | 187. Repeated DNA Sequences | medium |
28 | Tree, Recursion | 687. Longest Univalue Path | medium |
29 | Array, Dynamic Programming, Greedy | 122. Best Time to Buy and Sell Stock II | easy |
30 | String, Dynamic Programming, Backtracking | 131. Palindrome Partitioning | medium |
31 | String, Stack, Greedy, Monotonic Stack | 402. Remove K Digits | medium |
32 | Array, Binary Search, Divide and Conquer, Matrix | 240. Search a 2D Matrix II | medium |
33 | Array, Dynamic Programming, Greedy | 55. Jump Game | medium |
34 | Linked List, Divide and Conquer, Tree, Binary Search Tree, Binary Tree | 109. Convert Sorted List to Binary Search Tree | medium |
35 | Hash Table, String, Counting, Prefix Sum | 1737. Change Minimum Characters to Satisfy One of Three Conditions | medium |
36 | String, Dynamic Programming | 5. Longest Palindromic Substring | medium |
37 | Array, Dynamic Programming, Greedy | 714. Best Time to Buy and Sell Stock with Transaction Fee | medium |
38 | Math, Binary Search, Prefix Sum, Randomized | 528. Random Pick with Weight | medium |
39 | Hash Table, String, Design, Trie | 208. Implement Trie (Prefix Tree) | medium |
40 | Array, Binary Search, Sorting, Heap, Matrix | 378. Kth Smallest Element in a Sorted Matrix | medium |
41 | Array, Hash Table, Matrix | 36. Valid Sudoku | medium |
42 | Array, DFS, BFS, Matrix | 934. Shortest Bridge | medium |
43 | Tree, DFS, BST, Binary Tree | 98. Validate Binary Search Tree | medium |