Classical Binary Search
Latest LeetCode problem deals with classical binary search, here it is: https://leetcode.com/problems/find-smallest-letter-greater-than-target/description/ Given a list of sorted characters letters containing only lowercase letters, and given a target letter target , find the smallest element in the list that is larger than the given target. Letters also wrap around. For example, if the target is target = 'z' and letters = ['a', 'b'] , the answer is 'a' . Examples: Input: letters = ["c", "f", "j"] target = "a" Output: "c" Input: letters = ["c", "f", "j"] target = "c" Output: "f" Input: letters = ["c", "f", "j"] target = "d" Output: "f" Input: letters = ["c", "f", "j"] target = "g" Output: "j" Input: letters = ["c", ...