1287. Element Appearing More Than 25% In Sorted Array | Binary Search | 3 Ways

preview_player
Показать описание
In this video, I'll talk about how to solve Leetcode 1287. Element Appearing More Than 25% In Sorted Array

Let's Connect:

🛍️ Products I use in Videos: (✨ Marked for Mostly requested Products)

Resources you can try:

🎥Channel Playlists

About Channel:
We teach about how you can grow in life & educate about programming in Fun & Intuitional way.

About Me:
I am Aryan Mittal - a Software Engineer, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)

✨ Timelines✨
0:00 - Problem Explanation
1:56 - Method 1 + Code (Space - O(n))
4:16 - Method 2 + Code (Space - O(1))
8:04 - Method 3 + Code (time - O(logn))

✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms
Рекомендации по теме
Комментарии
Автор

THANKS ARYAN UNDERSTOOD CLEARLY THE BINARY SEARCH APPROACH

learningmaths
Автор

Bhaiya following your videos regularly and i was only to think and code the binary search approach within 20 min .

omkumarjha
Автор

I understood the whole concept just didnt get why you did 3*n/4 not n/4 at last?

lostcyrus