Leetcode 33 | Search in Rotated Sorted Array | Asked in Paypal Vmware Oracle (Log time Solution)
Вставка
- Опубліковано 13 жов 2024
- Search in Rotated Sorted Array is a common problem recently asked in many tech companies like Paypal, VMware, Oracle etc.
It can be solved in logarithmic time complexity if we tweak binary search a bit. This question tests a programmers problem solving ability and their ability to identify problem related to key concepts like binary search.
You are expected to solve this problem within 20-30 mins, cover all the edge cases, use proper variable name and write clean and concise code.
I have explained the approach in details in this video.
Based on leetcode 33. Search in Rotated Sorted Array
leetcode.com/p...
problem statement:
Given an integer array nums sorted in ascending order, and an integer target.
Suppose that nums is rotated at some pivot unknown to you beforehand (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).
You should search for target in nums and if you found return its index, otherwise return -1.
You can buy us a coffee at : www.buymeacoff...
system design: • System Design | Distri...
DS for beginners: • Arrays Data Structures...
leetcode solutions: • Leetcode 84 | Largest ...
github: github.com/The...
facebook group : / 741317603336313
twitter: / granthtech
Hey, thanks for video.
Can you please make LLD video on job schedule where we can pause the job, start the job, stop the job etc
Thanks
Yes sure, will add it to list.
Do like and subscribe and share with others 🙂
@@TheTechGranth Thanks, I really like your content. Already liked and subscribed :) will definitely dhare with friend.
Please make you make this lld video as it has lot of threading knowledge and will help everyone