Spinny interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Spinny
3 rounds | 4 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3 months
Topics: Data Structures (Arrays, Strings, Bit Manipulation, HashMap, Sorting, Searching), Database, OOPS, Low Level Design, Web Development, Python, Django, Web server.
Tip 1 : Be confident during your interview
Tip 2 : Anything you mention on your resume -- you should ask yourself if you can talk about it for 10-15 minutes. If the answer is no, remove it from your resume. It's better to have a short resume and know everything in it.
Tip 3 : Don't lie to the interviewer, if you don't know something tell them you don't know. They'll ask something else.
Application process
Where: Linkedin
Eligibility: No
Tip 1 : Short resume + knowing everything on resume >> long resume but unknown skills on resume.
Tip 2 : Try to quantify your achievement in terms of business gains eg instead of writing I did Y and developed Y -- write Did X to develop Y which resulted in Z% improvement in some metric that's relevant to growth of the business.
Interview rounds
01
Round
Medium
Telephonic
Duration20 minutes
Interview date31 Jul 2019
Coding problem2
Asked about past experience, skills
Was asked questions on Linkedlist and Arrays
1. Move All Negative Numbers To Beginning And Positive To End
Easy
10m average time
90% success
0/40
Asked in companies
Segregate positive and negative elements in array
2. Cycle Detection in a Singly Linked List
Moderate
15m average time
80% success
0/80
Asked in companies
You are given a Singly Linked List of integers. Return true if it has a cycle, else return false.
A cycle occurs when a node's next points back to a previous node in the list.
Example:
In the given linked list, there is a cycle, hence we return true.
02
Round
Medium
Face to Face
Duration120 minutes
Interview date5 Aug 2019
Coding problem1
Questions on Data structures, logical questions like Puzzles and Low level design problem
1. Longest Increasing Subsequence
Moderate
30m average time
65% success
0/80
Asked in companies
For a given array with N elements, you need to find the length of the longest subsequence from the array such that all the elements of the subsequence are sorted in strictly increasing order.
Strictly Increasing Sequence is when each term in the sequence is larger than the preceding term.
For example:
[1, 2, 3, 4] is a strictly increasing array, while [2, 1, 4, 3] is not.
Problem approach
Solved using DP
03
Round
Medium
Face to Face
Duration30 minutes
Interview date3 Aug 2019
Coding problem1
1. System Design Question
Low level design of Url shorter
Problem approach
Tip 1 : Ask questions to clearly state requirements and expectations
Tip 2 : Create classes for all real life instances for LLD, write getter setter method definitions too, think about optimisation, choose correct database
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 4 problems
Interviewed by Spinny
Selected 
1663 views
0 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by Spinny
Selected 3107 views
7 comments
0 upvotes
SDE - 1
3 rounds | 4 problems
Interviewed by Spinny
Rejected
1528 views
0 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by Spinny
Selected 799 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 114579 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 57825 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 34961 views
7 comments
0 upvotes