Peak Element | O(logN) Time complexity and O(1) Space Complexity Solution |

This is the video under the series of DATA STRUCTURE & ALGORITHM. We are going to solve Questions from GeeksforGeeks Majority Element in O(logN) Time Complexity and O(1) Space complexity. Given an array A of N integers. The task is to find a peak element in A in O( log N ).
An array element is a peak if it is not smaller than its neighbors. For corner elements, consider only one neighbor.
Which is a very famous and Routine question asked in Interview. The question is from the Topics Data structure. A full easy concept in Hindi. This is Question is asked in Many companies like Google, Amazon, Oyo Rooms, Paytm, Samsung, Adobe, etc..
We also Provide courses on Competitive Programming and Data structure. Please see our Full Playlist on our Channel.
----------------------------------------------------------------------------------------
► Homework Question: - - - - - - - - - - - - - - - - - - - -
----------------------------------------------------------------------------------------
► Peak Element: practice.geeks...
► PDF of Peak Element: github.com/Pri...
► CODE of Peak github.com/Pri...
----------------------------------------------------------------------------------------
*Follow me *
LinkedIn► / iamprince
Facebook► / helloworldofficials
Instagram► / helloworldbyprince
Twitter► / prince_king_
----------------------------------------------------------------------------------------
►Our Playlists on:-
►Competitive Programming : • How to start Competiti...
►C++ Full Course : • L-01 || Introduction a...
►Algorithms : • L-01 || Prefix Sum Arr...
►Data Structure: • Data Structures with C...
------------------------------------------------------------------------
Our Students Contacts Form:-
Form link: docs.google.co...
------------------------------------------------------------------------
#interview_preparation #geeksforgeeks #Hindi

[@abinashchhetri5946]

i have a tendency to see solution if i cant think of a solution for trying it for 5 to 10 min but after seeing your question explaination and your tendency to say the viewers to solve the question by themselves helped me and i just pause the video to solve the question and i could solve it in O(n) by myself now will look for log n solution that u explained thank you so much sir

[@prakharsrivastava1860]

Your voice is very calm and satisfying and best explaination of this question

[@HelloWorldbyprince]

Ab main itna v aacha nahi hun 🤩🤩

[@suhelali4547]

@@HelloWorldbyprince aap achha ho apko pata nahi lekin aap achha ho bro!

[@kapilgoel618]

Nicely explained "every independent array has one peak element" : )

[@jatinmittal9184]

You are simply awesome , I'm coming here after apna collage , aaditya Verma and many more . Here I'm able to understand concept . Subscriber++

[@HelloWorldbyprince]

Thanks brother Bass share kardo mere channel ko aap for motivating me ☺️

[@rahul_singh_rajput3292]

i solved this question but but i always review YT for more clarity.. how can i optime how other thinks.. and bhaiya apka Explanation 🔥🔥

[@HelloWorldbyprince]

Always welcome Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@tusharshukla3871]

I saw many videos regarding y binary search in peak element that how to choose any sinlge part,but the way u explained is amazing

[@vanshajdhar9223]

Hello, thanks for explaining the algorithm. I just have one scenario can you please check that [1,2,3,4,3,2,2,2,2,2,2]. Will binary search work for this scenario?

[@HelloWorldbyprince]

u can

[@darshankubavat1764]

Question aur explanation dono ek no.

[@mayankverma5152]

best explaination from o(n) to o(logn) by covering all corner cases...

[@HelloWorldbyprince]

Thanks buddy & Keep sharing

[@icongrindsetsfj]

God bless you brother.

[@MilindGupta]

Expecting more nd more faang questions as there are very few good channels like you 🙂😊

[@nishanttrivedi8711]

Thankyou sir now this question is crystal Clear to me you have explained very well

[@motivationalshortvideos347]

amazing explanation

[@vivekkejriwal3321]

good explanation man.. saw 2-3 videos but everybody focused on code solution rather than discussing intuition. yours is good.

[@cutejerry4273]

tremendous explanation ❤️ From Bangladesh

[@HelloWorldbyprince]

Thanks buddy Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@FarmanOfficial777]

Bhai love your concer samajhne me der to lagi par maza aa gaya

[@HelloWorldbyprince]

Nice 🙂 buddy

[@ashuplayz4612]

Thank uhhh brooooo...Nicely explainded. Subscribed

[@HelloWorldbyprince]

Yeahhhh

[@jeetsuchak1670]

How can we implement binary search if the array is not sorted??

[@HelloWorldbyprince]

We can’t Binary search is applicable only in the sorted array

[@adityasrivastava8196]

awesome explanation sir

[@HelloWorldbyprince]

Thanks for liking

[@tusharnain6652]

The if condition 🔥🔥🔥

[@HelloWorldbyprince]

yess bro

[@indianindian6001]

Very nice explanation

[@HelloWorldbyprince]

Thanks 👍 Please, if possible then share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@aviralmishra181]

Pehli baar kisi ko bolte suna ki "I hope video thoda km smjh aaya hoga" 🤣🤣 Pr ha smjh aa gya h

[@ankushladani496]

Thank You Bhaiya...

[@anjigolla4853]

Superb explanation ❤

[@aniruddhachunne3011]

so nice.. i never realized that this question is one of the most important question

[@HelloWorldbyprince]

haan yaar aacha question hai

[@Vedic_Wisdom_og]

I swapped the condition inside the else if with else condition. Why am I getting error?

[@akashnarvaria3663]

best explaination

[@67_ujjwalsolanki78]

17:11 how 40 is peak element?

[@rijishahuja8941]

what if , we want to print all the peak elements , how can we write the code for this scenario

[@HelloWorldbyprince]

basically we have to store it or write down the print action when its calculated

[@rijishahuja8941]

@@HelloWorldbyprince yupp tried to store it in count and then later printed it, but was showing error, will try again though. Thank you for the revert though

[@aniruddhachunne3011]

sir on leete code it does not work... for all cases;

[@HelloWorldbyprince]

discuss page me dekho ek baar humlog kya galat kar rahe hai

[@shreyaesha001]

thank you so much

[@HelloWorldbyprince]

Glad it helped!

[@YashSharm884]

Superb

[@HelloWorldbyprince]

Please, if possible then share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@Ravikumar-ie3cw]

Hi there, would anyone please explain to me how this question can be solved for the below test cases with the above logic: test case-1: array = {1, 7, 2, 3, 4, 5, 6} test-case-2: array = {1, 2, 3, 4, 5, 9, 7, 8} I would really appreciate your help

[@itsaayush7357]

Mujhe bs koi itna bta do ki O(logN) expected tc Diya hua he to bhaiya kh rahe h ki binary search lagega..pr binary search to sirf sorted array p lagta h na....to hum ese kese binary search laga sakte h?

[@HelloWorldbyprince]

Ysss true But iss case me aap video fir se dekhkar dry run kijiye

[@niteshshandilya4226]

thnx bhaiya

[@HelloWorldbyprince]

your welcome Nitesh

[@praveenbabuveeranki5346]

bro is the list sorted or not please clarify me

[@aakashtiwari9505]

No

[@102jayaprakashk2]

please add captions( english). I dont know Hindi .

[@HelloWorldbyprince]

Yeah sure ☺️ but it will take bits of time for me Okay I will try to add it

[@jayaprakashkumar4573]

@@HelloWorldbyprince Thank you

[@amanahmed6057]

what if arr[ mid-1] arr[mid+1]........than what should we do????????/

[@andiamakaza24]

Then mid is the peak element

[@pawanshaw8639]

sorry but i expected that after investing 20 mins ,i will get it but i did not happened,take it in a constructive way but your explanation needs to be more lucid

[@HelloWorldbyprince]

Soo polite 😁

[@supriyamanna715]

bro dekh, tu koi bhi sub array utha le, ek peak mil jayega, now taking the subarray thing is implemented using bsearch on the basis of the if condition bhaiya has explained in the vid, now the greedy selectino is to take the greater ele than mid at each iretation as it might be the case out there that o asani sai hi ban ja raha hai apna peak ele, moreover u can use ternamry search here in this qn

[@saicharan4669]

If u dont wanna go with any process , This question can be solved in one line of code : In python (inside function ) : "return arr.index(max(arr)) " That line of code is more than enough , just give it a try 😂😂

[@HelloWorldbyprince]

Nice 🙂

[@harshsaini1890]

bhai add bohot jayda ha

[@HelloWorldbyprince]

Thora to kamane do 😅😅

[@fkcoder229]

Check it for 10 9 2 17

[@whatsappvideosandgifs4315]

I tried using this approach but it is showing time limit exceeded. int peakElement(int arr[], int n) { cin >> n; int low = arr[0], high = arr[n-1]; while(low low) && (mid < n-1)){ if(arr[mid] > arr[mid+1] && arr[mid] > arr[mid-1]){ return mid; } else if(arr[mid-1] > arr[mid]){ high = mid-1; } else { low = mid+1; } } else if(mid == 0){ if(arr[0] > arr[1]){ return 0; } else{ return 1; } } else if(mid == n-1){ if(arr[n-1] > arr[n-2]){ return n-1; } else{ return n-2; } } } }

[@WeStayAnonymous]

Epic explanation 🎊

[@HelloWorldbyprince]

Thanks asheesh