- resources
- need to learn to distinguish when u need each data structure
| ds | difficulty | thoughts | |
|---|---|---|---|
| Daily Temperatures | stack | med | didnt rly know u could use monotonic array, and the idea of storing the indices didnt even occur to me💀💀 |
Arrays
- Majority Element (+Boyer-Moore) - easy
- Maximum diff between increasing elements - easy
- valid sudoku - med
- product of array except self - med
- number of adjacent elements with the same color - med (moloco)
- rabbits in forest - med
- 행렬의 곱셈 (프로그래머스)
- 실패율 (프로그래머스)
2D arrays
- rotating the box - med (moloco)
two pointers
- reverse string - easy
- container with most water - medium
- two sum - easy
- two integer sum ll - med
- 3Sum - med
- trapping rain water - hard
stack
- valid parenthesis - easy
- min stack - easy
- evaluate reverse polish notation - med
- Daily Temperatures - med
- 10진수를 2 진수로 변환 - 코딩테스트 합격자 (책)
- 괄호 회전하기 - 코딩테스트 합격자 (책)
- 크레인 인형뽑기 게임 (카카오) - 코딩테스트 합격자 (책)
binary search
- binary search - easy
- Median of two sorted arrays - hard
LinkedList
- ReverseBetween
- LRU Cache - med ⭐
- Duplicate Number (floyds cycle detection) - med (but like HARD) ⭐
- Merge K Sorted Linked Lists - hard (but seemed medium)
- Reverse Nodes in K-Group - hard
sliding window
- Practicing sliding window because I feel like i dont understand it?
- Maximum Average Subarray I - easy
- Best time to buy and sell stock - easy
- longest substring without repeating characters - med
- Permutation in string - med
Greedy
- Greedy Algorithms
- Used to solve optimization problems
- Programmers
- PSG - 키패드 누르기 - lv1
- Neetcode
- InterviewBit
Trees!!! 🌴(plz…)
-
I struggle too much…
-
Maximum Depth of Binary tree - easy
-
diameter of binary tree - easy (but seems medium??)
-
subtree of another tree - easy (but i think this should be med…)
-
balanced binary tree - easy
-
binary tree right side view - med (the DFS part is cool!)
-
valid binary search tree - med