Everyone is really nice, the work-life balance is great, and there are amazing perks!
Honestly, I don't really have complaints.
1. Ask the problem and solution of my previous project. 2. Introduce one of my favorite course projects. 3. Explain Binary Search Tree. 4. Find the next larger node and write down code in BST. 5. Check whether a string is symmetric and how to tes
Intermediate (some tough) questions about algorithms, memory usage, and system scalability.
Phone screening - Scheduled for 45 minutes. 2 questions. 1. Simple array addition. 2. Divide and conquer. Answered both correctly within 25 minutes. Still trying to understand why I was rejected. No reason given!
1. Ask the problem and solution of my previous project. 2. Introduce one of my favorite course projects. 3. Explain Binary Search Tree. 4. Find the next larger node and write down code in BST. 5. Check whether a string is symmetric and how to tes
Intermediate (some tough) questions about algorithms, memory usage, and system scalability.
Phone screening - Scheduled for 45 minutes. 2 questions. 1. Simple array addition. 2. Divide and conquer. Answered both correctly within 25 minutes. Still trying to understand why I was rejected. No reason given!