andreyka26_se
610 subscribers
565 photos
66 videos
2 files
283 links
Hey, I'm software engineer at Microsoft, with 7 years of experience. Here we are talking about F(M)AANG big tech interviews: leetcode, system design and corpo life.

YouTube: @andreyka26_se
Instagram: andreyka26_se
TikTok: @andreyka26__
Download Telegram
andreyka26_se
I will explain, there are 3 solutions proposed, and among them there are 0 good solutions. First: just bad, let's skip. Second: hashfunction => basically get hash of input url and then get base62 encoding base62(hash(input_url))[:8]. Take first 8 characters…
I mean, why it is considered "THE BEST" resource, I don't know honestly. Some of the system designs here are great, I personally learnt a lot when I was prepping, but this system design is very bad.

What I consider a good approach?
1) snowflake id, stateless, infinitely scalable, cheap, real prod applied.
2) shards with prefixes: build multiple counters that start from 0 to N. Add 1-2 digits for "shard id". Round robin them. This will ensure both uniqueness and scalability

These are 2 "BEST" choices here.

You also can precompute all the ids, and then just reserve them with optimistic concurrency (+ apply sharding). But that would be so-so
andreyka26_se
Photo
especially the reply to the comment, this disappoints me the most....
How frequently you solve Daily leetcode challenge
Anonymous Poll
20%
(almost) everyday
15%
couple of times per week
24%
couple of times per month
41%
never
πŸ”₯2
Media is too big
VIEW IN TELEGRAM
Evntually exclusive content😁😁😁
πŸ”₯13😁1
andreyka26_se
Evntually exclusive content😁😁😁
It is only for you people. Instagram and tiktok won’t see it 😁😁
❀5
My friend asked me about "how would you scale the game matchmaking system". This is actually a very good system design.
I have no idea of the requirements, but this is something that I came up with in 15 mins.
A lot of stuff here are out of scope and missed

Concept is a bit similar to "Virtual queue" in Ticket Master system design. When you have shared sorted set and need to pop N out of them
πŸ‘7
Daily

Was very hard for me, was not able to come up with simulation even, cause, I'm not sure, just my brain cannot handle the simulation variables in head at the same time (ongoing potions, busy/notbusy mages).

But there is one picture that helps for building the simulation a lot (check comments)

https://leetcode.com/problems/find-the-minimum-amount-of-time-to-brew-potions/description/?envType=daily-question&envId=2025-10-09

#daily
andreyka26_se
Photo
let's give kudos to Max, the creator of the meme ❀️❀️❀️
❀7
Daily

https://leetcode.com/problems/maximum-total-damage-with-spell-casting/?envType=daily-question&envId=2025-10-11

Solid DP problem, which requires a bit of smartness

Description understanding helper: not power[i -1], power[i - 2], ... BUT INSTEAD power[i] - 1, power[i] - 2. It saved me a lot of time.

#daily #mid #dp
Not sure why they didn't give me 35?
AHA, I got it, I should join both.
And the problem that one of them is today 16:00 UTC + 2, another one is 4:00 AM UTC + 2
This media is not supported in your browser
VIEW IN TELEGRAM
King’s Landing, Westeros
πŸ”₯10❀2🀯1
Nothing makes my Monday happier than easy 5 mins leetcode problem, without dumb nonsense with N, K, M, 2 ^ K