wheelseye logo
Wheelseye· SDE-I

WheelsEye - DSA Round Interview Experience

Posted
4 Jul 2025
288 reads

Summary

I interviewed with WheelsEye for an SDE-I role, participating in a DSA round that included two algorithmic problems: Minimum Number of Days to Make m Bouquets and Ninja’s Training.

How it went

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)

https://www.naukri.com/code360/problems/ninja-s-training_3621003?source=youtube&campaign=striver_dp_videos

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.

Questions asked (2)

  1. 01

    Minimum Number of Days to Make m Bouquets

    Data Structures & Algorithms · Medium

    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.

    Open the problem
  2. 02

    Ninja’s Training

    Data Structures & Algorithms

    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.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Wheelseye recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

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