Amazon SDE-2 Interview Questions, Process, and Tips

2 coding questions

Q1. Ds algo round 2 medium questions
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

Q1. 
Balanced Parentheses Combinations
Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Explanati...read more
Ans. 
Generate all possible combinations of balanced parentheses for a given number of pairs.
• Use recursion to generate all possible combinations of balanced parentheses.

• Keep track of the number of open and close parentheses used in each combination.

• Terminate recursion when the number of open and close parentheses used equals the given number of pairs.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

Q1. 
Boundary Traversal of Binary Tree Problem Statement
You are given a binary tree of integers. Your task is to print the boundary nodes of this binary tree in an anti-clockwise direction starting from the ro...read more
Ans. 
Print the boundary nodes of a binary tree in an anti-clockwise direction starting from the root node.
• Traverse the left boundary nodes from top to bottom

• Traverse the leaf nodes from left to right

• Traverse the right boundary nodes from bottom to top

• Handle cases where nodes are null (-1)

• Print the boundary nodes in the specified order
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

Q1. 
Bottom View of Binary Tree Problem Statement
Given a binary tree, the task is to print its bottom view from left to right. Assume the left and the right child nodes make a 45-degree angle with their paren...read more
Ans. 
The task is to print the bottom view of a binary tree from left to right.
• Traverse the binary tree in level order and keep track of the horizontal distance of each node from the root.

• For each horizontal distance, update the node value in a map to get the bottom view nodes.

• Print the values of the map in sorted order of horizontal distance to get the bottom view sequence.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

Bar raiser

Q1. Can you design a parking lot using low-level design (LLD) and a tiny URL service using high-level design (HLD)?
Ans. 
Yes, I can design a parking lot using LLD and a tiny URL service using HLD.
• For designing a parking lot using LLD, we can create classes like ParkingLot, ParkingSpot, Vehicle, etc. with their respective attributes and methods.

• For designing a tiny URL service using HLD, we can focus on scalability, fault tolerance, and performance. We can use techniques like sharding, caching, load balancing, etc.

• In the parking lot LLD, ...read more
Answered by AI
Add your answer