Spinny Software Engineer Interview Questions, Process, and Tips

Round duration - 45 minutes
Round difficulty - Easy

This was a coding test with 2 DSA questions.

Q1. 
Merge Two Sorted Arrays Problem Statement
Given two sorted integer arrays ARR1 and ARR2 of size M and N, respectively, merge them into ARR1 as one sorted array. Assume that ARR1 has a size of M + N to hol...read more
Ans. 
A simple approach would be to create a new arrays with size as sum of the sizes of both the arrays. Copy the elements of both the arrays in the new array and sort the array. 
A space optimized approach also exists. While traversing the two sorted arrays parallelly, if we encounter the jth second array element is smaller than ith first array element, then jth element is to be included and replace some kth element in...read more
Answered Anonymously
Add your answer
Q2. 
Count Ways to Reach the Nth Stair
Given a number of stairs, starting from the 0th stair, calculate the number of distinct ways you can reach the Nth stair. You can climb either one step or two steps at a ...read more
Ans. 
The question can be approached using recursion. The person can reach nth stair from either (n-1)th stair or from (n-2)th stair. Hence, for each stair n, find out the number of ways to reach n-1th stair and n-2th stair and add them to give the answer for the nth stair. Therefore the expression for such an approach comes out to be : ways(n) = ways(n-1) + ways(n-2)

This is an expression for Fibonacci numbers only, where wa...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This was the first round with questions on DSA and Low Level design.

Q1. 
Trapping Rain Water Problem Statement
You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...read more
Ans. 
Basic Insight: 
An element of the array can store water if there are higher bars on the left and right. The amount of water to be stored in every element can be found out by finding the heights of bars on the left and right sides. The idea is to compute the amount of water that can be stored in every element of the array.

Algorithm: 
1) Create two arrays left and right of size n. create a variable max_ = INT_MIN...read more
Answered Anonymously
Add your answer
Q2. Can you provide a low-level design of a hotel management system?
Ans. 
Tip 1 : Firstly, remember that the system design round is extremely open-ended and there’s no such thing as a standard answer. Even for the same question, you’ll have a totally different discussion with different interviewers.

Tip 2 : Before you jump into the solution always clarify all the assumptions you’re making at the beginning of the interview. Ask questions to identify the scope of the system. This will clear the...read more
Answered Anonymously
Add your answer

Dsa and alogorithm by third party agency.

Q1. One Dynamic programming question
Add your answer

DSA - arrays, hashing, stack, 2hrs , google meet

Q1. Low level design , OOPs, modular code,
Add your answer
Q2. Crickbuzz- players, teams, score
Add your answer