Amazon Software Engineer

Solve the rainwater harvesting problem from LeetCode and determine if all leaf nodes are at the same level in a binary tree.

Solve one hard and one medium difficulty algorithm problem—one involving digit dynamic programming and the other using breadth-first search—and write clean code with relevant variable names on a different coding platform.

Solve problems similar to Rotten Oranges and Burning Tree, as well as a matrix question.

The interviewer introduced himself, asked me for my introduction, and then gave me two data structure and algorithm problems: finding the k closest elements and generating all valid parentheses; I solved both but missed some edge cases he pointed out after I dry ran the code.

Find the k closest elements and generate all valid parentheses combinations.

Solve the LeetCode problem of merging k sorted lists.

Design an in-memory file system that supports the operations ls, mkdir, addContentToFile, and readContentFromFile.

Merge two linked lists into a single sorted linked list.

How do you merge k sorted lists into one sorted list?

Implement an LRU cache and be prepared to answer follow-up questions about it.