fuck my life

3202. Find the Maximum Length of Valid Subsequence II | Leetcode Daily - Python

how the fuck you can do this unpacking I have no idea.
New math hole in my brain detected

and that's it, I didn't know this shit if possible in math, and I failed the interview, gg

https://en.wikipedia.org/wiki/Modular_arithmetic


The proof. Just if you need.
But I think leetcode and all these solutions out there should fucking link this article. Idk. Never seen this property and never knew about it.

Another way might be just to play and inductively show that it always works, if you don't know it during the interview:
For numbers 37 and 17 with mod 10, whatever you add up to them - it will always equalize results

This is mostly what you should use, if you are not great in theory (as me).

Just start playing with small and simple examples and see the pattern

This problem a bit frustrated me.
518. Coin Change II
https://leetcode.com/problems/coin-change-ii/description/

At first glance, it looks like easy-peasy DP. You try recursion + memoization at first, and aparently it does not work, cause typical 1 dimension DP gives you number of permutations, but the problem asks for number of combinations.

but then you do 2 dimension DP, and it is Time Limit Exceeded xDDDD

Today we do stream

8PM Prague time +-. Will be the most natural stream, we gonna just walk through as much problems as we can. Mostly the problems should be unsolved by me before or solved years ago, so I don't remember

I can show also this DP problem, what is the solution and why. Put thumbs up if you'd like to take a look at it. 3+ thumbs and we are doing it

Hiding

10 minutes and we start

https://www.youtube.com/live/UIy814fsKWs

https://www.twitch.tv/andreyka26_

Started

Today

slowly but surely. Now we have 10% of all leetcode problems solved