# Leetcode 744 - Find Smallest Letter Greater Than Target

`Note:`

- Classic binary search to find the
`first`

element that is bigger than or equal to target. - Note that we don’t need to add 1 to
`mid`

.

`Question:`

Given a characters array `letters`

that is sorted in non-decreasing order and a character `target`

, return the smallest character in the array that is larger than target.

Note that the letters wrap around.

- For example, if
`target == 'z' and`

letters == [‘a’, ‘b’]`, the answer is ‘a’.

`Example:`

1 | Input: letters = ["c","f","j"], target = "a" |

`Code:`

1 | /** |