Confluent Interview Question

Time complexity for binary search