i
Groupon
Filter interviews by
Clear (1)
I applied via Company Website and was interviewed in Aug 2021. There was 1 interview round.
Earnings to our company are the financial gains or profits generated from our operations.
Earnings reflect the financial performance and success of our company.
They are a measure of our profitability and can be used to assess our financial health.
Earnings can be reinvested in the company for growth or distributed to shareholders as dividends.
They are influenced by factors such as sales revenue, cost of goods sold, and o...
Top trending discussions
I applied via Approached by Company and was interviewed before May 2021. There was 1 interview round.
I applied via Approached by Company and was interviewed before May 2021. There were 2 interview rounds.
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
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
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.
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.
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
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...
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
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
I applied via Referral and was interviewed before Mar 2023. There was 1 interview round.
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
I applied via Approached by Company and was interviewed in Jun 2024. There were 3 interview rounds.
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'.
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.
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
I applied via Approached by Company and was interviewed in Mar 2024. There was 1 interview round.
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
The written test consisted of two DS programs.
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