LeetCode : Tree, KCM, LCA

Easy]
1. https://leetcode.com/problems/two-sum-iv-input-is-a-bst/
2. https://leetcode.com/problems/maximum-subarray/
3. https://leetcode.com/problems/diameter-of-binary-tree/
[Medium]
1. https://leetcode.com/problems/longest-consecutive-sequence/
(ㄴ https://www.acmicpc.net/problem/1717 문제로 대체 가능)
2. https://leetcode.com/problems/linked-list-in-binary-tree/
3. https://www.acmicpc.net/problem/11437
[Hard]
1. https://leetcode.com/problems/count-of-smaller-numbers-after-self/
2. https://leetcode.com/problems/maximum-employees-to-be-invited-to-a-meeting/

Maximum Employees to Be Invited to a Meeting - LeetCode

 

 

Medium 2. https://leetcode.com/problems/linked-list-in-binary-tree/
- 알고리즘 : KMP 알고리즘
- 설명 : https://m.blog.naver.com/kks227/220917078260

Medium 3. https://www.acmicpc.net/problem/11437
- 알고리즘 : LCA 알고리즘
- 설명 : https://www.quora.com/What-are-the-specifics-in-implementing-an-O-N-log-N-Lowest-Common-Ancestor-algorithm

Hard 1. https://leetcode.com/problems/count-of-smaller-numbers-after-self/
- 알고리즘 : MergeSort 또는 Segment Tree 또는 Fenwick Tree
- 설명 : Segment Tree : https://m.blog.naver.com/kks227/220791986409
- 설명 : Fenwick Tree : https://www.acmicpc.net/blog/view/21