Solved Problem: -
Find the Kth rotation.
Its logic was same as of finding the min in rotated sorted array just we have to return the index of the of the min value in rotated sorted.
Today Solved:
1. Find first and last occurrence.
(Solved with Lower bound and upper bound as well as with plain binary Search).
2. Number Of occurrences.