AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Groupon
Compare
Filter interviews by
Clear (1)
Groupon SDE-2 Interview Questions and Answers
Groupon SDE-2 Interview Experiences
1 interview found
Anonymous
I was interviewed in Nov 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
The first round was a coding round. 2 DSA based questions were asked.
- Q1.
Maximum Meetings Problem Statement
Given the schedule of N meetings with their start time
Start[i]and end timeEnd[i], you need to determine which meetings can be organized in a single meeting room such ... - Ans.
Given N meetings with start and end times, determine which meetings can be organized in a single room to maximize the number of meetings.
Sort the meetings based on their end times.
Iterate through the sorted meetings and select the first meeting that does not overlap with the previous one.
Repeat the process until all meetings are considered.
Return the selected meetings in the order they are organized.
- Q2.
Peak Element Finder
For a given array of integers
arr, identify the peak element. A peak element is an element that is greater than its neighboring elements. Specifically, ifarr[i]is the peak, then both... - Ans.
Find the peak element in an array of integers.
Iterate through the array and check if the current element is greater than its neighbors.
Handle edge cases for the first and last elements of the array.
Return the peak element found.
Round duration - 45 minutes
Round difficulty - Medium
The second round was a system design round.
Round duration - 30 minutes
Round difficulty - Easy
This was a typical managerial round.
Interview Preparation Tips
Tip 1 : Prepare coding questions on Arrays as much as possible. and go through few videos to design few daily use applications like Stackoverflow, Whatsapp, Instagram etc.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Rate your
company
🤫 100% anonymous
How was your last interview experience?
Top trending discussions
Interview questions from similar companies
I was interviewed in Jun 2021.
(2 Questions)
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
...STRconsisting of both lower and upper case characters, your task is to remove consecutive duplicate characters and return the newly formed string. - 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
- Q2.
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.
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
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.
Interview Preparation Tips
Tip 1 : Stick to one coding platform either do it from geeks for geeks, coding ninja or leetcode. Never jump from one platform to other. Focus on Building the concept rather than solving it.
Tip 2 : Follow the Grooking the Object-Oriented Programming, and try to follow SOLID principle as much as you can. If possible take some MOCK interviews.
Tip 3 : Build your concept on Relational databases, you should be able to design the table structures and relationships.
Tip4: You should aware of your project and your contribution to it. Project Objective should be clear. You should know the tech stack used in project, and reason for choosing it.
Tip 1 : Don't write too many paragraphs in the project description, It should be pointwise.
Tip 2 : Don't highlight too many skills, like HTML CSS kind of things.
Tip 3 : One page.
Tip 4 : If you are not a fresher, no need to mention school achievements.
Skills evaluated in this interview
I was interviewed in May 2022.
(1 Question)
- Q1. Data Structures and Algorithms
(1 Question)
- Q1. Machine Coding round
Interview Preparation Tips
Interview Preparation Tips
Experience: It was 5 question screening round which was meant to know about my expectations from the organization.
Round: Round 2:
Experience: Online Coding round on Hackerrank3 coding coding questions:
– Run length Encoding of string with slight modification
– Finding buying day and selling day for a given set of days such that the profit of the buyer is maximum .
– Given a set of keywords and a long string, break the long string such that the split words are from the keywords onlyQuestions were fairly simple but test cases were very nice.
Round: Round 3:
Experience: 1st InterviewThe interview went for about 1 hr and was completely technical. The questions asked were:
– Given a binary tree how would you identify whether it is a Binary Search tree or not?
I gave the answer using inorder traversal.– given a bst, convert it to a binary tree such that each element is replaced by the sum of all the elements greater than it?– Given an employee table with employee name and salary find the 2nd highest salary.
I gave the vague answer of using inner query then he asked if instead of 2nd its nth highest then what would I do. After sometime I asked for the keyword (which was LIMIT) and then I wrote the query which was almost syntactically correct.– The answer to the question of binary tree, he asked me if I could solve it without using any space (my previous solution took O(n) space)?
I was writing the solution and in between he said to stop and asked me if I have any question.
Round: Round 4: Java application development
Experience: Imagine we have an Email Queue table in our database with each row representing an email that needs sending. Table Name: EmailQueue Columns: id, from_email_address, to_email_address, subject, body (you can also add columns as you wish, but at minimum it should have these columns). Write a java program that will read from this table and send the emails over an SMTP server (not local unix mail). For the SMTP sending you can use a pre-existing library of your choice, if you wish. Please take into consideration the following:Speed is of the utmost concern. Imagine we have 1 million emails to send. Your code should not sequentially send one email after another.Your solution should scale. In other words, if we determine the fastest we can send emails from a single server is 300 emails/second I should be able to run the same Java program on another server and be able to send another 300 emails/second.Your code should be careful to ensure that it is not possible for the same email to be sent twice (especially when running multiple processes of the program).Don’t worry about whether the SMTP server can handle the load. It can.Order emails are sent is not necessarily important. In other words, even though I’m calling this a “queue” it’s not important to guarantee that emails are sent in the order they arequeued.Comment your code extensively.Once again, speed is the primary concern. So do remember to think about what the slow points in the email sending process could be and take efforts to minimize those pain points.Send me instructions on how to compile/run/test your code along with the code itself. Also the sql statements for me to create the table that you are working with and the sql statements to insert a few test emails.
Round: Round 5: Final interview
Experience: It was of about 1 hr on soft and technical skills. Questions asked include:– Tell be about yourself?
– given an array. find the pattern it follows? there can be 4 patterns only: increasing, decreasing, increase then decrease and decrease then increase.
– Given an array of distinct positive numbers find the maximum sum of elements such that no 2 elements occurring in the maximum sum set is adjacent to each other.
I gave an incorrect answer and then I realised it, so I asked to rectify and she allowed me to do so.
– How can you improve suggestions of coupons to the users?
This discussion went for about 20 mins.
College Name: NA
Gautam Singh
Interview Questionnaire
8 Questions
- Q1. Given a binary tree how would you identify whether it is a Binary Search tree or not?
- Ans.
To identify whether a binary tree is a Binary Search Tree or not.
Check if the left subtree is a Binary Search Tree
Check if the right subtree is a Binary Search Tree
Check if the root node is greater than all the nodes in the left subtree
Check if the root node is less than all the nodes in the right subtree
- Q2. Solve it without using array (in case the solution is - Inorder traversal should be in sorted order)?
- Ans.
Solution for inorder traversal in sorted order without using array
Implement a binary search tree and perform inorder traversal
Use a stack to simulate the recursive function call stack
Maintain a variable to keep track of the previously visited node
Compare the current node with the previously visited node to check if it is in sorted order
- Q3. Given a BST, convert it to a binary tree such that each element is replaced by the sum of all the elements greater than it?
- Ans.
Convert a BST to a binary tree with each element replaced by sum of all greater elements.
Traverse the BST in reverse inorder and keep track of the sum of all greater elements.
Replace each node's value with the sum and update the sum.
Recursively perform the above steps on left and right subtrees.
Time complexity: O(n), Space complexity: O(h) where h is the height of the tree.
- Q4. Given an employee table with employee name and salary find the 2nd highest salary in sql?
- Ans.
Find the 2nd highest salary from an employee table in SQL.
Use the SELECT statement to retrieve the salaries in descending order.
Use the LIMIT keyword to limit the result set to the second row.
Use a subquery to exclude the highest salary from the result set.
- Q5. Tell be about yourself?
- Ans.
I am a software engineer with experience in developing web applications and a passion for problem-solving.
Experienced in developing web applications using languages such as Java, Python, and JavaScript
Proficient in using frameworks such as Spring, Django, and React
Strong problem-solving skills and ability to work in a team environment
Passionate about learning new technologies and keeping up with industry trends
- Q6. Given an array. find the pattern it follows? there can be 4 patterns only: increasing, decreasing, increase then decrease and decrease then increase
- Ans.
Given an array, determine if it follows one of four patterns: increasing, decreasing, increase then decrease, or decrease then increase.
Iterate through the array and compare each element to the previous one.
If all elements are increasing, it follows the increasing pattern.
If all elements are decreasing, it follows the decreasing pattern.
If there is a point where the elements start decreasing after increasing, it follow...
- Q7. Given an array of distinct positive numbers find the maximum sum of elements such that no 2 elements occurring in the maximum sum set is adjacent to each other
- Ans.
Given an array of distinct positive numbers, find the maximum sum of non-adjacent elements.
Use dynamic programming to keep track of the maximum sum at each index
At each index, choose between including the current element or skipping it
The maximum sum at index i is the maximum of the sum including i-2 and i or the sum excluding i
Return the maximum sum at the last index
- Q8. How can you improve suggestions of coupons to the users?
- Ans.
Use machine learning algorithms to analyze user behavior and preferences to suggest personalized coupons.
Collect user data such as purchase history, search history, and demographics
Use machine learning algorithms to analyze the data and identify patterns
Create personalized coupon suggestions based on the identified patterns
Regularly update and refine the algorithm to improve accuracy
Allow users to provide feedback on t
Interview Preparation Tips
Tips: - Keep your resume as compact as possible- Try to keep requirements of the profile in your resume- Survey on how much the company is paying in the market and then state your expected CTC in the range of +/- 2 LPA.
Round: Test
Experience: 2 questions were a bit easy and the 3rd one was a little tricky for the people who are afraid of recursive programming. All the questions are provided in the link here: -----/
Tips: - Programming experience or programmer's help ( :p ) was the only way out of it.- Try to solve problems which you can solve first rather than hanging on any tough problem, because people solving 2/3 questions were also selected for the next round.
Duration: 90 minutes
Total Questions: 3
Round: Technical Interview
Experience: The interviewer was very helpful in guiding, motivating and giving me time to solve the problems. It went quite smoothly and within days I was selected for the next interview.
Tips: - Never speak without thinking unless said to speak what you are thinking.- Try to clarify your doubts before you jump into solving questions asked.- If you are taking any assumption, forget not to notify it to the interviewer.
Round: App development
Experience: I was made to develop a Java application within a week and submit it with proper documentation. It was very interesting app and I learned tons of things while developing.
Tips: - Try to do your task by yourself.- Keep your code as clean and OOP-like as possible- Make your friend read your documentation you prepared to know if it is understandable.- Use git or any other VCS while developing to ensure fallback in case the application breaks down (which usually happens during development).
Round: Technical Interview
Experience: This was exactly like a last gateway to cross for entering into the company. The interviewer was modest and calm, watching all my steps that I take while solving the problem. Twisting problems and guiding me to unwind the twists. At the end...a great experience!
Tips: Same as the above interview tips, nothing much is required for any technical interview (if you ask me).
Skills: Programming, Java application development, Learning/Grabbing new skills, SQL knowledge
College Name: NIT DURGAPUR
Motivation: Few points that motivated me: - Web development related work which is my area of interest.
- Company was a startup so a lot of work => lot of learning (crucial for starting career).- Pay was decent, so I can sustain my living and save something.
Funny Moments: It was my last interview and while I was solving a problem I wrote something wrong, and by mistake " f**k " came out of my mouth. The interviewer was on the phone and for some time I was just wondering if she heard that word, whether it would affect my interview result and all sort of things, rather than about the problem.
A suggestion: Please mind what comes out of your mouth ;)
Skills evaluated in this interview
Interview Preparation Tips
Experience: First round was a simple round which involved 10 multiple choice questions and 3 coding questions on hackerrank platform.
Round: Technical Interview
Experience: Mainly on topics like networks, data structures and algorithms, operating systems. The interviewers looked for people who have had prior experience in web development and asked questions regarding web development in depth too.
Tips: I recommend everyone to read the book titled, 'Cracking the Coding Interview' as it was helpful in my approach to an interview.
General Tips: The one major thing that would give you the edge in joining Myntra would definitely be exposure to web development. Since it is not a part of the curriculum , it's all the more important for you to familiarize yourself with web development. In fact, a few projects in the same field would put you in a very advantageous position to get the job.
Skill Tips: 1. Start your placement preparations well ahead, no point regretting later.
2. Keep a concise resume. Do not take your resume to several pages.
3. Do not neglect aptitude preparation. Many people do this mistake and end up not clearing the first round for several companies.
4. Be thorough with your basics across all subjects. (Do not neglect any subject, even they you may like a few and dislike the others.)
5. Keep in mind, the interviewers are really friendly and try to make sure that you're not nervous during the interview. All they want to do is to test you. Be confident and give it your best shot.
Skills:
College Name: NIT Surathkal
I applied via Referral and was interviewed before Mar 2023. There was 1 interview round.
(1 Question)
- Q1. Sort colours or the dutch flag problem
- Ans.
The Dutch Flag problem involves sorting an array of strings with three possible values in a specific order.
Create three pointers to keep track of the boundaries of each color group
Iterate through the array and swap elements to group them in the correct order
Time complexity of O(n) can be achieved by a single pass through the array
Skills evaluated in this interview
I applied via Approached by Company and was interviewed in Jun 2024. There were 3 interview rounds.
(2 Questions)
- Q1. Rotate array leetcode question
- Q2. Longest palindormic substring
- Ans.
A palindrome is a word, phrase, number, or other sequence of characters that reads the same forward and backward.
Use dynamic programming to solve this problem efficiently.
Iterate through the string and expand around each character to find the longest palindrome.
Consider both odd and even length palindromes.
Example: Input 'babad', Output 'aba' or 'bab'.
(2 Questions)
- Q1. Print all the subsequences of a string
- Ans.
Generate all possible subsequences of a given string.
Use recursion to generate all possible combinations of characters in the string.
At each step, include or exclude the current character to form subsequences.
Store each subsequence in an array of strings.
- Q2. Print longest substring with k unique values
- Ans.
Find and print the longest substring with k unique characters in an array of strings.
Iterate through the array of strings and keep track of the longest substring with k unique characters.
Use a sliding window approach to efficiently find the longest substring.
Keep a hashmap to store the frequency of characters in the current window.
Update the window boundaries based on the number of unique characters.
Return the longest
(1 Question)
- Q1. Behaviour quesions
Skills evaluated in this interview
I applied via Approached by Company and was interviewed in Mar 2024. There was 1 interview round.
(2 Questions)
- Q1. Rain water problem
- Ans.
The rain water problem involves calculating the amount of rainwater that can be trapped between buildings or structures.
Calculate the maximum height of water that can be trapped at each position
Subtract the height of the building at each position to get the water level
Sum up the water levels at each position to get the total amount of trapped rainwater
- Q2. 2 sum problemjijo
The written test consisted of two DS programs.
Recently Viewed
JOBS
Airbnb
No Jobs
REVIEWS
Airbnb
No Reviews
REVIEWS
OLX
No Reviews
REVIEWS
Avis
No Reviews
REVIEWS
OLX
No Reviews
REVIEWS
Groupon
No Reviews
REVIEWS
OLX
No Reviews
SALARIES
Airbnb
LIST OF COMPANIES
Groupon
Overview
SALARIES
Airbnb
Tell us how to improve this page.
Groupon Interviews By Designations
- Groupon Customer Service Representative Interview Questions
- Groupon CSR Executive Interview Questions
- Groupon Software Development Engineer II Interview Questions
- Groupon Customer Support Executive Interview Questions
- Groupon Software Engineer Interview Questions
- Groupon Customer Support Associate Interview Questions
- Groupon Customer Service Executive Interview Questions
- Groupon Team Lead Interview Questions
- Show more
Interview Questions for Popular Designations
Anonymously discuss salaries, work culture, and many more
Get Ambitionbox App
SDE-2 Interview Questions from Similar Companies
|
Customer Service Representative
231
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Customer Service Executive
122
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Customer Support Executive
78
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Customer Support Representative
72
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Senior Customer Service Representative
71
salaries
| ₹0 L/yr - ₹0 L/yr |
Amazon
Nearbuy
Rakuten
- Home >
- Interviews >
- Groupon Interview Questions >
- Groupon SDE-2 Interview Questions
