SurveyMonkey Senior Devops 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 happens when you search "google.com"?
Ans. 
When you search 'google.com', it will redirect you to the Google homepage.
• Typing 'google.com' in the browser's address bar will take you to the Google search engine homepage.

• You can also directly search for 'google.com' in the Google search bar to access the Google homepage.

• Google.com is the domain name for the Google search engine.

• Google.com may also redirect to localized versions of Google based on the user's locatio
Answered by AI
Add your answer
Q2. Traceroute in Linux
Ans. 
traceroute is a command-line tool used to trace the route that packets take from your computer to a destination server.
• traceroute command is used to track the path that packets take to reach a destination server

• It shows the IP addresses of the routers that the packets pass through

• It also displays the round-trip time for each hop

• Example: traceroute google.com
Answered by AI
Add your answer

Q1. Had like 5 more rounds all around leadership principles. Also multiple Linux questions.
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

45 min round. Similar to Leetcode medium level question.

45 min coding round, 2 question asked

Q1. System design of proximity service
Ans. 
Design a system for proximity service
• Utilize geolocation data to track user locations

• Implement algorithms to calculate proximity between users

• Use real-time updates to notify users of nearby contacts
Answered by AI
Add your answer

Q1. Behavioral questions
Add your answer

Given an simple gaming questions to be developed in JS

Given another UI design in image to be developed

Q1. About docker and kubernetes basic questions only,
Add your answer
Q2. Roles and responsibilities in current organization
Add your answer

They given 2 program to to 1-2 hour

Q1. Ask basic programming questions
Add your answer

Asked medium level graph question.

Asked LLD question with at flow executable.

Q1. Asked HLD questions.
Add your answer