But then, what can be done even better, since it is recursive solution, and interviewer for sure will ask you - how you will deal with stack overflow, and is there any iterative solution. In that case - you should start from the below: building the solution from the base case and move up until your N. Then just return the last element in memoization array

Having fun in office’s music room

oops...
As always, client fckd up
https://www.techzine.eu/news/collaboration/129181/the-end-is-nigh-for-skype-microsoft-to-pull-the-plug-in-may/

Once you will hear official commentary from MS, I will tell the story as well as I'm kind of part of this thing :)

People, today we are streaming 19:00 UTC (8pm Prague time).
Gonna do couple of LeetCode questions, and implement the rate limiter we have designed before

while implementing, we will talk a bit about concurrency. Think we never spoke about this topic before. And yeah, since we are talking about concurrency - we cannot talk about JS, so Rate Limiter will be implemented using my main: .NET.

Charging

started

https://www.youtube.com/watch?v=qEhrYLC1rhQ&ab_channel=andreyka26_se

https://www.twitch.tv/andreyka26_

Now implementing system design solution for rate limiter in .NET

Whoever was in the stream once. I would appreciate any feedback especially negative. Maybe you would like to see some other way, cause Im trying to explain pretty deep so 99% of people would understand the concept we are doing. Another thing, maybe topic that we are doing: leetcode and system design is not that important/ exciting? Let me know yeah. But I need to hear from u.

Yeah, hate it. And in the end, if real primary needs your help during the incident - he can request assistance and you are going to be woken up as well and fix shit

Be careful with signing ur contract😁

mood