Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Longest Common Extension > Editorial

Longest Common Extension — Solution & Editorial

Back to the Problem

Polynomial hashing supports O(1) substring equality; binary search the match length per query. (Suffix array + sparse-table RMQ over LCP gives O(1) per query.)

Complexity: O((|S| + Q) log |S|)

Watch out: Use a 61-bit modulus (or double hashing) — 32-bit hashing is trivially collidable at these sizes.