[Java] Leetcode 744. Find Smallest Letter Greater Than Target [Binary Search #3]

preview_player
Показать описание
In this video, I'm going to show you how to solve Leetcode 744. Find Smallest Letter Greater Than Target which is related to Binary Search.

Here’s a quick rundown of what you’re about to learn:

Course Contents
(0:00​) Question Walkthrough
(2:03) Solution Explain
(2:55) Code

In the end, you’ll have a really good understanding on how to solve Leetcode 744. Find Smallest Letter Greater Than Target and questions that are similar to Binary Search.

Now, if you want to get good at Binary Search, please checkout my Binary Search playlist.

Рекомендации по теме
Комментарии
Автор

Im having a hard time grasping binary search, I will keep practicing!!

BetterEverydayHD
Автор

Thanks for your awesome explanation!
😀

vanshen
Автор

can someone please explain why he used while condition

nikhilpoonia
Автор

Why L+1<R? Ur reason
It would be helpful for this community if you switch your algorithms playlists to public, Or i can pay if it's premium

Kaafirpeado-ayesha
Автор

Can you explain why you use L+1 in the while condition?

fernandoz
Автор

Is it possible that when the condition breaks L + 1 = R, the target is located at letters[R]?

vanshen