The content is undoubtedly great but There are a little things that are not covered before upload of this video such as hashing and Binary Search implementation in STL . Please note that things during further uploads.
It's true but the syntax "Set.lower_bound(key)" takes O(logN) only and that's what shown in the video. whereas the syntax "lower_bound(Set.begin(), Set.end(), key)" takes O(N) in case of containers which uses non-random access iterators and O(logN) in case of containers which uses random access iterators and pointers such as vectors and arrays respectively.
this is best viedo of your teaching in cerier but the output you have shown in viedo of set,multiset,unordered set have some mistaken. 1.Loewer_bound output is not correct 2.unordered_set output is not correct
We cannot declare return type of main() as a dataype other than int so We do it generally when we typecasted int to longlong (mainly in cp) so that the main function will surely have int as the return type
Lower bound means element having the same key or greater than that.
Upper bound means greater than that key.
comment i was looking for
@@sourabhchoudhary7289 🤗
thanks a lot
han sir alag hi kuch bol rahe the
i Have Same Profile logo As YOU.!!!!!!!!!!!
The content is undoubtedly great but There are a little things that are not covered before upload of this video such as hashing and Binary Search implementation in STL . Please note that things during further uploads.
Exactly bro
the voice is low in this video on speaker. Although content is OP 🔥
Change earphones or ears maybe.... JK
@@abhishekmaurya528 No fault of earphones, the voice is really low. If you can hear clearly then you must be an owner of Sennheiser HE 1 headphones.
Evey thing is perfect except the sound amplitude pls take this into consideration
baki content boht accha but faculties videos upload krne se phle ek dusre se consult nhi krte kya ki kya topic hogya, kya nhi hua
this is actually the best video for cpp sets on youtube
time complexity of lower_bound and upper_bound in set and multiset is O(N) not O(logN), because it is not a random access iterator.
It's true but the syntax "Set.lower_bound(key)" takes O(logN) only and that's what shown in the video.
whereas the syntax "lower_bound(Set.begin(), Set.end(), key)" takes O(N) in case of containers which uses non-random access iterators and O(logN) in case of containers which uses random access iterators and pointers such as vectors and arrays respectively.
this video should have been uploaded before 84th video in this playlist.
yup buddy I also came here looking to understand sliding window problem
best video of the course
love u brother
thank you for uploading the video in such a great audio quality 😒
Big fan aman Bhaiya and team
really very helpful, thankyou so much
thank you bro
Thank you very much. You are a genius. 👍👍🙏🙏👌👌🔝🔝
Keep teaching . Keep growing 💗
👍
Thank you 🙏🙏
Thanks a lot, sir
crystal clear concept
hello guys
so that we can improve ourself
lets start coding OP
Thank you bhaiya💯
this is best viedo of your teaching in cerier but the output you have shown in viedo of set,multiset,unordered set have some mistaken.
1.Loewer_bound output is not correct
2.unordered_set output is not correct
Bhaiya we got confused.. we used it in sliding window problm ..nd it is taught afterwards
thanks :)
JAva release date?
Pls make video on 1d and 2d array prefix sum
Luv bhaiya ne krwaya hai.
Great explanation!
Khali sir Jo screen pe likhewa aara bas usko read kardere woh mam acha explain karte the 🤔
is there any advantage of using int32_t main() over int main() ??
We cannot declare return type of main() as a dataype other than int so We do it generally when we typecasted int to longlong (mainly in cp) so that the main function will surely have int as the return type
No any advantage becoz when using int main it's by default in 32 bits but extension of c++ add this 32 bit while typing.
Nice
Thanks ❤️
helpful
Hashing and Binary search nahi hua iss video tak..
op vro
map k concept pr bhi ek video bana do
voice quality is not good..but content is best....
you can use this hader file father of all's hader file if you mention this hader file then youn have not mention any one #include
Notes..??
notes ??
how is lower bound of 2 three at 3:40
Lower bound means element having the same key or greater than that.
Upper bound means greater than that key.
Hashing??
Yep, they didn’t teach yet 😂
Search on web or read from books,
Grokking algorithms is good book for understanding all basics 👌
Iske notes kha h sir
Sb thik hai pr voice ka kuch kr lo pls
Audio is too low
voice is very low in the video even after using headphones i can't hear properly
voice is very low in this video
we want didi
the video is not audible at all
Bhai aap ko to lgta h bolne me bhi jorr aata h
Inko kyu boltey ho padhane keliye? didi sahi toh padhati hai..yeh aake kuch bhi kahi se bhi kaise bhi shuru kardete hai
gaanja fhook ke ate ho kya hasing kab padhai
bhai beard mat rkh boht gandi lagri clean rkh le bhai