Algorithms Review 2
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 14% Most missed: “Right propagate the rightmost set bit in x”
Algorithms Review 2
Time left 00:00
25 Questions

1. Typical runtime of a recursive function with multiple branches

2. Rooted Binary Tree

3. Standard data structure for solving complex bit manipulation

4. Compute x modulo a power of 2 (y)

5. Palindrome

6. Search Pruning

7. One-Sided Binary Search

8. Articulation Vertex

9. Solving Divide-and-Conquer Recurrances

10. Combinations of binary tree traversal sequences that uniquely identify a tree

11. Minimum Spanning Trees

12. Full Binary Tree

13. Prim's Algorithm

14. Graph Modeling

15. Type erasure

16. Bipartite Matching

17. Directed Graph Finding Cycles

18. Iterative Refinement

19. Mnemonic

20. Compute XOR of every bit in an integer

21. Rabin-Karp

22. Complete Binary Tree

23. Constructing a heap in linear time

24. Transitive Closure

25. Topological Sort