[LeetCode] Lv.3 計畫

資料結構 Lv.3 (14/ 29 - 8 - 2 = 19)

• Tree
  • Balanced Binary Tree Easy
  • Invert Binary Tree Easy
  • Diameter of Binary Tree Easy
  • Maximum Depth of Binary Tree Easy
  • Binary Tree Level Order Traversal Medium
  • Validate Binary Search Tree Medium
  • Lowest Common Ancestor of a Binary Tree Medium
  • Time Based Key-Value Store Medium
  • Binary Tree Right Side View Medium
  • Construct Binary Tree from Preorder and Inorder Traversal Medium
  • Kth Smallest Element in a BST Medium
  • Binary Tree Maximum Path Sum Hard
• Graph (TikTok 不常考)
  • Flood Fill Easy
  • 01 Matrix Medium
  • Clone Graph Medium
  • Course Schedule Medium
  • Number of Islands Medium
  • Rotting Oranges Medium
  • Accounts Merge Medium
  • Word Search Medium
  • Minimum Height Trees Medium
  • Pacific Atlantic Water Flow Medium
• Heap
  • Kth Largest Element in an Array Medium
  • Merge k Sorted Lists Hard
  • K Closest Points to Origin Medium
  • Task Scheduler Medium
• Trie (TikTok 不常考)
  • Implement Trie (Prefix Tree) Medium
  • Word Break Medium
  • Design Add and Search Words Data Structure Medium

演算法 Lv.3

• Breadth-frist search (Tree & Graph)
• Depth-first search (Tree & Graph)
• Mention of k (Heap)

Stage 1

Reading

Tree

• Tree

Graph

• Graph
• From Theory To Practice: Representing Graphs, basecs
• Deep Dive Through A Graph: DFS Traversal, basecs
• Going Broad In A Graph: BFS Traversal, basecs

Heap

• Heap
• Learning to Love Heaps, basecs
• Heapify All The Things With Heap Sort, basecs

Trie

• Trie
• Trying to Understand Tries, basecs

Questions

Tree

• Balanced Binary Tree Easy
  • Depth-First Search
  • in 字節跳動 樹 高頻題
    • 頻度：23
    • 最近考察時間 (2022-08-05)
• Invert Binary Tree Easy
  • Depth-First Search、Breadth-First Search
  • in Top 100 likes
  • in 字節跳動 樹 高頻題
    • 頻度：30
    • 最近考察時間 (2022-09-28)
• Diameter of Binary Tree Easy
  • Depth-First Search
  • in Top 100 likes
  • in 字節跳動 樹 高頻題
    • 頻度：23
    • 最近考察時間 (2022-07-16)
• Maximum Depth of Binary Tree Easy
  • Depth-First Search、Breadth-First Search
  • in Top 100 likes

Graph

• Flood Fill Easy
  • for practice
  • Depth-First Search、Breadth-First Search

Heap / Priority Queue

• Kth Largest Element In a Stream Easy
  • in NeetCode 150
  • for practice Heap
• Last Stone Weight Easy
  • in NeetCode 150
  • for practice Heap

Week 2

Tree

• Lowest Common Ancestor of a Binary Tree Medium (🌟🌟🌟🌟🌟)
  • Depth-First Search
  • in 字節跳動 樹 高頻題
    • 頻度：94 (2nd in Tree)
    • 最近考察時間 (2022-12-01)
  • in Top 100 likes

Graph

• Course Schedule Medium (🌟🌟🌟)
  • Depth-First Search、Breadth-First Search、Topological Sort
  • in Top 100 likes
  • in 字節跳動 圖 高頻題
    • 頻度：16 (1st in Graph)
    • 最近考察時間 (2022-12-02)

Heap

• Kth Largest Element in an Array (🌟🌟🌟🌟🌟)
  • Divide and Conquer、Sorting、Quickselect
  • in Top 100 likes
  • in 字節跳動 圖 高頻題
    • 頻度：160 (1st in Heap)
    • 最近考察時間 (2022-12-05)

Trie

• Implement Trie (Prefix Tree) Medium (🌟🌟🌟)
  • in Top 100 likes
  • in 字節跳動 圖 高頻題
    • 頻度：10 (1st in Trie)
    • 最近考察時間 (2022-11-05)

Stage 3

Tree

• Binary Tree Level Order Traversal Medium (🌟🌟🌟🌟🌟)

  • Bread-First Search
  • in 字節跳動 樹 高頻題
    • 頻度：70 (4th in Tree)
    • 最近考察時間 (2022-08-16)
  • in Top 100 likes

• Binary Tree Right Side View Medium (🌟🌟🌟🌟🌟)

  • Bread-First Search 、 Depth-First Search
  • in 字節跳動 樹 高頻題
    • 頻度：73 (3rd in Tree)
    • 最近考察時間 (2022-12-01)

• Construct Binary Tree from Preorder and Inorder Traversal Medium

  • Hash Table、Divide and Conquer
  • in 字節跳動 樹 高頻題
    • 頻度：48 (7th in Tree)
    • 最近考察時間 (2022-10-10)
  • in Top 100 likes

• Binary Tree Maximum Path Sum Hard

  • Depth-First Search、Dynamic Programming
  • in 字節跳動 樹 高頻題
    • 頻度：60 (5th in Tree)
    • 最近考察時間 (2022-12-13)
  • in Top 100 likes
  • 實際難度最多只有 Medium https://leetcode.com/problems/binary-tree-maximum-path-sum/discussion/comments/1712502

Heap

• Merge k Sorted Lists Hard (🌟🌟🌟🌟🌟)
  • Linked-List、Divide and Conquer、Merge Sort
  • in Top 100 likes
  • in 字節跳動 堆 高頻題
    • 頻度 79 (2nd in Heap)
    • 最近考察時間 (2022-11-07)
  • 大家認為這題只有 Medium https://leetcode.com/problems/merge-k-sorted-lists/discussion/comments/1572702