Spyne interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Spyne

2 rounds | 2 Coding problems

Vaibhav Sharma

Fresher | Sep 2024

Rejected

Interview preparation journey

Journey

My interview journey at Spyne AI was both challenging and insightful. It began with an online Data Structures and Algorithms (DSA) test, which served as the first hurdle. The test involved solving complex problems efficiently, with a strong focus on algorithms and optimal solutions. Despite my preparation, I struggled with a couple of the questions, particularly in terms of time complexity optimization, and was unable to clear this round.

Application story

My interview journey at Spyne AI began with a walk-in drive organized through Coding Ninjas. The process started with a Data Structures and Algorithms (DSA) test, which focused on solving algorithmic challenges efficiently, emphasizing optimal solutions and time complexity. Despite my efforts, I struggled with some of the tougher questions, particularly in optimizing my solutions, and I was unable to clear the DSA round.

Why selected/rejected for the role?

I was not aware of DSA. I'm not into competitive programming, which is why my logic was not so clear. That's why I was rejected.

Preparation

Duration: 3 months

Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming

Tip

Tip 1: Be well-prepared.
Tip 2: Be aware of DSA (Data Structures and Algorithms).
Tip 3: Do at least two projects.

Application process

Where: Campus

Eligibility: No

Resume tip

Tip 1: Have some projects on your resume.
Tip 2: Do not include false information on your resume.

Interview rounds

Round

Medium

Face to Face

Duration60 minutes

Interview date14 Sep 2024

Coding problem1

1. Asked linked list Program or SQL queries.

Problem approach

I have written the code, but it’s not logically strong; that’s why I'm not able to crack it.

Round

Easy

Face to Face

Duration60 minutes

Interview date14 Sep 2024

Coding problem1

1. Count Subsequences

Moderate

30m average time

60% success

0/80

Asked in companies

You have been given an integer array/list 'ARR' of size 'N'. Your task is to return the total number of those subsequences of the array in which all the elements are equal.

A subsequence of a given array is an array generated by deleting some elements of the given array with the order of elements in the subsequence remaining the same as the order of elements in the array.

Note :

As this value might be large, print it modulo 10^9 + 7

Problem approach

Step 1: I first applied bubble sort, but it was not good enough.
Step 2: The interviewer asked me to optimize the solution.
Step 3: Then I provided a solution using merge sort, and the interviewer was happy.

Try solving now