Envié una solicitud electrónica. El proceso duró 6 semanas. Acudí a una entrevista en Amazon (Seattle, WA) en nov 2013
Entrevista
Applied for the Silk team via their website. Got a call within 2 weeks. There were a few clashes in the dates as my wife was going to deliver during that period, but they very kindly rescheduled.
I had 2 phone screens and was then called to Seattle for full-day interviews. Phone screen was done using collabedit tool, and on-site interview required writing code on white-board.
1st Phone screen: Write a power function. All edge cases like overflow, different values of powers (+ve, -ve, zero) need to be handled. Have to give most efficient solutions.
2nd Phone screen: Write a function that, given an array and a number as input, finds all pairs in the array that add up to that number. Number can be +ve/-ve. Write most space (or) time efficient algorithm. How will it handle duplicate pairs.
On-site interviews:
1. Given a 2D array (which has initially all false values), fill it up with 'X' true values placed randomly in it (like minesweeper game). Most efficient alog expected with handling of ALL edge cases.
2. Implement a simple contacts application in which one can search via First name. Most efficient alog expected with handling of ALL edge cases.
3. Bar-raiser: Given a log file from a website which contains the user ID and the accessed URL, find the TOP "sequence" of 3 urls amongst ALL visitors of the website. The sequence of urls have to be in sequence as they are accessed.
4. Experience related questions by Team manager over lunch.
5. Implement classes for a website that can be used for building your own computer. Eg: If a user selects a motherboard, it should filter out all the incompatible CPUs etc. You have to implement various classes that can be used for implementing this functionality.
Preguntas de entrevista [1]
Pregunta 1
Bar-raiser was difficult and unexpected (to me) as I'm from embedded application dev background and haven't dealt with such scenario's.
Surprisingly easy — I expected tougher questions, but the coding round felt more like a warm-up. The main challenge was a DSA problem about counting islands in a 2D grid, which led to a discussion on DFS versus BFS and handling large grids. Funny enough, I had revisited that exact type of question while prepping on PracHub, which made me feel more confident. The interview wrapped up with a behavioral round, and I accepted an offer, but ultimately decided to decline it for another opportunity. Overall, it was a smooth experience.
Preguntas de entrevista [1]
Pregunta 1
Number of Islands — given a 2D grid of '1's (land) and '0's (water), count the number of connected islands. Walk through DFS vs BFS, and discuss how to avoid revisiting cells (in-place mutation vs visited set) and what changes if the grid is huge and must stream from disk.
It started with an OA, and then after a few weeks, I got invited to four rounds of interviews: technical and behavioral at 3 of the 4, and behavioral only at one.
Um teste de código online, se aprovado, vai para o loop. O loop é 4 entrevistas seguidas, duas em inglês e duas em português. 3 entrevistas técnicas de código, todas as 4 têm pergunta de liderança.
Preguntas de entrevista [1]
Pregunta 1
Pergunta historicas baseada nos principios de lideranca da amazon.
