Coupang screening round - Staff - BLR / HYD

coupang logo
coupang
StaffBLR / HYDRejected
November 28, 2025188 reads

Summary

I attended a screening round for a Staff role at Coupang, which involved solving two coding problems on HackerRank. Despite my efforts, I believe I didn't perform well, especially on the first question, and the interviewer seemed uninterested, leading me to expect a rejection.

Full Experience

Hi Folks,

I'm sharing my experience after gaining a lot from this community. I recently attended a screening round for a Staff role at Coupang, specified for BLR / HYD locations, though I'm not sure about the exact team.

The round consisted of a HackerRank link with two problems to be coded within 60 minutes. They emphasized the need for a working solution that passes all test cases.

For the second question, I successfully implemented the LFU cache and it passed all the test cases. However, for the first question, despite significant thought, I could only come up with a binary search solution that failed 3 test cases.

The interviewer seemed quite uninterested throughout our conversation, not even responding to my questions. Based on this interaction, I anticipate the outcome will likely be a rejection. I will provide an update if anything changes.

Interview Questions (2)

Q1
Minimum Batch Size
Data Structures & Algorithms

Complete the 'findMinBatchSize' function below.

The function is expected to return an INTEGER.

The function accepts following parameters:

  1. INTEGER_ARRAY dataSamples
  2. INTEGER maxBatches

A machine learning training pipeline processes data in batches to optimize graphics processing unit (GPU) utilization. Several users contribute data samples, and the pipeline divides them into batches of a specific size.

All data must be processed.
Multiple users' data cannot be combined for processing.
The number of batches across all users cannot exceed a limit.
Determine the minimum batch size.

Example 1
Input: dataSamples = [1, 5, 7], maxBatches = 8
Output: 2

Q2
LFU Cache Implementation
Data Structures & Algorithms

Implement an LFU (Least Frequently Used) cache.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

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