LeetCode Solutions/Binary Search Study Plan/Binary Search I/Find Smallest Letter Greater Than Target.java
<reponame>DevashishPathrabe/LeetCodeclass Solution {
    public char nextGreatestLetter(char[] letters, char target) {
        for(int i=0; i<letters.length; i++){
            if(letters[i] > target){
                return letters[i];
            }
        }
        return letters[0];
    }
}