Add office photos
Filter interviews by
Spinny Software Developer Intern Interview Questions and Answers
Spinny Software Developer Intern Interview Experiences
1 interview found
Anonymous
Selected
I applied via cuvette.tech and was interviewed before Sep 2022. There were 3 interview rounds.
Was asked to build a REST API for inventory management of a store using Django REST framework.
(1 Question)
- Q1. Had a discussion regarding my project and resume with the founder, he paid attention to detail and was polite and supportive.
Interview Preparation Tips
- Python
- Django
- SQL
- Docker
- Basic system design
Top trending discussions
Interview questions from similar companies
Selected
I applied via Job Fair and was interviewed in Jul 2024. There were 2 interview rounds.
More focus on dp,graphs.
(2 Questions)
- Q1. Focus on backend concepts,routing.
- Q2. Question on flood fill algo,backtracking.
I applied via Campus Placement and was interviewed in Jan 2024. There were 4 interview rounds.
Easy to medium level of leet code
(1 Question)
- Q1. 1. Fibonacci series with recursion and without recursion 2. String Palindrome 3. Count all repeated numbers from the array
- Ans.
Answering questions related to Fibonacci series, string palindrome, and counting repeated numbers in an array.
For Fibonacci series with recursion, write a function that calls itself to calculate the next number in the series.
For Fibonacci series without recursion, use a loop to calculate the series.
For string palindrome, compare characters from start and end of the string.
To count all repeated numbers from the array, u
(1 Question)
- Q1. 1.Given an array(0-based indexing), you have to find the max sum of i*A[i] where A[i] is the element at index i in the array. The only operation allowed is to rotate(clock-wise or counter clock-wise) the ...
- Ans.
Rotate array to find max sum of i*A[i]
Rotate array to bring maximum element to front
Calculate sum of i*A[i] for each rotation
Keep track of maximum sum found
(1 Question)
- Q1. 1.Oops concepts 2.Oops code 2.About Java Spring 3. Array stack questions 4.Project discussion
Interview Preparation Tips
Skills evaluated in this interview
Selected
I was interviewed before Aug 2023.
3 question of basic and 3 mcq
Strings,Sort 0 1 2,invert binary tree
(2 Questions)
- Q1. Project Basics and Technical skills
- Q2. Your Daily routine
- Ans.
My daily routine involves coding, debugging, attending meetings, and learning new technologies.
Start the day by checking emails and prioritizing tasks
Code and debug new features or fix existing issues
Attend team meetings to discuss progress and roadblocks
Spend time learning new technologies or improving coding skills
Collaborate with team members on projects
(1 Question)
- Q1. It was based on dynamic programming
Interview Preparation Tips
I was interviewed in May 2021.
(3 Questions)
Round duration - 90 Minutes
Round difficulty - Hard
Test Description/Instruction as Mentioned on the portal and mail :
1) The test will consist of 3 algorithmic problems.
2) The test time is 1.5 hours in which you will need to solve the 3 problems. The test link will be active from 10:00 AM onwards.
3) Please do not change the tabs since all the actions will be recorded and logged.
- Q1.
Flood Fill Algorithm Task
Assist Ninja in altering the color of a specific region in his photo. Given the image as a 2D array where each pixel is a positive integer, update the color of a specified pixel ...
- Ans.
The Flood Fill Algorithm is used to change the color of a particular region in an image and all its adjacent same-colored pixels.
The image is represented as a 2D array of positive integers
The starting pixel and new color are given
Adjacent pixels are connected in up, down, left, or right directions
Diagonal pixels are not considered adjacent
Implement the Flood Fill Algorithm to replace the color of the given pixel and it...
- Q2.
Kruskal’s Minimum Spanning Tree Algorithm Problem Statement
You are given a connected undirected weighted graph. Your task is to determine the weight of the minimum spanning tree of this graph.
A minimum...
- Ans.
The task is to find the weight of the minimum spanning tree of a given connected undirected weighted graph.
Implement Kruskal's algorithm to find the minimum spanning tree
Use a disjoint set data structure to keep track of connected components
Sort the edges in non-decreasing order of their weights
Iterate through the sorted edges and add them to the minimum spanning tree if they don't create a cycle
Return the sum of weigh
- Q3.
Merge Sort Problem Statement
You are given a sequence of numbers,
ARR. Your task is to return a sorted sequence ofARRin non-descending order using the Merge Sort algorithm.Explanation:
The Merge Sort...
- Ans.
The task is to implement the merge sort algorithm to sort a given sequence of numbers in non-descending order.
Merge sort is a divide and conquer algorithm that recursively divides the input array into two halves until the size becomes 1.
Then it merges the two sorted halves to produce a single sorted array.
The time complexity of merge sort is O(n log n), where n is the size of the input array.
The algorithm is efficient ...
Interview Preparation Tips
Tip 1 : Practice Atleast 300 Questions on leetcode (150 easy, 100 medium and 50 hard )
Tip 2 : Make atleast one big project which includes (DB, backend and frontend). Because in Hiring Manager round we have to discuss our resume for about 45mins to 1 Hr so having 1 or 2 big projects on the resume is always good to have otherwise HM will go towards core subjects Like OOP/OS/Networks which are often tricky.
Tip 3 : Think out of the box while solving a Question think of all the variants in which this questions can be asked. Let's take an example of simple question like two sum here we have to find a pair in an array whose sum is equal to given value. Now what if Interviewer asked to find three numbers instead of 2 or maybe find k numbers whose sum is equal to a given number. So it is always good to think out of the box and generalise the solution.
Tip 4 : Always try to solve each question in different ways. You should know both the bruteforce solution and the optimal one.
Tip 5 : When you solve a Question try to learn as much possible from a single Question for eg if you try to solve a Tree question then it is good to know both the iterative and recursive solution as sometimes Interviewer may introduce some constraints that due to huge test case recursive solution is not possible.
Tip 6 : 3-4 days before the interview start preparing using interviewbit as it contains all the important questions topic wise. I usually solve Interviewbit before the interview. No doubt Leetcode is good in terms of UI, Test cases and Easy to use but Interviewbit is more organised. I myself have done all the Interviewbit Questions multiple times.
Tip 1 : Try to add Experience at the top with detailed explanation of work done by you
Tip 2 : If No Experience: try to add more and more personal projects with the skills required in JD
Tip 3 : If No projects and Experience: Try to add Coding profiles, Achievements (Hackathons and Coding Competitions )
Skills evaluated in this interview
I was interviewed in Feb 2021.
Round duration - 24 hours
Round difficulty - Medium
(2 Questions)
Round duration - 120 Minutes
Round difficulty - Medium
It was a Data Structures and Algorithm Round and Discussion on My assignment round to check my Problem Solving Skills.
And the Interviewer was very friendly to me. I first introduced myself to the interviewer and what did I have done in past as a Software Engineer and Why I want to work in Grofers.
- Q1.
Top View of Binary Tree
Given a binary tree of integers, the task is to return the top view of the given binary tree. The top view of the binary tree is the set of nodes visible when viewed from the top.
... - Ans. Using Pre-Order Traversal
As we know that all three traversals, i.e. pre-order, in-order and post-order, visit the tree node at once. We can use any of them. Here we are going to use pre-order traversal for the explanation. So while traversing in the pre-order traversal, we will keep track of horizontal distance of the node which is going to be visited from the root node, and we also keep track of the vertical level of ...
- Q2.
Maximum Possible Time Problem Statement
Given an array
ARRconsisting of exactly four integer digits, your task is to form the maximum possible valid time in a 24-hour format using those digits.Explanat...
- Ans. Maximum Possible Time
Approach:
- The basic idea is that we will iterate over all the permutations of the 4 digits and check whether we are able to form a valid 24 Hr format time. If so we will then also find the maximum possible time.
- Here we will use the ‘NEXT_PERMUTATION’ method to find all the permutations.
Algorithm:
- There are two conditions for valid 24 Hr format time:
- The first two digits i.e the hour should be le...
Interview Preparation Tips
Tip 1 : Practise Data Structures and Algorithms as much as you can on daily basis. Don't Fix numbers in your head, but practise as much as you can from all topics on daily basis.
Tip 2 : Give Programming Contests on a Daily basis. As it helps you to think of any particular problem in the fixed time frame.
Tip 3 : For Mastering DP, Learn From Aditya Verma Youtube Playlist and apply around 100 questions for solving any DP problem.
Tip 4 : Also Learn Computer Science theory subject once a week so that you will have a deep understanding of the particular subject since many interviews grind on CS theory subjects like OS, DBMS and Networks
Tip 5 : Make at least 2-3 Projects in any technology you like maybe Web Development or Android Development. It shows that you have some experience in Development and the company don't need to waste time on you for teaching frameworks.
Tip 6 : If you have time learn some System Design and learn how to design any system from end to end. Especially learn about designing a database of any application. In many interviews, the interviewer asks to design an application from end to end. So if you have some practice, then you can easily clear this type of rounds.
Tip 1 : Always attached your Project links in your resume. As it seems your project is genuine and you are confident in showing your projects
Tip 2 : Don't add unnecessary things in your resume which are not related to the job, like your 10th class winning tournament certificate or managing a college society. These things didn't create any impact on your profile and takes an unnecessary space in your resume.
Tip 3 : Always make a 1-page resume. If you are making more than 1 page then it means you have added a lot of unnecessary information which are not related to the job profile.
Tip 4 : Always show your Project and Past experience on top, just after your basic info and education. Since these are the things which should be on top to showcast the skills.
Skills evaluated in this interview
I was interviewed before Sep 2020.
(2 Questions)
Round duration - 1 hour
Round difficulty - Medium
It was a 1 hour round on coding and problem solving.
- Q1.
Problem: Search In Rotated Sorted Array
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer
Qqueries. Each query is represented by an integerQ[i], and you must ... - Ans.
Step 1 : Initially I applied bubble sort.
Step 2 : The interviewer asked me to optimize the solution
Step 3 : I had to find a pivot and then sort .
Step 4 : I applied Binary search to find the pivot and then performed sort. - Q2.
Merge Two Sorted Linked Lists Problem Statement
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
... - Ans.
Step 1 : I first merged the linked list and applied sorting.
Step 2 : The interviewer asked me to optimize the solution
Step 3: I then took an empty linked list and starting adding elements by comparing the elements( as they are sorted so no need to compare one element with the complete list) of both the given linked list.
Step 4 : Then interviewer asked me to optimize space complexity.
Step 5: I took the first linked list...
Interview Preparation Tips
Tip 1 : Always try to be clear with your basic concepts .As you are a fresher , you are expected to be clear with your basic concepts such as OOPS , MySql etc and also you should be able to explain it properly to the interviewer.
Tip 2 : Practice at least 200 Questions and the best platform for preparing is LeetCode.
Tip 3 : You should be clear with your projects and the technology it involved . 2-3 Projects are enough for the interview.
Tip 1 : Make neat resume with projects and internships mentioned.
Tip 2 : Mention only those things which are true.
Tip 3 : Do mention if you won any Hackathon.
Skills evaluated in this interview
I was interviewed in Jan 2021.
(2 Questions)
Round duration - 65 minutes
Round difficulty - Hard
Timing (6pm - 8pm)
Environment was user friendly
As usual the online round had three coding questions and 20 MCQs. This was a pretty easy round and it’s duration was 65 minutes. The round consisted of questions from various domains like Algorithm, Data Structure, Operating System and Aptitude.
- Q1.
Determine Count of Good Triplets
You are given two arrays
ARR1andARR2, containingNandMelements respectively. There are two types of 'good triplets' that need to be identified in these arrays.Type ...
- Ans. Brute Force
A simple method is to generate all possible triplets and check for each triplet if the triplet follows the given conditions.
Our approach will be to traverse through ARR1 and in each iteration, we will consider all pairs from ARR2 and check if the element from ARR1 and the pair from ARR2 follow the given conditions of type 1 triplet.
To obtain type 2 triplets, we will traverse through ARR2 and we will consider...
- Q2.
Split the String Problem Statement
You are given a string
strconsisting ofNlowercase alphabets. Your task is to determine if it is possible to divide the string into three non-empty substrings such tha... - Ans. Brute-force
The idea here is to check all possible ways to divide a string into 3 substrings and check if there is a string that is a substring of the other two parts. We can divide a string into 3 non-empty substrings:
- A non-empty prefix
- A non-empty suffix
- And a non-empty middle string that is between the ending point of the 1st string and starting point of the 2nd string.
Algorithm:
- Run a loop from i = 1 to ‘N’...
(2 Questions)
Round duration - 40 minutes
Round difficulty - Medium
- Q1.
Check if Two Trees are Mirror
Given two arbitrary binary trees, your task is to determine whether these two trees are mirrors of each other.
Explanation:
Two trees are considered mirror of each other if...
- Ans. Recursive Approach
Traverse the tree T in preorder fashion and treat every node of the given tree T as the root, treat it as a subtree and compare the corresponding subtree with the given subtree S for equality. For checking the equality, we can compare all the nodes of the two subtrees.
For two trees ‘S’ and ‘T’ to be mirror images, the following three conditions must be true:
- Their root node’s data must be the sam...
- Q2.
Snake and Ladder Problem Statement
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...
- Ans. BFS
We will use Breadth-First Search to find the shortest path from cellNumber 1 to cellNumber N*N.
- We will maintain a queue of cellNumber where the front of the queue will always contain a cell which can be reached by minimum dice throw from starting cell (cellNumber = 1).
- Create a minDiceThrow array of size N*N initialise it with the maximum value (INT_MAX)
- Start with pushing cellNumber 1 and updating minDiceThrow[1] = 0...
Interview Preparation Tips
Tip 1 : Must do questions from GFG.
Tip 2 : SDE sheet of striver can be helpful.
Tip 1 : Do at least 3 major web dev project
Tip 2 : should be precise and descriptive
Tip 3 : also add your past experiences in the resume
Skills evaluated in this interview
Selected
I applied via campus placement at Kalinga Institute of Industrial Technology, Khurda and was interviewed in Sep 2023. There was 1 interview round.
3 Questions were asked out of which if you did 2 you were shortlisted for next round. Questions were mostly from topics like array, string and greedy
Interview Preparation Tips
Spinny Interview FAQs
Tell us how to improve this page.
Spinny Interviews By Designations
- Spinny Operations Analyst Interview Questions
- Spinny Business Analyst Interview Questions
- Spinny Evaluator Interview Questions
- Spinny CAR Consultant Interview Questions
- Spinny Relationship Manager Interview Questions
- Spinny Sales Analyst Interview Questions
- Spinny Software Engineer Interview Questions
- Spinny Analyst Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Senior Software Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Softwaretest Engineer Interview Questions
- Software Engineer Trainee Interview Questions
- Software Developer Interview Questions
- Software Development Engineer Interview Questions
- Junior Software Developer Interview Questions
- Show more
Spinny Software Developer Intern Interview Process
based on 1 interview
Interview experience
Software Developer Intern Interview Questions from Similar Companies
|
Operations Analyst
477
salaries
|  ₹2.2 L/yr - ₹7 L/yr |
|
Relationship Manager
248
salaries
| ₹2.5 L/yr - ₹5.1 L/yr |
|
Team Lead
189
salaries
| ₹2.8 L/yr - ₹8.5 L/yr |
|
CAR Consultant
158
salaries
| ₹2.1 L/yr - ₹4.5 L/yr |
|
Assistant Manager
148
salaries
| ₹3.6 L/yr - ₹11 L/yr |
Truebil
CarDekho
Carwale
Cartrade.com
- Home >
- Interviews >
- Spinny Interview Questions >
- Spinny Software Developer Intern Interview Questions
