class Solution {
public char nextGreatestLetter(char[] letters, char target) {
int n=letters.length;
int low=0;
int high =n-1;
char res=letters[0];
while(low <=high){
int mid= low+(high-low)/2;
if((int)letters[mid] <= target){
low=mid+1;
}
else if((int)letters[mid] > target){
res=letters[mid];
high=mid-1;
}
}
return res;
}
}
Y2xhc3MgU29sdXRpb24gewogICAgcHVibGljIGNoYXIgbmV4dEdyZWF0ZXN0TGV0dGVyKGNoYXJbXSBsZXR0ZXJzLCBjaGFyIHRhcmdldCkgewogICAgICAgIGludCBuPWxldHRlcnMubGVuZ3RoOwogICAgICAgIGludCBsb3c9MDsKICAgICAgICBpbnQgaGlnaCA9bi0xOwogICAgICAgIAogICAgICAgIGNoYXIgcmVzPWxldHRlcnNbMF07CiAgICAgICAgd2hpbGUobG93IDw9aGlnaCl7CiAgICAgICAgICAgIGludCBtaWQ9IGxvdysoaGlnaC1sb3cpLzI7CiAgICAgICAgICAgIGlmKChpbnQpbGV0dGVyc1ttaWRdIDw9IHRhcmdldCl7CiAgICAgICAgICAgICAgICBsb3c9bWlkKzE7CiAgICAgICAgICAgIH0KICAgICAgICAgICAgZWxzZSBpZigoaW50KWxldHRlcnNbbWlkXSA+IHRhcmdldCl7CiAgICAgICAgICAgICAgICByZXM9bGV0dGVyc1ttaWRdOwogICAgICAgICAgICAgICAgaGlnaD1taWQtMTsKICAgICAgICAgICAgfQogICAgICAgIH0KICAgICAgICByZXR1cm4gcmVzOwogICAgfQp9