學習清單
共 45 份精選清單
The classic 75 LeetCode problems curated for interview preparation.
75 道題目30 most frequently asked problems at Amazon interviews.
30 道題目12 backtracking problems covering subsets, permutations, and constraint satisfaction.
20 道題目20 binary search problems from basic to advanced applications.
20 道題目25 essential dynamic programming problems covering all major DP patterns.
26 道題目50 essential Easy problems for building solid algorithmic foundations.
50 道題目50 most frequently asked problems at FAANG companies.
50 道題目30 most frequently asked problems at Google interviews.
30 道題目20 essential graph problems covering BFS, DFS, Union-Find, and topological sort.
20 道題目Updated 75-problem list by the original Blind 75 author, with modern problem selection.
75 道題目25 Hard problems for advanced interview preparation.
25 道題目Official LeetCode curated 150 problems for interview preparation.
150 道題目30 most frequently asked problems at Meta interviews.
30 道題目Comprehensive 150 problems covering all major patterns for coding interviews.
150 道題目20 tree problems covering traversal, BST, and advanced tree algorithms.
20 道題目15 problems mastering two-pointer and sliding window techniques.
20 道題目30 most frequently asked problems at Microsoft interviews.
30 道題目30 most frequently asked problems at Bloomberg interviews.
30 道題目30 most frequently asked problems at Apple interviews.
30 道題目20 essential sliding window problems from fixed window to advanced variable window patterns.
20 道題目15 essential monotonic stack problems covering next greater element, histogram, and subarray min/max patterns.
20 道題目15 essential heap and priority queue problems covering Top-K, merge K lists, scheduling, and greedy heap patterns.
20 道題目20 essential greedy algorithm problems covering interval scheduling, jump games, task assignment, and character rearrangement.
20 道題目15 essential interval problems covering merge, insert, scheduling, and sweep line patterns.
20 道題目15 essential bit manipulation problems covering XOR tricks, bit counting, masking, and subset enumeration.
21 道題目10 essential trie problems covering prefix tree implementation, word search, autocomplete, and maximum XOR.
20 道題目50 carefully selected medium difficulty problems covering diverse topics for systematic interview preparation.
50 道題目LeetCode 官方精選 75 題學習計畫，涵蓋 Array、Two Pointers、DP、Graph 等 22 個核心主題，系統性備戰技術面試。
75 道題目掌握鏈結串列的核心操作：反轉、快慢指針、合併與排序，從節點刪除到複雜重排，全面訓練 Linked List 面試題。
26 道題目涵蓋質數篩法、位元運算、進制轉換、GCD 與數學推導，訓練面試中常見的純數學與數論題型。
27 道題目20 essential prefix sum and difference array problems covering range queries, subarray sums, 2D prefix sum, and sweep line techniques.
20 道題目20 essential Union Find problems covering connected components, cycle detection, dynamic connectivity, and Kruskal's algorithm.
21 道題目All 416 NeetCode problems organized by category — comprehensive interview preparation covering every major pattern and data structure.
414 道題目Practice data structure design problems commonly asked in interviews.
40 道題目Divide and conquer algorithm problems.
17 道題目Game theory and minimax strategy problems.
7 道題目Computational geometry and spatial math problems.
6 道題目Advanced graph algorithms including topological sort, shortest paths, and network flow.
53 道題目Number theory, counting, combinatorics, and probability problems.
43 道題目Queue, deque, and monotonic queue pattern problems.
30 道題目Master segment trees and binary indexed trees for range queries and updates.
38 道題目Simulation and step-by-step implementation problems.
25 道題目Sorting algorithms, ordered sets, and related data structure problems.
51 道題目Advanced string manipulation, matching, and parsing problems.
27 道題目Binary search tree construction, traversal, and manipulation patterns.
13 道題目