Problem Solving

리트코드는 하나의 여정이다. 시작도 끝도 없다.

1. Arrays
2. Searching
3. Sorting
4. Matrix
5. Hashing
6. String
7. Linked List
8. Stack
9. Queue
10. Trees
11. Binary Search 🌲
12. Heap
13. Graph
14. Backtracking
15. Dynamic Programming

자료구조 시각화 VisuAlgo

The guide for problem constraints:

N	Complexity	Possible Algorithms & Techniques
1018	O(log N)	Binary & Ternary Search / Matrix Power / Cycle Tricks / Big Simulation Steps / Values ReRank
100,000,000	O(N)	A Linear Solution - May be a greedy/adhock algorithm
40,000,000	O(N log N)	linear # calls to Binary & Ternary Search / Pre-processing & Querying / D & C
10,000	O(N2)	adhock / DP / Greedy / D & C / B & B
500	O(N3)	adhock / DP / Greedy / ..
90	O(N4)	adhock / DP / Greedy / ...
30-50	O(N5)	Search with pruning - branch and bound
40	O(2N/2)	Meet in Middle
20	O(2N)	Backtracking / Generating 2N Subsets
11	O(N!)	Factorial / Permutations / Combination Algorithm

Reference

• my leetcode study guide
• leetcode patterns
• 리트코드 리스트 포맷
• 75
• Coderust
• https://www.coursera.org/learn/algorithms-part1
• https://www.coursera.org/learn/algorithms-part2

Current LeetCode(1/500)