SurveyMonkey Senior Devops Engineer Interview Questions and Answers

Q1. Prefer not to due to NDA
Add your answer

Brush up on DS and Algorithms

Q1. Minimum Knight Moves (LC Medium)
Add your answer
Q2. OS, CN, DB concepts like multithreading, semaphore, tcp vs udp, transaction and ACId properties. Java concepts like stack vs heap(memory), error vs exception. Any 1 Project discussion for 10 mins
Add your answer

Q1. Hiring manager round
Add your answer
Q2. Questions on previous projects
Add your answer

Q1. Longest subsequence with sum zero
Ans. 
Find the longest subsequence in an array with sum zero.
• Iterate through the array and keep track of the running sum.

• Store the running sum in a hashmap along with the index.

• If the same sum is encountered again, the subsequence between the two indices has a sum of zero.
Answered by AI
Add your answer
Q2. Find diameter of tree
Ans. 
The diameter of a tree is the longest path between two leaf nodes in the tree.
• Calculate the longest path between two leaf nodes in the tree

• This can be done by finding the height of the left and right subtrees and adding them together

• The diameter of the tree is the maximum of either the diameter of the left subtree, the diameter of the right subtree, or the sum of the heights of the left and right subtrees
Answered by AI
Add your answer

Q1. System design: Hotel booking system
Ans. 
Design a hotel booking system for managing reservations and availability.
• Use a database to store hotel information, room availability, and reservations.

• Implement user authentication and authorization for booking.

• Include a search feature for users to find available rooms based on their criteria.

• Allow users to make reservations, modify or cancel them.

• Send confirmation emails to users after successful bookings.
Answered by AI
Add your answer

Divide one big integer by another

Q1. What is ACID in DBs ?
Ans. 
ACID stands for Atomicity, Consistency, Isolation, and Durability in databases.
• Atomicity ensures that all operations in a transaction are completed successfully or none at all.

• Consistency ensures that the database remains in a consistent state before and after the transaction.

• Isolation ensures that multiple transactions can be executed concurrently without affecting each other.

• Durability ensures that once a transaction...read more
Answered by AI
Add your answer
Q2. What is the difference in checked and unchecked exceptions ?
Ans. 
Checked exceptions are checked at compile time while unchecked exceptions are not checked at compile time.
• Checked exceptions are subclasses of Exception class except RuntimeException and its subclasses.

• Unchecked exceptions are subclasses of RuntimeException and Error classes.

• Checked exceptions must be caught or declared in the method signature using 'throws' keyword.

• Unchecked exceptions do not need to be caught or decl...read more
Answered by AI
Add your answer
Q3. Find the min difference between any two integers of 2 sorted list
Ans. 
To find the minimum difference between any two integers of 2 sorted lists, iterate through both lists simultaneously and keep track of the minimum difference.
• Iterate through both sorted lists simultaneously

• Keep track of the minimum difference found so far

• Update the minimum difference if a smaller difference is found
Answered by AI
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

Solve sudoku, row and columns should have 1-9 numbers and the numbers shouldnt repeat

Q1. What is the toughest problem you solved and once I answered they started digging in to it
Add your answer

Q1. System Design - Design a parking lot
Ans. 
Design a parking lot system with features like parking, retrieving, and tracking available spots.
• Create a ParkingLot class with attributes like total number of spots, available spots, and a list of parked vehicles.

• Implement methods for parking a vehicle, retrieving a vehicle, and tracking available spots.

• Use data structures like arrays or lists to manage parked vehicles and available spots.

• Consider implementing feature...read more
Answered by AI
Add your answer

Q1. Several questions related to behavioral and troubleshooting
Add your answer

Implement boolean canConstruct(String targetString, String[] dict) which returns true if we can construct the targetString by concatenating the words given in the dictionary

Q1. Implement key value store
Ans. 
Implement a key value store for storing and retrieving data efficiently.
• Use a hash table or a balanced tree data structure to store key-value pairs.

• Implement functions for inserting, updating, deleting, and retrieving key-value pairs.

• Consider implementing features like transactions, concurrency control, and data persistence.

• Example: Implement a simple key value store using a hash table in Python.
Answered by AI
Add your answer

Q1. 1. Questions around projects : JWT, UserAuthentication etc
Add your answer
Q2. 2. Write a code to find frequency of characters in a given string?
Ans. 
Code to find frequency of characters in a given string
• Use a hash table to store character frequencies

• Iterate through the string and update the hash table accordingly

• Print the hash table to display the character frequencies
Answered by AI
Add your answer

Q1. 1. Write a code to reverse a linked list?
Ans. 
Code to reverse a linked list
• Create three pointers: prev, curr, and next

• Initialize prev to null and curr to head

• Loop through the list and set next to curr's next node

• Set curr's next node to prev

• Move prev and curr one node ahead

• Return prev as the new head
Answered by AI
Add your answer
Q2. 2. Write a code to reverse linked list in size of K?
Ans. 
Code to reverse linked list in size of K
• Create a function that takes head of linked list and size K as input

• Traverse the linked list in groups of K nodes

• Reverse each group of K nodes using iterative or recursive approach

• Connect the reversed groups to form the final linked list

• Return the new head of the reversed linked list
Answered by AI
Add your answer
Q3. 3. Questions around project and design a database structure for comments system of quora?
Add your answer

Q1. Basic HR round questions
Add your answer