Размер видео: 1280 X 720853 X 480640 X 360
Показать панель управления
Автовоспроизведение
Автоповтор
Nicely ExplainedThank you bhaiya
Time Complexity of Brute should be N*K then why (N*k)*k (extra *k)
Where do i get this JAVAPLUSDSA sheet
@@shakshampandey21 ruclips.net/video/lZ5olZxEt_s/видео.htmlsi=J-2VVcmwzFAaYvBK
how space complexity is n-k ,could you please explain in detail ?
the above question is for brut force approach.
Result arr size [n-k+1] hi...ye kaise decide hua sir?
Total elements in the array are 8 ( index 0 to 7), let's call it N.Size of window (k) is 3So possible windows are (indexes)1) 0,1,22) 1,2,33) 2,3,44) 3,4,55) 4,5,66) 5,6,7So total 6 windows!Now N=8, K=3How can we get 6 from N and KN-K+1.
Sir placement aap k channel se hoga....
Touch wood 🤞
This is not the optimal approach
Nicely Explained
Thank you bhaiya
Time Complexity of Brute should be N*K then why (N*k)*k (extra *k)
Where do i get this JAVAPLUSDSA sheet
@@shakshampandey21 ruclips.net/video/lZ5olZxEt_s/видео.htmlsi=J-2VVcmwzFAaYvBK
how space complexity is n-k ,could you please explain in detail ?
the above question is for brut force approach.
Result arr size [n-k+1] hi...ye kaise decide hua sir?
Total elements in the array are 8 ( index 0 to 7), let's call it N.
Size of window (k) is 3
So possible windows are (indexes)
1) 0,1,2
2) 1,2,3
3) 2,3,4
4) 3,4,5
5) 4,5,6
6) 5,6,7
So total 6 windows!
Now N=8, K=3
How can we get 6 from N and K
N-K+1.
Sir placement aap k channel se hoga....
Touch wood 🤞
This is not the optimal approach