All the Coding Interviews I Failed
Key Takeaways
The speaker shares their experiences of failing coding interviews at companies like Microsoft, Amazon, and Viva Systems, highlighting the importance of preparation and learning from mistakes in systems design interviews.
Full Transcript
I just failed my coding interview damn I'm sorry for what it's worth I've actually failed quite a few I guess not quite a few interviews because to be honest I wasn't even given a lot of interviews but I'll like tell you guys my failure interview stories so I did not do a ton of interviews the main ones I did were pretty much back in college cuz like I told you guys after I graduated I was unemployed could not get interviews for the life of me it was like 2020 nobody was really hiring back then it was like the pandemic the beginning of the Pand mic so the only interview I got was like the Google one and I did pass that one as you guys probably know but the only other interviews I did were in college and the ones I failed were Microsoft my Microsoft interview you would not believe it it was a phone interview I only got to the phone interview and I was super tryharding leak I was like there's no way I'm going to fail this interview supposed to be a 30 minute phone call they didn't even give me a lot of information about it the coding question was not even a coding question meaning like I didn't have to like code anything up it was just a phone interview the guy gave me a coding problem and I just had to like talk through it and the problem was pretty much this the tiny URL problem it was more or less that problem I think I had already done this leak H could problem before I was like okay I got this I pretty much told him the solution to the problem immediately I don't know if he thought I was cheating or what but the dude was super Rude by the way and the whole time he was just saying in the interest of time we have to like do this quickly or blah blah blah right he was like really rushing me it was a 30-minute call it ended in 15 minutes I thought I answered it perfectly given that I knew the problem not because I'm smart just cuz I had done it before and then I got rejected that was kind of dumb so you know one rejection there Microsoft that sucked cuz I would have taken that offer the other offer I got was Amazon and I probably would have taken Microsoft over Amazon but okay you live with that one there's another company you guys probably haven't heard of that I interviewed forign College it's called Viva systems they're not like a super well-known company but they're pretty like decent I'd consider them a tech company they're in Silicon Valley it's a relatively big company 27 billion or whatever so pretty big company they're like a healthcare CRM company this one I did very very well in the interview I actually liked their interview process it wasn't even like leak code style interviews or at least it wasn't like super hard it was like very reasonable questions then I pretty much got past the technical round I had a round with either a recruiter or like some like non-technical person right and this guy baited me very hard like he tricked me this was like a very valuable lesson though that I learned and to be fair I was pretty dumb he asked me we're excited to have you get this far in the process by the way he was talking like he wanted to give me a offer pretty much talking in that way like okay we're getting close to giving you offer blah blah blah and he's like I just want to know where you're at currently in the interview process what other companies are you interviewing with and stuff like that I didn't really know why he was asking me that and I was like okay I'm interviewing with a couple other companies I'm interviewing with Amazon and he's like okay what would your first choice be for company among the companies you're interviewing with who would you most prefer to join you can imagine how I answered this question how would you guys answer that question if someone asked you what do you think is the correct answer obviously what he wanted to hear was I'm really excited to join Viva but I told him probably Amazon just because I already live in Seattle I was very dumb and naive I was just being honest and that's when I learned people that you're talking to no matter how nice they come off as they're not your friend a few hours after that call I got an email saying sorry we're moving forward with somebody else and I wasn't even mad I was just like you know that guy outplayed me he 4D chessed me and I was just very very dumb you have to live with those I think cuz as long as you learn a lesson from it I think you can live with that yeah that was unfortunate I think the only other company I interviewed for at least in college was Google and I already made a video about how I failed that one
Original Description
Talking about all the technical interviews that I've failed.
🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
🧑💼 LinkedIn: https://www.linkedin.com/in/navdeep-singh-3aaa14161/
🥷 Discord: https://discord.gg/ddjKRXPqtk
🐦 Twitter: https://twitter.com/neetcode1
⭐ BLIND-75 PLAYLIST: https://www.youtube.com/watch?v=KLlXCFG5TnA&list=PLot-Xpze53ldVwtstag2TL4HQhAnC8ATf
💡 DYNAMIC PROGRAMMING PLAYLIST: https://www.youtube.com/watch?v=73r3KWiEvyk&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO&index=1
#neetcode #leetcode #python
Watch on YouTube ↗
(saves to browser)
Sign in to unlock AI tutor explanation · ⚡30
Playlist
Uploads from NeetCodeIO · NeetCodeIO · 0 of 60
← Previous
Next →
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
Leetcode 149 - Maximum Points on a Line - Python
NeetCodeIO
Design Linked List - Leetcode 707 - Python
NeetCodeIO
Minimum Time to Collect All Apples in a Tree - Leetcode 1443 - Python
NeetCodeIO
Design Browser History - Leetcode 1472 - Python
NeetCodeIO
Number of Good Paths - Leetcode 2421 - Python
NeetCodeIO
Flip String to Monotone Increasing - Leetcode 926 - Python
NeetCodeIO
Maximum Sum Circular Subarray - Leetcode 918 - Python
NeetCodeIO
Find Closest Node to Given Two Nodes - Leetcode 2359 - Python
NeetCodeIO
Concatenated Words - Leetcode 472 - Python
NeetCodeIO
Data Stream as Disjoint Intervals - Leetcode 352 - Python
NeetCodeIO
LFU Cache - Leetcode 460 - Python
NeetCodeIO
N-th Tribonacci Number - Leetcode 1137
NeetCodeIO
Best Team with no Conflicts - Leetcode 1626 - Python
NeetCodeIO
Greatest Common Divisor of Strings - Leetcode 1071 - Python
NeetCodeIO
Shortest Path in a Binary Matrix - Leetcode 1091 - Python
NeetCodeIO
Insert into a Binary Search Tree - Leetcode 701 - Python
NeetCodeIO
Delete Node in a BST - Leetcode 450 - Python
NeetCodeIO
Shuffle the Array (Constant Space) - Leetcode 1470 - Python
NeetCodeIO
Fruits into Basket - Leetcode 904 - Python
NeetCodeIO
Number of Subarrays of size K and Average Greater than or Equal to Threshold - Leetcode 1343 Python
NeetCodeIO
Naming a Company - Leetcode 2306 - Python
NeetCodeIO
As Far from Land as Possible - Leetcode 1162 - Python
NeetCodeIO
Shortest Path with Alternating Colors - Leetcode 1129 - Python
NeetCodeIO
Minimum Fuel Cost to Report to the Capital - Leetcode 2477 - Python
NeetCodeIO
Count Odd Numbers in an Interval Range - Leetcode 1523 - Python
NeetCodeIO
Contains Duplicate II - Leetcode 219 - Python
NeetCodeIO
Path with Maximum Probability - Leetcode 1514 - Python
NeetCodeIO
Add to Array-Form of Integer - Leetcode 989 - Python
NeetCodeIO
Unique Paths II - Leetcode 63 - Python
NeetCodeIO
Minimum Distance between BST Nodes - Leetcode 783 - Python
NeetCodeIO
Design Hashmap - Leetcode 706 - Python
NeetCodeIO
Range Sum Query Immutable - Leetcode 303 - Python
NeetCodeIO
Binary Tree Zigzag Level Order Traversal - Leetcode 103 - Python
NeetCodeIO
Middle of the Linked List - Leetcode 876 - Python
NeetCodeIO
Course Schedule IV - Leetcode 1462 - Python
NeetCodeIO
Single Element in a Sorted Array - Leetcode 540 - Python
NeetCodeIO
Capacity to Ship Packages - Leetcode 1011 - Python
NeetCodeIO
IPO - Leetcode 502 - Python
NeetCodeIO
Minimize Deviation in Array - Leetcode 1675 - Python
NeetCodeIO
Longest Turbulent Array - Leetcode 978 - Python
NeetCodeIO
Last Stone Weight II - Leetcode 1049 - Python
NeetCodeIO
Construct Quad Tree - Leetcode 427 - Python
NeetCodeIO
Find Duplicate Subtrees - Leetcode 652 - Python
NeetCodeIO
Sort an Array - Leetcode 912 - Python
NeetCodeIO
Ones and Zeroes - Leetcode 474 - Python
NeetCodeIO
Remove Duplicates from Sorted Array II - Leetcode 80 - Python
NeetCodeIO
Maximum Twin Sum of a Linked List - Leetcode 2130 - Python
NeetCodeIO
Concatenation of Array - Leetcode 1929 - Python
NeetCodeIO
Symmetric Tree - Leetcode 101 - Python
NeetCodeIO
Check Completeness of a Binary Tree - Leetcode 958 - Python
NeetCodeIO
Construct Binary Tree from Inorder and Postorder Traversal - Leetcode 106 - Python
NeetCodeIO
Find Peak Element - Leetcode 162 - Python
NeetCodeIO
Accounts Merge - Leetcode 721 - Python
NeetCodeIO
Binary Tree Preorder Traversal (Iterative) - Leetcode 144 - Python
NeetCodeIO
Binary Tree Postorder Traversal (Iterative) - Leetcode 145 - Python
NeetCodeIO
Number of Zero-Filled Subarrays - Leetcode 2348 - Python
NeetCodeIO
Minimum Score of a Path Between Two Cities - Leetcode 2492 - Python
NeetCodeIO
Sqrt(x) - Leetcode 69 - Python
NeetCodeIO
Successful Pairs of Spells and Potions - Leetcode 2300 - Python
NeetCodeIO
Optimal Partition of String - Leetcode 2405 - Python
NeetCodeIO
More on: Systems Design Basics
View skill →Related Reads
📰
📰
📰
📰
Morris Pre Order Traversal
Dev.to · Jaspreet singh
Advanced Stack ApplicationsData Structures and Algorithms Deep‑Dive — Advanced Stack Applications…
Medium · Programming
The Minecraft anvil is a tree-cost optimization problem in disguise
Dev.to · Mark
KMP Algorithm (Knuth-Morris-Pratt): The Smart Way to Perform String Matching in O(N)
Dev.to · Jaspreet singh
🎓
Tutor Explanation
DeepCamp AI