3130 & 3129 Find All Possible Stable Binary Arrays II | DP | Prefix Sums | Sliding Window

[@salmankhader1258]

58 mins is worthy to watch it.

[@ARYANMITTAL]

If we have any doubts on dp problem on Intuition or understanding, do watch this playlist for practice - kzbin.info/aero/PLEL7R4Pm6EmCXe8803IBAPWVsHlTVrtOp . . How all Educators are lying to you - kzbin.info/www/bejne/hnjUgH2iq5WJm7s

[@JRK_RIDES]

Pin this comment

[@nikhiljain8303]

The video for which we were waiting. Thanks @aryan

[@gaurish3367]

amazing video

[@Manjeet-zz1wi]

Great video sir . It's really awesome to see alumni sharing their expertise.

[@killeraloo3247]

sab samjh aa gya, accha solution tha.

[@242deepak]

I am not an english expert but improvisation means making something on the spot and improvement means to improve something. Both are not the same.

[@nikhilprakash729]

great explanation

[@mayankkharb4164]

@ARYANMITTAL great video brother. Just a single doubt, in this we are using the prefix concept some people have used a different prefix space to store the prefixes but you made the specific dp state itself as the prefix value by adding it's previous state into it, but when giving the final answer you are returning the dp state itself which is a prefix of dp states till that point, shouldn't you subtract the previous state from it so it isn't the prefix state anymore and then return it? Also, i am saying convert it into prefix because in the non-optimal tabulation method you are only adding the alternate 0 or 1 state to add into current state but in the optimal one at the start only you are adding the same 0 or 1 previous state into it which makes it the prefix state till then.

[@sukhpreetsingh5200]

bhai awesome explaination

[@VivekKumar-p2g4l]

the optimization from o(n^3) to O(n^2) was difficult to understand

[@sushanthgupta626]

How can this question be done in 1 hr 😶😶😶.... HOw to get intution... then optimize... then solve to in just 1hr.. how??

[@helloimjavauser]

On which writing pad do you write?

[@coder6109]

dont ever stop bro

[@Krishna-ti8ys]

Hi @ARYANMITTAL thanks for the solution, I am facing an issue that when i make dp of type dp[zero][one][consecutiveEl][cnt], my solution gets sumitted but when i use dp of type dp[zero][one][cnt][consecutiveEl] it gives tle. Is this some kind of glitch of leetcode as the time complexity of both the type is same. I am very confused.

[@akashkaruturi5128]

if you are using python it will give

[@Krishna-ti8ys]

@@akashkaruturi5128 I have written my code in c++.

[@anonymous10906]

same problem here with c++

[@Krishna-ti8ys]

@@akashkaruturi5128 I have written my code in c++

[@shivrajhulwan2235]

Yes I also faced same issue in the contest

[@rkb_404]

why not dp[z - limit][o][1] instead of dp[z - limit - 1][o][1]? Still not able to grasp it

[@akashmaurya6313]

simply bcz we are counting from limit to z-1. for ex - let's say limit is 1 so if we do dp[z - limit][o][1] this means dp[z -1][o][1] but since our limit is 1 that means we have consider 1 previous element then we should do dp[z -2][o][1] instead of dp[z -1][o][1] this is why dp[z - limit - 1][o][1]

[@QWERTY-ee2ys]

Bhai normally explain nahi kar sakta kya? It annoying at times the over exaggeration. Aur tune hi ye problem ka video dala hai so got no option. Anyways good content

[@govindlohar6816]

this code is not getting pass with java

[@SiddharthSingh-ty3xz]

Giving TLE for last 2 test case