i
Groupon
Filter interviews by
I appeared for an interview in Nov 2021.
Round duration - 60 minutes
Round difficulty - Easy
The first round was a coding round. 2 DSA based questions were asked.
Given the schedule of N meetings with their start time Start[i]
and end time End[i]
, you need to determine which meetings can be organized in a single meeting room such ...
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.
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, if arr[i]
is the peak, then both...
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.
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.
Top trending discussions
I appeared for an interview in May 2022.
I applied via LinkedIn and was interviewed in Mar 2023. There were 5 interview rounds.
3 Coding question, mix of easy medium and hard questions. Online proctored on Hackerrank
2 sum problem variation based on number of digits and finding nodes where average of subtree and node value equals node value.
For the 2 sum problem variation, use a hash table to store the digits and their indices.
For the subtree problem, use a recursive function to traverse the tree and calculate the average.
Examples: [1, 2, 3, 4, 5] with target 7 and tree with root 5, left child 4, right child 6, should return 2 and
I appeared for an interview in Jun 2021.
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.
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.
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
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...
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.
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.
I appeared for an interview in May 2022.
Round duration - 60 Minutes
Round difficulty - Medium
Timing was around 11 am
Environment was great, it intrigued me to join Blinkit.
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
Sort the array in non-decreasing order.
Use two pointers approach to find pairs with sum equal to 'S'.
Return pairs in sorted order based on first value, with smaller second value coming first.
Round duration - 60 Minutes
Round difficulty - Medium
Timing 11 am
Interviewer had good knowledge
Activity lifecycle in Android development involves various states like onCreate, onStart, onResume, onPause, onStop, onDestroy.
Activity is created with onCreate() method
Activity becomes visible with onStart() and onResume() methods
Activity goes into background with onPause() method
Activity is stopped with onStop() method
Activity is destroyed with onDestroy() method
Fragment lifecycle in Android involves various states like created, started, resumed, paused, stopped, and destroyed.
Fragments are created using the onCreateView() method.
Fragments go through states like created, started, resumed, paused, stopped, and destroyed based on user interactions and system events.
Fragment lifecycle methods include onCreate(), onStart(), onResume(), onPause(), onStop(), and onDestroy().
MVVM is a design pattern that separates the user interface from the business logic and data model.
MVVM stands for Model-View-ViewModel
Model represents the data and business logic
View represents the UI components
ViewModel acts as an intermediary between the Model and View, handling user input and updating the Model
MVVM promotes separation of concerns and easier unit testing
Round duration - 30 Minutes
Round difficulty - Easy
This round is cultural fit round
Tip 1 : Prepare easy/medium level data structures questions in leetcode. Solve atleast 50 questions of multiple types like strings, arrays, tree, linked list, graph
Tip 2 : Go through Android basic questions like lifecycle, live data, MVC/mvp/ mvvm pattern, retrofit, data binding
Tip 3 : Atleast solve 5 design questions like how to build Instagram, analytics library, crashlytics
Tip 1 : be concise
Tip 2 : write only those keywords which you have in depth knowledge
I applied via Naukri.com and was interviewed before Dec 2022. There were 3 interview rounds.
DSA questions on Arrays, Greedy
I applied via Company Website and was interviewed before Dec 2023. There were 2 interview rounds.
Attempt aptitude test
I would describe the programming language I use as versatile, efficient, and widely used in various industries.
One of the most popular programming languages in the world
Known for its flexibility and scalability
Utilized in web development, data analysis, artificial intelligence, and more
Examples include Python, Java, C++, and JavaScript
I applied via Campus Placement
QUESTIONS BASED ON TREES , GRPAHS
BASIC APTITUDE LIKE LOCATION ETC
I used Java, Spring Boot, and MySQL in my project to develop a web application for managing inventory.
Java
Spring Boot
MySQL
I faced issues with debugging complex code, collaborating with team members, and meeting tight deadlines.
Debugging complex code: Had to spend extra time identifying and fixing bugs in intricate code.
Collaborating with team members: Communication issues and conflicting ideas slowed down progress.
Meeting tight deadlines: Struggled to prioritize tasks and manage time effectively to meet project deadlines.
Customer Service Representative
230
salaries
| ₹2 L/yr - ₹5.6 L/yr |
Customer Service Executive
122
salaries
| ₹2.3 L/yr - ₹4.5 L/yr |
Customer Support Executive
77
salaries
| ₹2.4 L/yr - ₹4.8 L/yr |
Customer Support Representative
73
salaries
| ₹2.6 L/yr - ₹4.5 L/yr |
Senior Customer Service Representative
71
salaries
| ₹3.2 L/yr - ₹6 L/yr |
Amazon
Nearbuy
Rakuten