Find minimum in rotated sorted array (LeetCode 153) | Full solution with visuals | Divide & Conquer

preview_player
Показать описание


Chapters:
00:00 - Intro
00:48 - Problem Statement
02:29 - Brute Force Approach
05:06 - Efficient Solution (Binary Search)
09:48 - Dry-run of Code
11:12 - Final Thoughts

📚 Links to topics I talk about in the video:

📖 Reference Books:

🎥 My Recording Gear:

💻 Get Social 💻

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

You are the only one who explains the code so well with examples. Please never stop making videos. Can you please solve LC 999- Available Captures for Rook?

shraddhashetty
Автор

My request to nikhil, please start DSA online membership course on weekend basis or alternative days basis for community members who are all interested by utilising this channel's uploaded videos as well. So that nikhil can drawn a roadmap to learn DSA from scratch.
As per my observation, nikhil's way of explanation is to top notch among indian DSA mentors community.
Its really helpful if nikhil gives a thought on this

rudreshcm
Автор

Hey nikhil, can you please clarify this.
See i dont want to solve problems by dsa sheet nor by memorizing solution. I want to solve problems myself but its really hard to find a good resource. Will you please say any structured course wheather its paid or free. Or post a video about this is how i learnt dsa!!! Thankyou!

Homelander_
Автор

Sir please start playlist of hard dsa problem.

urvashichaurasia