Groupon SDE-2 Interview Questions and Answers

Q1. Data Structures and Algorithms
Add your answer

Q1. Machine Coding round
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It was a telephonic interview at 10 in the morning. Interviewer seemed cool.

Q1. 
Best Insert Position for a Target in a Sorted Array
You are provided with a sorted array A of length N consisting of distinct integers and a target integer M. Your task is to determine the position where ...read more
Ans. Brute Force
• Iterate through the given array.
  • If at any position i, we get A[i] ≥ M, return i.
• If there is no such position i, return N.
Space Complexity: O(1)Explanation:
O(1).
 
As there is no extra space required.
Time Complexity: O(n)Explanation:
O(N), where ‘N’ is the length of the given array.
 
We are traversing the array only once. Hence, the overall complexity is O(N).
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The interview was in the morning at 10 AM in the office meeting room.

Q1. 
House Robber Problem Statement
Mr. X is a professional robber with a plan to rob houses arranged in a circular street. Each house has a certain amount of money hidden, separated by a security system that ...read more
Ans. 
Didn't get enough time to code the solution but explained the approach
We can do this using DP
We can maintain 2 arrays - one represents the ans if we start from first house and the other represents the answer if we start. from the second house.Then simply looping over the array and calculating these array's elements.
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The interview was at 11 AM in the meeting office.

Q1. 
Running Median Problem
Given a stream of integers, calculate and print the median after each new integer is added to the stream.
Output only the integer part of the median.
Example:
Input:
N = 5  
Stre...read more
Ans. 
Started with the brute force solution of insertion sort
Interviewer asked to optimize.
Gave the solution which uses two heaps - max heap and min heap. the difference in size of both heaps cannot be more than 1. And we might need to remove elements from one heap to other heap as more input numbers are added
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The interview was at 1 AM.

Round duration - 60 minutes
Round difficulty - Easy

The meeting was at 2 PM in the office meeting room.

Round duration - 60 minutes
Round difficulty - Easy

10 AM

Q1. Can you provide a deeper discussion about all the projects you completed in your previous company?
Ans. 
Tip 1: Know well about the projects that you have done in the past

 
Answered Anonymously
Add your answer

There were 2 questions in coding one with array and in string releated

Q1. About Selenium questions
Add your answer
Q2. Other basic questions related to testing
Add your answer
Q3. Management related question
Add your answer

Q1. One program to solve
Add your answer
Q2. Other questions in selenium
Add your answer

Easy Interview basic questions

Q1. Desing Tic Tac Toe
Add your answer

Q1. Final Round behavioural questions
Add your answer

Q1. Write a program on stack operations
Ans. 
A program for stack operations
• Create a stack using an array or linked list

• Implement push() and pop() functions

• Check for stack overflow and underflow

• Implement peek() function to view top element

• Example: stack.push(5), stack.pop(), stack.peek()
Answered by AI
Add your answer

1 hour round, DSA questions on stacks and hash maps

1 hr round, DSA Q's and Puzzle

Q1. Data structure related question
Add your answer

Q1. Nodejs related questions
Add your answer
Q2. Promises Async Await Events emitter
Ans. 
Promises, async/await, and event emitters are all ways to handle asynchronous operations in JavaScript.
• Promises provide a way to handle asynchronous operations by returning a promise object that can be resolved or rejected.

• Async/await is a syntax for working with promises that makes code easier to read and write.

• Event emitters allow you to create custom events that can be triggered and listened for in your code.
Answered by AI
Add your answer

Q1. System design related question
Add your answer
Q2. Design a system like facebook
Ans. 
Design a system like Facebook
• Create a user registration and login system

• Implement a news feed for users to see updates from friends

• Allow users to create and join groups

• Include features like messaging, commenting, and liking posts

• Implement privacy settings for users to control who can see their content
Answered by AI
Add your answer

Q1. System design and behavioral
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

- It was a face to face (virtually) round.
- Two questions one after one and you are expected to pass all the test cases.
- Question was Easy and Medium Easy. (tags: stack, array, bfs, dfs, array)

- Timing: Afternoon
- Interviewer: he was nice, as I was able to solve both question, he was very happy, and given me the feedback.

Q1. 
Remove Consecutive Duplicates from String
Given a string STR consisting of both lower and upper case characters, your task is to remove consecutive duplicate characters and return the newly formed string.
...read more
Ans. 
The task is to remove consecutive duplicate characters from a given string and return the new string.
• Iterate through the characters of the string

• Compare each character with the next character

• If they are the same, skip the next character

• If they are different, append the current character to the new string
Answered by AI
Add your answer
Q2. 
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...read more
Ans. 
The task is to find the number of islands present in a 2-dimensional array filled with ones and zeroes.
• Iterate through each cell in the array

• If the cell is land (1) and not visited, perform a depth-first search to find all connected land cells

• Increment the count of islands for each connected component found
Answered by AI
Add your answer

Round duration - 135 minutes
Round difficulty - Medium

Machine Coding.

Timing: Afternoon
The interviewer was answering my questions nicely.

Round duration - 60 minutes
Round difficulty - Medium

Hiring Manager.
Interviewer: Sr Engineering Manager.
Timing: evening.

The environment was cool.