Shipsy interview experience Real time questions & tips from candidates to crack your interview
Software Engineer
Shipsy
2 rounds | 2 Coding
problems
Selected Interview preparation journey
Journey
The whole process was so exciting. I had 4 interview rounds, and each was an elimination round. Out of 160 people from our batch, I was the only one selected for the Software Engineer role at Shipsy. It feels like my 4 years of hard work have finally paid off.
Application story
I applied for my college placements. First, they shortlisted 40 candidates out of 160 based on CGPA. Then, we had an OOPS round, which was an elimination round. After that, we had 2 DSA rounds, where only 2 of us were selected for the final round. The last round was a Project Discussion round, and I finally cleared it.
Why selected/rejected for the role?
I was very calm and composed in all the rounds, and I was very interactive with the interviewer. I asked a lot of follow-up questions until I had full clarity on the problem. I believe this is what helped me get selected.
Preparation
Duration: 12 Months
Topics: OOPS, Data Structures, DBMS, Operating System, Dynamic Programming
Tip 1: Be consistent.
Tip 2: Always make notes of important topics, especially core subjects.
Tip 3: You need to explain your approach properly and confidently in interviews (attending mock interviews is a must for this).
Application process
Where: Campus
Eligibility: 8.5 CGPA, (Salary Package: 20 LPA)
Tip 1: Have good projects.
Tip 2: If you have prior internship experience, it's a plus point.
Interview rounds
01
Round
Medium
Video Call
Duration40 minutes
Interview date20 Apr 2024
Coding problem1
They gave me a pseudocode for an OOPS question and asked me to complete it.
1. Need to arrange chair based on its priority
Problem approach
1. First, I sorted the elements and stored them in a map, returning the result whenever the function is called (Brute Force).
2. The best approach I suggested is using a priority queue and a map to return the top element.
02
Round
Medium
Video Call
Duration60 minutes
Interview date23 Apr 2024
Coding problem1
I have given a coding question, each with 45 minutes to solve and implement.
1. Binary Tree Maximum Path Sum
Moderate
20m average time
80% success
0/80
Asked in companies
You are given a binary tree with ‘N’ nodes.
Your task is to find the “Maximum Path Sum” for any path.
Note :
1. A ‘path’ is a sequence of adjacent pair nodes with an edge between them in the binary tree.
2. The ‘path’ doesn’t need to pass through the root.
3. The ‘path sum’ is the sum of the node’s data in that path.
Problem approach
I solved this by keeping track of the maximum distance at all times, and whenever the sum of the path becomes negative, I reset it to 0.
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 | 7 problems
Interviewed by OYO
Selected 
4656 views
0 comments
0 upvotes
SDE - 1
1 rounds | 3 problems
Interviewed by Shipsy
Rejected
2785 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
Rejected
6450 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3451 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
Selected 7873 views
1 comments
0 upvotes
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
Selected 9972 views
1 comments
0 upvotes
Software Engineer
2 rounds | 4 problems
Interviewed by Amazon
Selected 4309 views
1 comments
0 upvotes