- Phone screen: Variation of Meeting Rooms II - Round 1: Combination of Insert and Merge Intervals - Round 2: Min Stack - Round 3: Don’t recall, but it was a LC Easy/Medium - Round 4: System Design - Build a recommendation system based on users Amazon shopping history
Conflict with a customer etc
Coding problem on graph data structure.
Literalmente se vc pesquisar no google e estudar as perguntas que fazem na Amazon, você vai estar bem preparado.
Given an array of lockers (0 = empty, 1 = occupied), find the maximum distance to the nearest 1. Modify the problem to place k packages instead of one, maximizing the minimum distance. Follow-up: Optimize for O(1) space complexity and reduce O(n log n) sorting overhead.
2 Hard LeetCode questions and 1 Medium: https://leetcode.com/problems/trapping-rain-water/ https://leetcode.com/problems/top-k-frequent-words/ https://leetcode.com/problems/integer-to-english-words/
one of the question on OA was Rotating the Box from LeetCode. Link: https://leetcode.com/problems/rotating-the-box/description/
Design an online bookstore, with separate entity for authors and books.
Design software for wending machine.
Give me an example of a complex problem you solved with a simple solution.
Viewing 2161 - 2170 interview questions