First and last position problem (binary search) | LeetCode .34 - Inside code

Source code: gist.github.co...
🔴 Learn graph theory algorithms: inscod.com/gra...
⚙ Learn dynamic programming: inscod.com/dp_...
💡 Learn to solve popular coding interview problems: inscod.com/50p...
⌛ Learn time and space complexity analysis: inscod.com/com...
🔁 Learn recursion: inscod.com/rec...
NB: This video is ad-free, you can choose to support Inside code by purchasing one of the courses above or dropping a super thanks!
NB2: Discounts of courses above are permanent
I also post content on LinkedIn (inscod.com/lin...) and Instagram (inscod.com/ins...)

[@insidecode]

Discover the new graph theory algorithms course: inscod.com/graphalgo 🔴 / \ 🔵-🔴 | | 🔴-🔵

[@brm266]

I really respect you especially when I know you are Algerian.

[@RandomGeometryDashStuff]

07:00 `left` variable can be set to start instead of 0 if start ≠ -1 also if start = -1 then end = -1 so no need to search for end

[@insidecode]

You're right!

[@Bsusua7a]

Better explanation than neetcode. Haha. Good job

[@iliesc4076]

Nice thumbnail dude

[@krateskim4169]

Awewsome