Zippin interview experience Real time questions & tips from candidates to crack your interview

Software Engineer

Zippin
upvote
share-icon
2 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
I was in my final year of college when companies came for campus recruitment, and I was preparing for my placement, so I learned many topics like Data Structures, SQL queries, DBMS, Java, Python, JavaScript, etc. I applied to many companies, but due to the recession, the company that offered me a position backed out.
Application story
"I applied on the company portal and received a test from Code Signal Assessment. After a few days, I received a call from the interviewer for interviews.
Why selected/rejected for the role?
After the first round of interviews, I tried reaching out to HR, but she told me that due to no requirement, they will not be moving forward.
Preparation
Duration: 5 months
Topics: Data Structures, Algorithms, OOPS, Dynamic Programming
Tip
Tip

Tip 1: You know what your role is, so it's important to have basic knowledge and concepts cleared.
Tip 2: Linux is the base and foundation for the role, so practice basic commands in different Linux flavors.
Tip 3: Be honest.

Application process
Where: Company Website
Eligibility: Good development Skills in backend
Resume Tip
Resume tip

Tip 1: Have at least two good projects explained briefly with all important points covered. 

Tip 2: Every skill must be mentioned. 

Tip 3: Focus more on skills, projects, and experiences.

Interview rounds

01
Round
Easy
Online Coding Test
Duration70 minutes
Interview date2 Sep 2022
Coding problem2

I was given 70 minutes to solve two good level coding problems. I completed in 40 minutes and submitted the test.

1. Sum of minimum and maximum elements of all subarrays of size “K”

Moderate
25m average time
75% success
0/80
Asked in companies
AmazonCultfitNagarro Software

You are given an array consisting of N integers, and an integer, K. Your task is to determine the total sum of the minimum element and the maximum element of all subarrays of size K.

Note :

The array may contain duplicate elements.
The array can also contain negative integers.
The size of the array is at least 2.
There exists at least one such subarray of size k.
Try solving now

2. Maximum XOR

Hard
10m average time
90% success
0/120
Asked in companies
Red HatErnst & Young (EY)Zippin

You are given two arrays of non-negative integers say ‘arr1’ and ‘arr2’. Your task is to find the maximum value of ( ‘A’ xor ‘B’ ) where ‘A’ and ‘B’ are any elements from ‘arr1’ and ‘arr2’ respectively and ‘xor’ represents the bitwise xor operation.

Try solving now
02
Round
Medium
Video Call
Duration60 minutes
Interview date8 Sep 2022
Coding problem3

Technical interview round with questions mainly based on DSA and some questions on past experiences as well. Two coding questions were also asked.

1. Gas Stations

Moderate
10m average time
90% success
0/80
Asked in companies
AtlassianGoldman SachsAmazon

You have been given a circular path. There are 'N' petrol pumps on this path that are numbered from 0 to N - 1 (Both inclusive). Each petrol pump has two values associated with it:

1)The amount of petrol that is available at this particular petrol pump.
2)The distance to reach the next petrol pump.

You are on a truck having an empty tank of infinite capacity. You can start the tour from any of the petrol pumps. Your task is to calculate the first petrol pump from where the truck will be able to complete the full circle or determine if it is impossible to do so.

You may assume that the truck will stop at every petrol pump and it will add the petrol from that pump to its tank. The truck will move one kilometre for each litre of petrol consumed.

Try solving now

2. 3Sum

Moderate
15m average time
85% success
0/80
Asked in companies
IntuitSamsungGrofers

You are given an array/list ARR consisting of N integers. Your task is to find all the distinct triplets present in the array which adds up to a given number K.

An array is said to have a triplet {ARR[i], ARR[j], ARR[k]} with sum = 'K' if there exists three indices i, j and k such that i!=j, j!=k and i!=j and ARR[i] + ARR[j] + ARR[k] = 'K'.

Note:
1. You can return the list of values in any order. For example, if a valid triplet is {1, 2, -3}, then {2, -3, 1}, {-3, 2, 1} etc is also valid triplet. Also, the ordering of different triplets can be random i.e if there are more than one valid triplets, you can return them in any order.
2. The elements in the array need not be distinct.
3. If no such triplet is present in the array, then return an empty list, and the output printed for such a test case will be "-1".
Try solving now

3. Technical Questions

Tell me about your past work experiences.

Tell me about your projects.

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
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
4656 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
960 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
6450 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3451 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
7873 views
1 comments
0 upvotes
company logo
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
9972 views
1 comments
0 upvotes
company logo
Software Engineer
2 rounds | 4 problems
Interviewed by Amazon
4309 views
1 comments
0 upvotes