Skydo | Interview Experience | Software Engineer | 20 LPA CTC | 1 YOE

skydo logo
skydo
Software Engineer1 years
March 28, 202515 reads

Summary

I applied for a Software Engineer role at Skydo and completed two interview rounds focused on Data Structures & Algorithms and project discussions in March 2025, ultimately resulting in a rejection.

Full Experience

I applied on Instahyre via a recruitment firm. Appeared for the interview in March, 2025.

Round 1:

The interviewer first started with his introduction and gave a brief about the company. He then asked for my introduction and asked little bit about my experience. Then he started with DSA problems. He asked two problems.

Question 1:

You are given a binary string boxes of length n, where boxes[i] is either '0' (empty) or '1' (contains a ball). Your task is to find an array answer of length n, where answer[i] represents the minimum number of operations required to move all the balls to the i-th box.

An operation consists of moving a ball from index j to index i, which takes |i - j| operations.

Question 2:

https://leetcode.com/problems/edit-distance/description/

I solved both questions. He asked easy follow up for question 2. He asked how code will change if there is some cost for each of the 3 operations.

Round 2:

The interviewer started his introduction and then asked my introduction. He went in depth in projects worked in my current company. He also asked some unnecessary questions and was stick to it. I found the interviewer little rude. He then moved on to DSA problem.

Problem:

https://leetcode.com/problems/search-in-rotated-sorted-array/description/

I took little time to solve the question but after some little difficulties I managed to solve the question. He was not still satisfied. I think he was not satisfied with my explanation for the solution.

The interview ended here.

Verdict: Rejected

Interview Questions (3)

Q1
Minimum Operations to Move Balls
Data Structures & Algorithms

You are given a binary string boxes of length n, where boxes[i] is either '0' (empty) or '1' (contains a ball). Your task is to find an array answer of length n, where answer[i] represents the minimum number of operations required to move all the balls to the i-th box. An operation consists of moving a ball from index j to index i, which takes |i - j| operations.

Q2
Edit Distance
Data Structures & Algorithms

Problem description available at the provided link.

Q3
Search in Rotated Sorted Array
Data Structures & Algorithms

Problem description available at the provided link.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

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