AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
i
SurveyMonkey
Compare
Filter interviews by
SurveyMonkey Interview Questions and Answers
SurveyMonkey Interview Experiences
4 interviews found
Anonymous
I applied via LinkedIn and was interviewed in Aug 2024. There was 1 interview round.
(3 Questions)
- Q1. Longest non-repeating substring
- Ans.
Find the longest substring without any repeating characters
Use a sliding window approach to track the longest substring without repeating characters
Keep track of the characters seen so far in a set to quickly check for repeats
Update the start index of the window when a repeat is found
- Q2. React basics, Virtual DOM, Pure Components, useMemo,
- Q3. Build a component to display concentric circles
- Ans.
Create a component to display concentric circles
Use HTML canvas element to draw circles
Calculate the radius and position of each circle
Use CSS for styling and positioning if needed
Skills evaluated in this interview
Senior Front end Developer Interview Questions asked at other Companies
I applied via Company Website and was interviewed in Oct 2024. There was 1 interview round.
(2 Questions)
- Q1. Python code to calculate the sum
- Ans.
Python code to calculate the sum of elements in a list
Use the built-in sum() function in Python to calculate the sum of elements in a list
Create a list of numbers and pass it as an argument to the sum() function
Example: numbers = [1, 2, 3, 4, 5] total = sum(numbers) print(total)
- Q2. Terraform code debug and analysis
Skills evaluated in this interview
Senior Devops Engineer Interview Questions asked at other Companies
Aquib Kadri
(1 Question)
- Q1. React/JS fundamentals
Senior Front end Developer Interview Questions asked at other Companies
(1 Question)
- Q1. Technical questions, coding questions, design related questions.
Senior Software Engineer 2 Interview Questions asked at other Companies
SurveyMonkey interview questions for popular designations
Jobs at SurveyMonkey
Interview questions from similar companies
SAMKIT JAIN
I appeared for an interview in Aug 2017.
Interview Questionnaire
7 Questions
- Q1. Implement Merge Sort.
- Ans.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
- Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
- Ans.
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
- Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
- Ans.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
- Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
- Ans.
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
- Q5. Implement AVL Tree.
- Ans.
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
- Q6. Minimum number of squares whose sum equals to given number n.
- Ans.
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
- Q7. Insertion sort for a singly linked list.
- Ans.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
Interview Preparation Tips
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22
Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.
Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.
College Name: The LNM Institute Of Information Technology, Jaipur
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
There was 2 coding questions
Based on ds and algorithms
- Q1.
Ninja's Pattern with Powers of 2
Ninja, who loves playing with numbers, sets out to arrange numbers within 'N' rows. The unique arrangement follows these rules: the first row contains 1 number, the second...
- Ans.
Generate a pattern of numbers in rows following a specific sequence based on powers of 2.
Start with 1 number in the first row, 2 numbers in the second row, 4 numbers in the third row, and so on based on powers of 2.
Fill the pattern with numbers in increasing sequence from 1 to 9, recycling back to 1 after reaching 9.
Output the pattern for a given number 'N' of rows.
Example: For N = 4, the pattern would be 1, 23, 4567,
- Q2.
Validate Binary Search Tree (BST)
You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).
BST Definition:
A Binary Search Tr...
- Ans.
Validate if a given binary tree is a Binary Search Tree (BST) or not.
Check if the left subtree of a node contains only nodes with data less than the node's data.
Check if the right subtree of a node contains only nodes with data greater than the node's data.
Recursively check if both the left and right subtrees are also binary search trees.
Example: For a node with data 4, left subtree nodes (2, 1, 3) are smaller and righ
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
There was 2 coding questions based on ds and algorithms
- Q1.
Zig-Zag Array Rearrangement
You are provided with an array of distinct elements, and your task is to rearrange the array elements in a zig-zag manner. Specifically, for every odd index
i, the elementARR[... - Ans.
Rearrange array elements in a zig-zag manner where every odd index element is greater than its neighbors.
Iterate through the array and swap elements to satisfy the zig-zag condition.
Ensure that for every odd index i, ARR[i] > ARR[i-1] and ARR[i] > ARR[i+1].
Multiple correct answers may exist for a given array.
- Q2.
Flatten a Linked List
You are provided with a linked list of 'N' nodes. Each node contains two pointers:
NEXT, pointing to the next node in the list, andCHILD, pointing to a linked list. Each child linke... - Ans.
Flatten a linked list of sorted child linked lists into a single sorted linked list.
Traverse the linked list and maintain a priority queue to keep track of the next smallest element.
Merge the child linked lists into the priority queue while traversing the main linked list.
Pop elements from the priority queue to create the final flattened linked list.
(1 Question)
Round duration - 45 Minutes
Round difficulty - Medium
My interview started at 9:30 and it took around 45 minutes to complete my interview.This was held on Amazon Chime and the interview lasted for 1 hour. Firstly the interviewer asked to introduce about myself, later asked regarding the projects I have mentioned in my resume. Then started displaying the coding question. The first question is number of islands in a matrix.
- Q1.
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having
Nrows andMcolumns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t... - Ans.
Count the number of islands in a 2D matrix of 1s and 0s.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.
Maintain a visited array to keep track of visited cells to avoid redundant traversal.
Increment the island count each time a new island is encountered.
Consider edge cases like when the matrix is empty or all cells are water (0s).
Interview Preparation Tips
Tip 1 : Be enough confident, don't be nervous. Maintain atleast 2 projects in your resume.
Tip 2 : You should be able to answer each and every thing present in your resume. Don't lie in your resume.
Tip 3 : Prepare Data Structures and Algorithms well. They mostly check our Problem Solving ability to find the solutions for the real world problems
Tip 1 : Mention your skills in which you are perfect
Tip 2 : Mention atleast two projects
Skills evaluated in this interview
I applied via Referral and was interviewed in Mar 2020. There were 5 interview rounds.
Interview Questionnaire
1 Question
- Q1. Previous work profile details like TAT, Quality and production rate, initiative taken for process development, about the profile applied for and few general questions.
Interview Preparation Tips
2) Give details about your Previous job in a simple way so that they can understand
3) Don’t lie
4) Be optimistic
I applied via Referral and was interviewed before Apr 2021. There were 3 interview rounds.
(3 Questions)
- Q1. Why are you looking for a change?
- Q2. Tell me about yourself.
- Q3. Why should we hire you?
Basic sql
(1 Question)
- Q1. Project manager round
Interview Preparation Tips
I applied via Company Website and was interviewed in Oct 2020. There was 1 interview round.
Interview Questionnaire
2 Questions
- Q1. I went as a fresher for the job. They asked me technical skills and good cummication skills.
- Q2. I am interested to do in it
Interview Preparation Tips
I am pursuing my graduation final year (bcom
Computer)
I have technical skills and good at computer knowledge
I have good cummication skills
Thanking you
Yours careingly
I applied via Company Website and was interviewed in May 2021. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. General knowledge question
Interview Preparation Tips
SurveyMonkey Interview FAQs
Tell us how to improve this page.
Interview Questions for Popular Designations
SurveyMonkey Interview Process
based on 4 interviews
Interview experience
Interview Questions from Similar Companies
Bangalore / Bengaluru
21-31 Yrs
Not Disclosed
Bangalore / Bengaluru
21-31 Yrs
Not Disclosed
|
Senior Software Engineer
4
salaries
|  ₹29 L/yr - ₹48.2 L/yr |
|
Senior Software Engineer 1
4
salaries
| ₹32 L/yr - ₹39.4 L/yr |
Amazon
Uber
Fareportal
OLX
- Home >
- Interviews >
- SurveyMonkey Interview Questions
