{CodeRoyale}
All challenges
Multiple ChoiceHard 30s

Rabin-Karp Algorithm

Rabin-Karp uses ____ for efficient string matching.
Options
  1. 1A segment tree to compare pattern with substrings in O(1) each
  2. 2A trie data structure to compare pattern with substrings in O(1) each
  3. 3Rolling hash to compare pattern with substrings in O(1) each
  4. 4Binary search to compare pattern with substrings in O(log n) each
dsastringshard

Think you can answer under pressure?

Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.

Play this in a 3-minute battle