Leetcode Problem 744. Find Smallest Letter Greater Than Target

744. Find Smallest Letter Greater Than Target

Leetcode Solutions

Binary Search Approach

  1. Initialize two pointers left to 0 and right to the length of letters minus 1.
  2. While left is less than or equal to right: a. Calculate the middle index mid as the average of left and right. b. If letters[mid] is less than or equal to target, move the left pointer to mid + 1. c. Otherwise, move the right pointer to mid - 1.
  3. After the loop, left will be the index of the smallest character greater than target or the length of letters if no such character exists.
  4. If left is equal to the length of letters, return letters[0].
  5. Otherwise, return letters[left].
UML Thumbnail

Linear Scan Approach

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...