bhaiya ek request thi , ki aap jase koi video bnate ho to uske end m ek follow up ques bhi bta skte ho jo usi concept pr based ho , like a homework question ......please do if possible🤗
why we didn't take j-i+1 to calculate the length so that we can compare with it k because window size ig should be j-i+1 because it is a zero base indexing array na
explanation is to much better than other. Great!
Thank you so much ❤️❤️
Thanks a lot champ
Thanks a lot ❤️❤️❤️
Hlo frnd your explanation is very nyc.I request you to make some videos on game theory
Thank You Sir
Glad i could help Shivam ❤️❤️❤️
bhaiya ek request thi , ki aap jase koi video bnate ho to uske end m ek follow up ques bhi bta skte ho jo usi concept pr based ho , like a homework question ......please do if possible🤗
Bhai Contains Duplicate III (Leetcode-220) bhi kra do na.....Your Explaination ....BTW waiting for Contains Duplicate III
Let me plan that soon.
Thanks a lot for watching ❤️❤️
Sir, can you add contains duplicate iii also?
Nice explanation
well explained thank you
Glad it was helpful! 🙏😇
Great explanation man
subscribed bro thanks so much
Thank you and welcome to my small channel 🙏😇❤️
why we didn't take j-i+1 to calculate the length so that we can compare with it k
because window size ig should be j-i+1 because it is a zero base indexing array na
Yes
awesome!
Thank you so much ❤️🙏
T.C is O(N)
S.C is O(K)
great
whats the time complexity of this solution?
use st.erase in place of st.remove in case it gives compilation error
class Solution {
public:
bool containsNearbyDuplicate(vector& nums, int k) {
unordered_map mp;
for(int i=0;i
Thank you ❤️😇🙏
Sliding window ke naam pe aapne two pointers laga diye
This is an old video. I might have got confused. Apologies for the inconvenience Sanjay ❤️🙏😇
Bro isi ko sliding window bolte hai bcz we are sliding a fixed sized window