Candidatei-me por meio de uma faculdade ou universidade. O processo levou 5 dias. Fui entrevistado pela Amazon (College Park, MD) em mar. de 2013
Entrevista
Face to Face Interview on campus.
Got an interveiw call after my Resume was shortlisted.
Perguntas de entrevista [1]
Pergunta 1
Just one question:
Make a function to determine if the the tree is symmetric or not.
Various questions asked in between while I was making the code and logic. Language to write was at preference. I chose C. 45 minute interview. Pretty Intense.
I had 3 45 min interviews with software engineers over video calls. One of them asked me to code but the rest asked about my experience working wiht peers and overcoming problems
Perguntas de entrevista [1]
Pergunta 1
One of the engineers asked what data structure I would use to search and allocate memory of a given size
Candidatei-me online. O processo levou 1 semana. Fui entrevistado pela Amazon (Guadalajara, Jalisco) em out. de 2025
Entrevista
Coding interview; one medium to hard leetcode-style question + one technical/design real-world question where the goal is to create a robust solution with good practices, it isn't focused on efficiency.
Fiz uma entrevista na empresa Amazon (Tel Aviv-Yafo).
Entrevista
The first level of the hiring process is a online assessment which includes two questions of hard liquid style questions and a survey I felt that the questions were very hard I only started answering one question I had 45 minutes for the question was a question regarding lists and two away lists and x finding a number of elements within a list and giving back the biggest ones of the list
Perguntas de entrevista [1]
Pergunta 1
Given a 2d list and a list and a x example to the list contains three lists of size 3 list contains three elements and x is 2 list and index one is one so give back the biggest one element from to the list and the next one index 2 is 2 so give me back two of the biggest in the to the array and so forth and then if x is 2 so give me the sum of two biggest nuns if cannot be done return minus one