wheelseye logo
Wheelseye· SDE I

Wheelseye SDE1 interview

Posted
12 Jun 2025
304 reads

Summary

I experienced a Data Structures and Algorithms round for the SDE1 role at Wheelseye, which included two specific coding challenges.

How it went

First Round(DSA):
Question 1: You have given an array of fruits with frequencies in a specific order. We need to give all the possible arrangements of these fruits in such a way that
same fruits are not adjacent and
all fruits should be consumed

Input: nums = [2,1,2] (M, O, A)


Output:
M O A M A
M A M O A
M A M A O
M A O M A
M A O A M
O M A M A
O A M A M
A M O M A
A M O A M
A M A M O
A M A O M
A O M A M

Question 2:
2-d array which is sorted both row wise and column wise, find the target element in the given array ?

{10, 20, 30, 40},
{15, 25, 35, 45},
{27, 29, 37, 48},
{32, 33, 39, 50}

Target = 33

Questions asked (2)

  1. 01

    Arrange Fruits with No Adjacent Same Fruits

    Data Structures & Algorithms

    You have given an array of fruits with frequencies in a specific order. We need to give all the possible arrangements of these fruits in such a way that
    same fruits are not adjacent and
    all fruits should be consumed

    Input: nums = [2,1,2] (M, O, A)


    Output:
    M O A M A
    M A M O A
    M A M A O
    M A O M A
    M A O A M
    O M A M A
    O A M A M
    A M O M A
    A M O A M
    A M A M O
    A M A O M
    A O M A M

  2. 02

    Search in a Row-Column Sorted 2D Matrix

    Data Structures & Algorithms

    2-d array which is sorted both row wise and column wise, find the target element in the given array ?

    {10, 20, 30, 40},
    {15, 25, 35, 45},
    {27, 29, 37, 48},
    {32, 33, 39, 50}

    Target = 33

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!