[LeetCode] Lv.4 計畫

演算法 Lv.4 (7 / 10)

• Dynamic programming
  • Best Time to Buy and Sell Stock Easy
  • Climbing Stairs Easy
  • Maximum Subarray Medium
  • Longest Palindromic Substring Medium
  • Coin Change Medium
  • Partition Equal Subset Sum Medium
  • Unique Paths Medium
  • House Robber Medium
  • Maximum Product Subarray Medium
  • Trapping Rain Water Hard

Stage 1

Readings

• Dynamic programming
• Dynamic Programming – 7 Steps to Solve any DP Interview Problem
• Less Repetition, More Dynamic Programming, basecs

Questions

• Best Time to Buy and Sell Stock Easy (🌟🌟🌟🌟🌟)
  • in Top 100 likes
  • in 字節跳動 動態規劃 高頻題
    • 頻度：122 （Top 1 in Dynamic programming)
    • 最近考察時間 (2023-01-13)
• Climbing Stairs Easy
  • in Top 100 likes
  • in 字節跳動 動態規劃 高頻題
    • 頻度：37
    • 最近考察時間 (2022-08-05)
• Maximum Subarray Medium (🌟🌟🌟🌟🌟)
  • Divide and Conquer
  • in Top 100 likes
  • in 字節跳動 動態規劃 高頻題
    • 頻度：90 （Top 3 in Dynamic programming)
    • 最近考察時間 (2022-01-13)

Stage 2

• Longest Palindromic Substring (🌟🌟🌟🌟🌟)
  • Hash Table 、Greedy
  • in Top 100 likes
  • in 字節跳動 動態規劃 高頻題
    • 頻度：88（Top 4 in Dynamic programming)
    • 最近考察時間 (2023-01-04)
• Coin Change Medium
  • Breadth-First Search
  • in Top 100 likes
  • in 字節跳動 動態規劃 高頻題
    • 頻度：40 （Top 9 in Dynamic programming)
    • 最近考察時間 (2022-12-13)
• Trapping Rain Water Hard (🌟🌟🌟🌟🌟)
  • Two pointers、Stack、Monotonic Stack
  • in Top 100 likes
  • in 字節跳動 動態規劃 高頻題
    • 頻度：93 （Top 2 in Dynamic programming)
    • 最近考察時間 (2022-12-05)
• House Robber Medium
  • Classical problem
  • in Top 100 likes
  • in 字節跳動 動態規劃 高頻題
    • 頻度：30
    • 最近考察時間 (2022-08-23)