andreyka26_se
608 subscribers
578 photos
66 videos
6 files
291 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
πŸ‘3
LETS GO
motherfuckers, prev time 3 years ago they didn't have it I remember
πŸ”₯2
Today we are streaming, usual schedule 20:00 Prague time. Leetcode, System Design + discussing AWS screening 😁😁😁
❀6
Lets hack Pentagon
😁10
LET"S Go.

But if we are serious, this is exactly how many days you need before the interview. 1-2 leetcode problems per day, cover all the patterns (sliding window, array, 2 pointers, dp, dfs, bfs, graphs, etc) and you are kind of ready.
πŸ”₯5❀1
https://leetcode.com/problems/rotate-image/?envType=study-plan-v2&envId=top-interview-150

literally my feeling, after I solved my stupid way, and looked at the solution)
https://www.interviewbit.com/

Interesting thing, recruiter from FB recommended this thing to my friend instead of leetcode:
has anybody tried it?
but I mean.... quality of this service is not that great.
Cloudflare blocked with this html page for the root domain.

Pretty weak explanations I would say. Stuff is either very simple and don't need expl but they do provide it, or very hard, and it is badly explained.

Especially analyzing recurrences. These guys didn't even mention anything about derivation and equations, and wops, here you are some random numbers out of nowhere proving something
😁2
Well well well. It seems like doesn’t matter how high you are. And I hardly can imagine how these top managers are looking for a job, applying and interviewing. Usually, what I saw, such guys are 20+ years at the same company, so it is not like there is huge flow in and out there.
🀯4
At least for engineering - it is easily justifiable: be able to write code, be able to design stuff, have relevant exp
One more:
🀯2
Stream in 2-3 hours
πŸ”₯2
Today we are talking about important stuff about the graphs. Union Find, dfs, bfs.
On top of that I wanted to review the MIT lecture about BST node deletion and compare with our solution, as I think MIT lecture was a bit not complete.

As the last thing - we are reviewing solutions for URL shortener on Youtube and compare with ours, and why they better or worse.

If we have time left - we will finish URL shortener impl + load tests
πŸ”₯2πŸ‘1