I recently interviewed with WheelsEye for the role of SDE-I, and I’d like to share my experience from the DSA round.
The process began with a preliminary call from the HR, where we had a pleasant 10–15-minute discussion. The HR briefed me about the company’s vision, work culture, and the role expectations. The interaction was smooth and professional, and soon after, the first round—a DSA coding round—was scheduled.
The DSA round was held virtually and lasted for 1 hour. During this round, I was presented with two algorithmic coding problems:
Minimum Number of Days to Make m Bouquets (LeetCode Medium)
https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/description/
This problem involved using binary search on the answer space to determine the minimum day on which it's possible to make m bouquets using k adjacent flowers.
I was able to solve this question optimally but took more time.Also discussed the approach, time complexity, and edge cases with the interviewer.
Ninja’s Training (Dynamic Programming based problem)
This was a classic DP problem that required maximizing points earned over N days with a constraint of not repeating the same task on consecutive days.
Although I couldn't come up with the proper approach, I wasn't able to implement the solution.
Hope this will help someone.
