Spinny Software Development Engineer Interview Questions and Answers

Topics to prepare for Paisabazaar.com Software Development Engineer interview:

• DSA
• React.Js
• SQL
• Git

Interview preparation tips for other job seekers - In interview DSA was asked. I had to write pseudo code of BFS and explain its time complexity

Interview preparation tips for other job seekers - Focus on the famous problems and SQL

Interview preparation tips for other job seekers - Just be confident and prepare well the basic questions.

Interview preparation tips for other job seekers - There will be four technical interviews
1.hackerearth round
2.problem solving round-1
3.problem solving round-2
4.Design round- where you will be asked to design an application with given requirements

Round: Resume Shortlist
Experience: Myntra had conducted a coding test on campus before the start of the placement season with 2 questions, one on stack and other on DP. The eligible branches were Computer Science & Engineering, Mathematics & Computing, Electrical Engineering and Electronics & Communication Engineering. I couldn't give the test because my branch was Engineering Physics. However, when they visited campus for interviews on day 2, everyone who had cleared their test was already placed. They looked over some resumes for interviews and decided to interview me, since i had some projects in Machine Learning and Computer Vision.
Tips: For the test, the DP question asked was pretty standard, on Longest Common Subsequence. The question on stacks, i dont remember what it was but it was also pretty straight forward. For the test, i would reommend to solve problem from geeksforgeeks. If they do come to resume shortlisting, they are looking for people who have done good projects and internships.

Round: Interview
Experience: The interview started off with questions on my general interest in Software Development. The first round had two coding questions, i was supposed to write the code on paper. The first question was to add two numbers represented by linked lists - -----/. They gave a specific input and asked me to demonstrate step by step in my code, how it would lead to the correct answer. I dont remember the second question, but it was also an easy one on linked lists.
Tips: It's ok if you can't code a general solution, if you can write a code which works for the particular input they have given then also it's ok with them. But be thorough with Data structures.

Round: Interview
Experience: I wasn't asked to write any code in this interview. They asked me some questions on Machine Learning, because of my projects in them. Then they asked me if i knew graph algorithms. Since i knew BFS and DFS, i told them. They asked the difference between the two. Then they asked me if i knew how to find the shortest distance between two points in a graph. I didn't know Djikstra's properly but i knew it worked on the greedy approach so was able to tell that. Then they asked me how would i find the second shortest path. I tried to answer it with the same greedy approach, but couldn't arrive at the complete solution.
Tips: They ask a tough theoretical question. It's ok if you don't know the answer, they only look for your approach.

Round: Interview
Experience: They asked me to code one question which was on stacks, i don't remember the question, but it was also not difficult, and i wrote the code for that. Then they started to drill me on my resume, on every project that i had done, every miniscule detail.
Tips: Be very thorough with your resume. It's a clear red flag for them if you can't explain something you have written on your resume.

General Tips: Be thorough with Data Structures and Algorithms and also with your resume.
Skill Tips: They generally stick to coding only.
Skills: Coding
College Name: IIT Guwahati
Motivation: Wanted a job in Software Development.
Funny Moments: My third round started pretty late in the night around 11:30 PM. So, had a walking interview in front of the canteen because the interviewer thought i looked tired and should have a cup of coffee.