L -121 First negative number in every window of size K | Java DSA Placement | FAANG | GFG

[@aakashdeep_2310]

Nicely Explained
Thank you bhaiya

[@saniakumari117]

Time Complexity of Brute should be N*K then why (N*k)*k (extra *k)

[@shakshampandey21]

Where do i get this JAVAPLUSDSA sheet

[@shashwat_tiwari_st]

@@shakshampandey21 ruclips.net/video/lZ5olZxEt_s/видео.htmlsi=J-2VVcmwzFAaYvBK

[@marshmallow_av]

how space complexity is n-k ,could you please explain in detail ?

[@marshmallow_av]

the above question is for brut force approach.

[@damnanuj]

Result arr size [n-k+1] hi...ye kaise decide hua sir?

[@shashwat_tiwari_st]

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.

[@mr.nishantawasthi4402]

Sir placement aap k channel se hoga....

[@shashwat_tiwari_st]

Touch wood 🤞

[@dhananjoyghosh3500]

This is not the optimal approach