Spinny Software Developer Interview Questions and Answers

Round duration - 30 minutes
Round difficulty - Easy

This was just a screening round to check my intention and communication skills. They just asked me why was I looking for a job change, and told me a little bit about the profile.

Round duration - 45 Minutes
Round difficulty - Easy

Since I had applied for a full stack profile, this round mainly consisted of front-end questions and some basic DSA questions. They had scheduled a call in the afternoon around 14:00 and the call was on Google meet where I had to share my screen and type in some code, once I was happy with my code and it worked fine, I had to paste it into the google doc. Actually, they had outsourced the interview rounds to the Interview Vector.

Q1. 
Flatten 2D Array Problem
Implement an iterator called ‘FLATTEN_2D’ to transform a two-dimensional array ‘ARR_2D’ into a one-dimensional array ‘ARR_1D’. The iterator should support the following operations...read more
Ans. 
Implement an iterator to flatten a 2D array into a 1D array in row-wise traversal.
• Create a class 'FLATTEN_2D' with 'NEXT' and 'HAS_NEXT' methods.

• Maintain current row and column indices to keep track of traversal.

• Handle edge cases like empty rows and columns.

• Combine elements row-wise to form the 1D array.

• Return the elements of 'ARR_1D' for each test case.
Answered by AI
Add your answer
Q2. Implement a function 'sum' such that the following conditions hold: sum(1)(2)(3)(4)() returns 10, sum(1)() returns 1, and sum() returns 0.
Ans. 
Implement a function 'sum' with varying number of arguments to return the sum of all arguments.
• Create a function 'sum' that takes in a number as argument and returns a new function that takes in the next number.

• Each subsequent call to the returned function should add the argument to the running total.

• Return the running total when an empty argument is passed.
Answered by AI
View 1 more answer

Round duration - 90 Minutes
Round difficulty - Easy

This round consisted of multiple easy DSA questions, some frontend questions, and one thought experiment related to design. Again, this round was conducted around 14:00 in the afternoon.

Q1. 
Anagram Pairs Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...read more
Ans. 
Check if two strings are anagrams of each other by comparing their sorted characters.
• Sort the characters of both strings and compare them.

• If the sorted strings are equal, then the strings are anagrams.

• Use a dictionary to count the occurrences of characters in each string for a more optimized solution.
Answered by AI
Add your answer