Start learning →

Algorithms bingo

Exercise and reference answers

Clues and terms
  1. Clue
    Random access in one step.
    Item
    Array list
  2. Clue
    Fast insert and delete.
    Item
    Linked list
  3. Clue
    Left less, right greater.
    Item
    Search tree
  4. Clue
    Balanced at every node.
    Item
    AVL tree
  5. Clue
    Common priority queue.
    Item
    Binary heap
  6. Clue
    Worst case growth.
    Item
    Big O
  7. Clue
    Halving again and again.
    Item
    Log N
  8. Clue
    Divide, sort, merge.
    Item
    Merge sort
  9. Clue
    Best immediate benefit.
    Item
    Greedy
Instructions
Read each clue and tap the term it describes.

Explanation

_Source: OpenStax Introduction to Computer Science, Chapter 3, Data Structures and Algorithms._
Continue learning with Quill →

Browse more Coding Interview Prep questions and exercises →