Hi, Can you solve and explain this coding ninja question? (With O(log n) time complexity) https://www.naukri.com/code360/problems/search-in-rotated-sorted-array_1082554

Problem Statement As Google headquarters have more and more workers, they decided to divide the departments in the headquarters into two groups and stagger their lunch breaks. Google headquarters have N departments, and the number of people in the i-th department (1≤i≤N)(1≤i≤N) is Ki. When...