SDE-2 at Zeta
- Difficulty
- Process took
- 0-1 Weeks
- Rounds
- 1
- Format
- Remote
- Applied via
How it went
- Keep yourself prepared, you never know when an opportunity will come.
What they would tell you
- Keep yourself prepared, you never know when an opportunity will come.
How to prepare
- If you are following a DSA sheet, do it thoroughly.
Their background
I’ve spent the past few years working with backend technologies, building scalable APIs, my experience has been a mix of product and service environments, sharpening my skill at communicating solutions, and I’m always up for tackling new DSA problems and believe the best solutions come through hands-on reasoning, not just theory.
Round by round
- 1
DSA60 min
This was pure problem-solving no warm ups, just right into the DSA deep end. Question 1: Split Array Largest Sum - The interviewer started with this classic tricky problem, my approach using binary search over the answer space and explained how I’d partition the array such that the largest sum of any subarray is minimized. Question 2: Best Time to Buy and Sell Stock II Here, I started with a recursive solution for maximizing profit and explained my thinking. The interviewer really pressed on time complexity reasoning. I talked through O(2^N) for the naive recursive paths and then considered N! for permutations, even so, there was a long debate on what the expected answer should be. Unfortunately, there was not much opportunity to build on optimizations or write code.
What came up
A candidate-reported account, lightly edited. Interview processes change by team and date.