This media is not supported in your browser
VIEW IN TELEGRAM
First mock interview (System design) is done πͺ
π₯7β€1π1
Could not stand it, and decided to make a video:
https://www.youtube.com/watch?v=x2AUxSWW8Js&ab_channel=andreyka26_se
As usual, for those who likes reading more: https://live.andreyka26.com/backend-is-harder-than-frontend
https://www.youtube.com/watch?v=x2AUxSWW8Js&ab_channel=andreyka26_se
As usual, for those who likes reading more: https://live.andreyka26.com/backend-is-harder-than-frontend
YouTube
Backend is HARDER than Frontend
Article: https://live.andreyka26.com/backend-is-harder-than-frontend#cap-theorem
TG: @programming_space
https://t.me/programming_space
IG: andreyka26_se
https://www.instagram.com/andreyka26_se/
TikTok: andreyka26__
https://www.tiktok.com/@andreyka26__β¦
TG: @programming_space
https://t.me/programming_space
IG: andreyka26_se
https://www.instagram.com/andreyka26_se/
TikTok: andreyka26__
https://www.tiktok.com/@andreyka26__β¦
β€3π₯3
Hacker rank question for Wise. I guess this is usually prescreen, no people are involved.
We can go through it in the next stream
We can go through it in the next stream
π₯3
Hello, people, today we are streaming +- 20:00 Prague time.
Gonna talk mock interviews, DP programming, System Design, and maybe some insights about my interviews as interviewee
Gonna talk mock interviews, DP programming, System Design, and maybe some insights about my interviews as interviewee
π₯4
https://leetcode.com/problems/delete-node-in-a-bst/?envType=study-plan-v2&envId=leetcode-75
This is the most annoying problem I have ever had
This is the most annoying problem I have ever had
LeetCode
Delete Node in a BST - LeetCode
Can you solve this real interview question? Delete Node in a BST - Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of the BST.
Basically, the deletion can beβ¦
Basically, the deletion can beβ¦
π3
Ooooookay, seems like I got something, now there will be the reason for leetcode. Let's see how it goes. On top of that I would need to recall Linux internals, which is quite interesting topic.
During my prev interview at AWS, I was asked: "your server runs out of memory (disk), you deleted file, but there is still no memory, what can be the reason, and how to fix?"
During my prev interview at AWS, I was asked: "your server runs out of memory (disk), you deleted file, but there is still no memory, what can be the reason, and how to fix?"
π3
andreyka26_se
π‘Wanted to share something with youπ‘ Iβve been working at Microsoft as a backend engineer for the past 3 years, with 7 years of total experience. Iβve gone through interviews at FAANG companies β including Amazon. Iβve also been on the other side, conductingβ¦
Cool, so eventually I have finished 4 mocked interviews that people wanted to try. All of the were free, and interesting for me as interviewer.
We had 2 algo/DS interviews and 2 System Design interviews.
Formal feedbacks are sent, eventually I'm done.
Thank you for this experience, hope it was helpful. I was trying to do it as close as we are doing it at Microsoft.
We had 2 algo/DS interviews and 2 System Design interviews.
Formal feedbacks are sent, eventually I'm done.
Thank you for this experience, hope it was helpful. I was trying to do it as close as we are doing it at Microsoft.
π₯5
What I realized - I like to be interviewee MUUUUUUCH more than interviewer, idk why and how it works.
Now some interesting stuff happened on AWS side as well. So leetcode is going full flight.
Now the commitment is 3 problems per day.
Daily challenge for today:
https://leetcode.com/problems/find-minimum-time-to-reach-last-room-ii/description/?envType=daily-question&envId=2025-05-08
good to practice shortest path
Now the commitment is 3 problems per day.
Daily challenge for today:
https://leetcode.com/problems/find-minimum-time-to-reach-last-room-ii/description/?envType=daily-question&envId=2025-05-08
good to practice shortest path
LeetCode
Find Minimum Time to Reach Last Room II - LeetCode
Can you solve this real interview question? Find Minimum Time to Reach Last Room II - There is a dungeon with n x m rooms arranged as a grid.
You are given a 2D array moveTime of size n x m, where moveTime[i][j] represents the minimum time in seconds whenβ¦
You are given a 2D array moveTime of size n x m, where moveTime[i][j] represents the minimum time in seconds whenβ¦
π₯1
andreyka26_se
Now some interesting stuff happened on AWS side as well. So leetcode is going full flight. Now the commitment is 3 problems per day. Daily challenge for today: https://leetcode.com/problems/find-minimum-time-to-reach-last-room-ii/description/?envType=dailyβ¦
On Saturday or Sunday we are streaming, btw, so we can review BST deletion, and system design.
π₯1