Summary
Applied for SDE-1 position at Super Money through DSA round. Faced two coding problems, one from LeetCode and another similar to a Codeforces problem. Successfully solved both and moved to next rounds.
Full Experience
Recently, I attempted to apply for an SDE-1 position at Super Money. The interview process began with a Problem Solving Round lasting 60 minutes. The first problem was the Smallest Number in Infinite Set, which required implementing a class with specific methods. The second problem was similar to a Codeforces problem where I had to calculate the minimum time for friends to gather at a point on a road. I tackled both problems and was able to complete them within the time limit, which led me to the next rounds of the interview process.
Interview Questions (2)
You have a set which contains all positive integers [1, 2, 3, 4, 5, ...]. Implement the SmallestInfiniteSet class:SmallestInfiniteSet() - Initializes the SmallestInfiniteSet object to contain all positive integers
int popSmallest() - Removes and returns the smallest integer contained in the infinite set
void addBack(int num) - Adds a positive integer num back into the infinite set, if it is not already in the infinite set
The main road in Bytecity is a straight line from south to north. There are coordinates measured in meters from the southernmost building in the north direction. At some points on the road, there are n friends. The i-th friend is standing at point xi meters and can move with any speed no greater than vi meters per second in either direction along the road (south or north). Compute the minimum time needed to gather all n friends at some point on the road. Note that the meeting point doesn't need to have an integer coordinate.