Рет қаралды 24,088
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