1482. Minimum Number of Days to Make m Bouquets | Binary Search | Problem Statement 🤡 Problem 🗿
In this video, I'll talk about how to solve Leetcode 1482. Minimum Number of Days to Make m Bouquets | Binary Search | Problem Statement 🤡 Problem 🗿
Let's Connect:
📱Discord (Join Community) : / discord
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / codewitharyanbhai
💻 Twitter - / aryan_mittal007
🤖 Github: github.com/aryan-0077
About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)
✨ Timelines✨
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms
Пікірлер: 21
Problem Statement 🤡 Problem 🗿...🤣
Damn bro , you legit have good problem solving skills
bro your way of explaining is just ❤. my day starts with your potd video.
Ab samajh gaya question , try karta hun
excellent explanation! 😲
good explanation! Thanks
This problem took me hours to solve...
great video brother as usual best quality content
OP Explaination✌✌
Maybe I'm missing something here but shouldn't the output for your example i.e. [3,2,6,1,1,2,4], m=2, k=2 be 3?
@chiragmanral6086
9 күн бұрын
I am also thinking the same
❤
Aryan can you please start these things for codechef contest questions?
thanks bhaiya
aryan what if we use sorting here?
@vansh6214
9 күн бұрын
sorting will not help here because we have to use adjacent flowers from the array , the sorting will change the adjacency of the flowers
@user-zv1uq7wd5p
9 күн бұрын
@@vansh6214 okk, thanks bro
@user-zv1uq7wd5p
9 күн бұрын
@@vansh6214 one part that was confusing me is all we know when we apply binary search we need array to be sorted and then we take mid value later I realised that here arayn applied binary search on elememts
bool isPossible(int m,int k,vector bloomDay,int limit){ int count = 0; for(int i = 0;i