Coupang Senior Software Engineer Interview Questions and Answers

Q1. Print the nodes of a n-ary tree in an arc wise manner as seen from the outside.
Ans. 
Print nodes of n-ary tree in arc wise manner from outside
• Traverse the tree level by level from outside to inside

• Use a queue to keep track of nodes at each level

• Print the nodes at each level in a clockwise or anticlockwise manner
Answered by AI
Add your answer

Q1. What is react, and why you chose it
Ans. 
React is a JavaScript library for building user interfaces, known for its efficiency and flexibility.
• React allows for the creation of reusable UI components, making development faster and more efficient.

• It uses a virtual DOM for optimal performance by only updating the necessary components when data changes.

• React's component-based architecture promotes code reusability and maintainability.

• It has a large and active comm...read more
Answered by AI
Add your answer

Q1. Coding and behavioral questions
Add your answer

Q1. Node JS internal
Add your answer
Q2. Previous project discussion
Add your answer

Q1. Design hld interview asked question
Add your answer
Q2. Design lld asked question
Add your answer

Online coding test had two questions to be solved in 60 mins. Medium level questions to be expected.

Q1. Codility test: Moderate level machine coding round, not leetcode type. Deep understanding of interface and backend knowledge required. Interviewer was absolutely uninterested.
Add your answer

Q1. General Discussion + 1 coding question
Add your answer

Q1. Given array of integer create subarray with sum = 0
Ans. 
Create subarrays with sum = 0 from given array of integers.
• Iterate through the array and keep track of the running sum.

• Store the running sum in a hashmap and check if the current sum - any previous sum equals 0.

• If yes, then the subarray between those two indices has a sum of 0.
Answered by AI
Add your answer
Q2. Left view of binary tree
Ans. 
The left view of a binary tree is the set of nodes visible when the tree is viewed from the left side.
• Traverse the tree in a level order manner and keep track of the first node at each level.

• Use a queue to store nodes at each level and update the left view nodes accordingly.

• Example: For a binary tree with root node 1, left child 2, and right child 3, the left view would be [1, 2].
Answered by AI
Add your answer