I applied through a recruiter. The process took 1 day. I interviewed at Amazon (Sunnyvale, CA) in Apr 2022
Interview
Rec reached out to me and asked if I could take an online assessment. I tried an assessment and could not pass. I was asked 2 question. So the process was stopped.
Interview questions [1]
Question 1
Minimum spanning tree
and another graph related problem
I applied through a recruiter. I interviewed at Amazon (Seattle, WA) in Jan 2021
Interview
1. Initial phone screening by Amazon recruiter
2. Online assessment: 2 medium leetcode tasks (45 min for each) + 1hour behavioral questions.
3. Phone screening with online code pad session (I got a hard leetcode.com question)
4. Final round: 5 video "onsite" interviews (1 hour each). 2 coding questions (easy-medium level); test strategy for a new feature; test plan for a new feature/app; a ton of Amazon Leadership Principles questions (80% of time).
Interview questions [1]
Question 1
Leadership Principles: tell me about the time when you {have not full info; have not enough time; have a conflict; disagree with your manager; etc}?
I interviewed at Amazon (Dublín, Dublín) in Dec 2020
Interview
A recruiter contacted me over LinkedIn. Gave me a link to complete an assessment test in HackerRank of two problems. The difficulty level of problems is medium to hard according to Leetcode problems. More likely problem B, C of Codeforces div 2 contest problems. After about a week the recruiter took an interview of about one hour long, asking about my previous works, leadership principle-related questions to test the relevancy of my working style with those principles. Finally, she asked some short questions based on algorithms and data structure. She wasn't a technical person, seems she was writing my answers. After two days I got the rejection mail.
Interview questions [1]
Question 1
1. What is the complexity of the best sorting algorithm?
2. How does the hash table handle confliction?
3. Delete a node from a binary tree.
4. Disadvantage of hash table.
5. BFS vs DFS with complexity.
6.