🧮 DSA & Coding Interview Assessment

Big-O, arrays, trees/graphs, dynamic programming & sorting

00:00

Question 1 of 100/10 answered

Complexity· Scenario-based

Q1.What is the time complexity of searching for an element in a sorted array using binary search?

O(n) — you must check every element in the worst case

O(log n) — each step halves the search space, so the number of steps is proportional to log base 2 of n

O(n log n) — sorting is required before every search

O(1) — array indexing is constant time

Free · No account needed · Results instant

+20 XP on completion (signed-in users)