Only change you had to do in the final code was to write "(nums[nn]^k) + nontaken" instead of "nums[nn]^k + nontaken"... Bit manipulation ka operator precedence 🤦
Hi Vivek I'm stuck at an old problem called Bricks Colouring from one of your DP WORKSHOP videos would you please provide a recursive code for this problem because the code provided is iterative
Only change you had to do in the final code was to write "(nums[nn]^k) + nontaken" instead of "nums[nn]^k + nontaken"... Bit manipulation ka operator precedence 🤦
Next time har chij me braces
@@AmanSingh-on4ce Absolutely. Dimag kharab kar diya :(
Bhai can you please explain the in java also....😢😢😢
I don't think so ... i don't know JAVA.
where can i get code which you have submitted or explained in the video?
leetcode.com/submissions/detail/1197431096/
@@vivekgupta3484Thanks :)
Hi Vivek I did not understood ordered set problem why we are inserting elements along with their index,please make a detailed video on pbds
because the order matters in the final array
Video on this coming soon.
Hi Vivek I'm stuck at an old problem called Bricks Colouring from one of your DP WORKSHOP videos would you please provide a recursive code for this problem because the code provided is iterative
it has very high constraints. Iterative will be needed.
Thankss
Metamask spotted
Worked at 0xPPL :P
God of cp