I applied through college or university. The process took 1 day. I interviewed at Amazon (Neu-Delhi) in Nov 2017
Interview
First round of online coding, followed by an interview from the panel. The online round was fairly easy and the interview followed was easy too - but it was just that the interviewers were cold!
Interview questions [1]
Question 1
Given a binary tree. Print all paths from root to any node where the sum is zero.
I applied through a recruiter. The process took 2 weeks. I interviewed at Amazon (Cal Poly SLO, CA)
Interview
Spoke with campus recruiter and received phone/computer interview. They had you log in to a website where they asked you to code in sudo or your language choice. Wanted answers quickly.
Interview questions [1]
Question 1
Describe the functionality of a binary search tree.
I applied through college or university. I interviewed at Amazon (Neu-Delhi) in Sep 2017
Interview
It consists of 20 MCQs and two coding questions and MCQs got the negative marking . One for the correct answer and -0.25 for each wrong answer.
1.Given a string. Find all the palindromic partitions of the string. (Number of way the string can be partitioned so that all the partitions are palindrome) ( Case–Insensitive )
Interview questions [1]
Question 1
You are given with a large paragraph and N words.You have to find a min length subparagraph of the paragraph which contain all those N words in any order.(Case Insensitive)