At Amazon, our delivery route optimization often involves tree-like structures. Here's an interesting problem that reflects similar patterns: Given a binary tree where: Each node contains a single digit (0-9) Each path from root to leaf represents a number For example: path 4+2+1 represents number 421 Write a function to compute the sum of all numbers represented by root-to-leaf paths. Input: root - [1,2,3] 1 2 3 Output: 25 Input: root - [4,9,0,5,1] Output: 1026 4 9. 0 5. 1
tell me about yourself time you took responsibility outside your own work
what techincal problem have you faced and solved?
Simplified version of LC 937. Reorder Data in Log Files
1st questions was a bfs question and the other one was a question stack or implementation based question
Describe a time I was involved in a conflict and how I dealt with the situation.
Fundamentals of object oriented programming and data structure question.
A scheduling problem. Very similar to question 253 on leetcode.
basic concepts of DBMS, os, CN, Software Engineering, and 1 coding question : find pair with max product
They were keen on understanding my past experiences and how it translates to real world problem solving capabilities.
Viewing 2861 - 2870 interview questions