算法与数据结构
银牌考试
Sixteen questions across the whole course: counting steps, searching, hash maps, stacks and queues, recursion, sorting, graphs, trees, heaps, dynamic programming and shortest paths. Trace the code, count the steps and pick the right tool.
- 16 道题
- 20 分钟
- 及格线 80%
- 至少 6 道实操题
考查范围 Big O and counting stepsSearchingHash maps and setsStacks and queuesRecursion and memoizationSortingGraphs and BFSTreesHeapsDynamic programmingShortest paths
计时无法暂停，中途离开也会算作一次作答。