about insertion time complexity in HASMAPS
Development Intern Interview Questions
5,454 development intern interview questions shared by candidates
They asked about DSA questions and the LPs
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
Algorithm and problem solving question about strings
Write the function to decide if two dates are within 30 days or more.
They asked about how I would design a dictionary using data structures.
Test if a link list is a cycle.
The first interviewer asked me two questions: store each level of a binary tree in its own list. The other was a simple dynamic programming problem that requires some context The second interviewer was content with asking me one question about the shortest distance between two words in a document (word index).
Nothing unexpected.
BFS questions
Viewing 5331 - 5340 interview questions