Coupang | SSE | TPS | BLR

coupang logo
coupang
SDE IIbangalore6 yearsOngoing
September 23, 202518 reads

Summary

I recently completed a 60-minute phone screening for an SSE role at Coupang Bangalore, where I discussed a space-optimized Minimum Stack implementation, though the interviewer seemed to expect a different approach.

Full Experience

I'm currently an SSE at Walmart with 6 years of experience. I recently had a phone screening for Coupang in Bangalore. The interview lasted 60 minutes, and my interviewer was from Korea. We discussed the implementation of a Minimum Stack in O(1) time. I tried explaining my space-optimized approach without an auxiliary stack, but it seemed the interviewer was looking for a solution that used one. I'm not sure if he fully understood my method, and I regret not clarifying his preferred implementation beforehand. I'll update this thread with the outcome.

Interview Questions (1)

Q1
Minimum Stack in O(1)
Data Structures & AlgorithmsMedium

Implement a data structure for a Minimum Stack where all operations (push, pop, top, getMin) should execute in O(1) time complexity.

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!