Skip to main content
Back

Algorithms and data structures

Silver exam

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 questions
  • 20 minutes
  • Pass mark 80%
  • At least 6 hands-on tasks
Covers Big O and counting stepsSearchingHash maps and setsStacks and queuesRecursion and memoizationSortingGraphs and BFSTreesHeapsDynamic programmingShortest paths

The clock cannot be paused, and leaving counts as an attempt.