groupon logo
Groupon· SDE 3

GroupOn | SDE 3 | Bengaluru | Offer

Result
Offer
Location
bengaluru
Posted
22 Nov 2021
302 reads

Summary

I interviewed for an SDE 3 role at Groupon in Bengaluru and received an offer for SDE 2 due to my current tech stack. The interview process included an online assessment, two coding rounds, a system design round, and a hiring manager round.

How it went

I recently interviewed for an SDE 3 position at Groupon in Bengaluru. The interview process spanned four rounds.

The first round was a Hackerrank Online Assessment where I tackled two problems. For 'Count Ways to Sum using 1-N numbers', I managed to solve 6 out of 13 test cases. The second problem, 'Count Number of incorrect product prices', I solved completely, passing all test cases.

The second round was a coding interview. The first question was the classic 3Sum problem. I struggled a bit but was able to solve it after receiving a hint from the interviewer. The second question was Best Time to Buy and Sell Stock II, which I solved optimally, and I felt it went very well.

Round three was focused on System Design and Architecture. The main problem was to design a system for sending notifications, specifically a Notification System as a Software as a Service. During the discussion, I explained concepts like Rate Limiting, specifically the Token Bucket algorithm, Horizontal Scaling strategies, and how to send messages to offline users. I believe this round went quite well.

Finally, the fourth round was with the Hiring Manager. This round involved some behavioral questions. Technical discussions included Java concurrency concepts like Synchronized, Atomic Variables, and Volatile keywords, where I wasn't able to explain Atomic Variables and Volatile in detail. We also discussed Least Recently Used (LRU) and Least Frequently Used (LFU) Caches, which I felt I handled well.

After completing all rounds, I received an offer. Although I applied for an SDE 3 role, they offered me an SDE 2 position, citing that my current tech stack might not be industry-standard based.

Questions asked (7)

  1. 01

    Count Ways to Sum using 1-N numbers

    Data Structures & Algorithms

    This problem asks to count the number of ways to sum using numbers from 1 to N.

  2. 02

    Count Number of incorrect product prices

    Data Structures & Algorithms

    The problem involved counting the number of incorrect product prices.

  3. 03

    3Sum

    Data Structures & Algorithms

    Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets.

    Open the problem
  4. 04

    Best Time to Buy and Sell Stock II

    Data Structures & Algorithms

    You are given an integer array prices where prices[i] is the price of a given stock on the ith day. On each day, you may decide to buy and/or sell the stock. You can only hold at most one share of the stock at any time. However, you can buy it then immediately sell it on the same day. Find the maximum profit you can achieve.

    Open the problem
  5. 05

    Design a Notification System (SaaS)

    System Design

    Design a scalable system for sending notifications, structured as a Software as a Service. I discussed aspects like Rate Limiting, Horizontal Scaling, and strategies for sending messages to offline users.

  6. 06

    Concurrency Primitives in Java

    Other

    Discussion on Java concurrency primitives: Synchronized keyword, Atomic Variables, and Volatile keyword.

  7. 07

    LRU and LFU Caches

    Data Structures & Algorithms

    Discussion on Least Recently Used (LRU) and Least Frequently Used (LFU) caching mechanisms.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Groupon recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!