LeetCode 2895. Minimum Processing Time
周賽366。有點像之前某次Q4的什麼花園種花題。
Recent posts
LeetCode 1420. Build Array Where You Can Find The Maximum Exactly K Comparisons
每日題。可以優化超級多次dp練習題。單純通過不難，難的是找出最佳解。
LeetCode 2127. Maximum Employees to Be Invited to a Meeting
還挺好玩的拓圖排序題，而且範例給的很充足。
LeetCode 2876. Count Visited Nodes in a Directed Graph
周賽365。圖論在最近Q4佔比很重，超過一半。