Search Suggestions System | Leetcode 1268 | Live coding session

Here is the solution to "Maximum Gap" leetcode question. Hope you have a great time going through it.

Chapters
1) 0:00 Explaining the problem out loud
2) 1:10 Question walkthrough
3) 2:00 Test case walkthrough
4) 8:00 Coding it up
Here is the solution to "Search Suggestions System" leetcode question. Hope you have a great time going through it.

Check this out 🔽🔽🔽🔽

🔥🔥🔥🔥👇👇👇 For discussion/feedback/humour/doubts/new openings

👉 Solutions

🔥🔥🔥🔥👇👇👇 For discussion/feedback/humour/doubts/new openings

🔴 Checkout the series: 🔥🔥🔥

🔥🔥🔥 Leetcode Monthly Contest Playlist

[parikabajaj]

You don't fail to come up with an interesting approach. Too good

[abhinavkumar]

I wish you had elaborated more on those inbuilt functions and that technique of fetching the floor value "{"

[rohandikshit]

I have been following your content from sometime now and it is helping me a lot. The efforts you put in making the ppt and explaining them so well is commendable.
I wish I can code like you one day.
Great work keep it up.

[shishir-kon]

A small correction during explanation from 4:52:
The array is sorted, so the iteration from (0-2) will happen on the sorted array, giving the answer for 'm' as [mobile, moneypot, monitor]

[prawarmundra]

thanks for this approach but don't know how to implement this in c++. i try but it didn't work

[GurgaonKiEngineer]

How do you approach such question? I couldn't think about this on my own. Please enlighten.

[RupinderSingh-gshz]

Brother please also provide wiggle sort 2 of leetcode