Bounce interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Bounce
2 rounds | 4 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3 Months
Topics: Data Structures, Algorithms, OOPS, OS, DBMS
Tip 1 : Work on Competitive Programming skills. That is one thing most companies look out for during hiring. Solve at least 100
questions from every topic.
Tip 2 : You should have at least 2 good projects on your resume. Only write the things that you are completely sure of.
Tip 3 : Work on CS fundamentals as well like -OOPS, OS, and DBMS. There will be MCQ questions from this in the coding round as well as in the 1:1 round
Application process
Where: Referral
Tip 1 : Need at least 2 good projects on the resume. Write a short 2-3 lines summary of the project and the tech stack used.
Tip 2 : Resume should be 1 page only. Try to keep the Resume short with useful information only.
Tip 3 : Your Resume should clearly mention the skillset you have. Companies sometimes filter out Resume based on skillset only
Interview rounds
01
Round
Easy
Face to Face
Duration60 minutes
Interview date11 Jan 2021
Coding problem2
It was on zoom from 5PM.
1. Reverse The Array
Easy
15m average time
85% success
0/40
Asked in companies
Given an array/list 'ARR' of integers and a position ‘M’. You have to reverse the array after that position.
Example:
We have an array ARR = {1, 2, 3, 4, 5, 6} and M = 3 , considering 0
based indexing so the subarray {5, 6} will be reversed and our
output array will be {1, 2, 3, 4, 6, 5}.
Problem approach
We can break down the complete array into small subarrays of size k and reverse them.
2. Operating System
- What is a Thread?
- What are the differences between process and thread?
- What is Thrashing?
Problem approach
Tip 1 : You have to focus on CS Fundamentals - OS, OOPS, DBMS, CN
02
Round
Easy
Face to Face
Duration60 minutes
Interview date16 Jan 2021
Coding problem2
It was a mix round where I was asked two problems. One was a coding problem and second one was the set of some basic DBMS questions
1. Longest Subarray Zero Sum
Moderate
18m average time
85% success
0/80
Asked in companies
Given an array arr of length N consisting of positive and negative integers, return the length of the longest subarray whose sum is zero.
Problem approach
We can use hashing for this. store the sum till that index in a map. If you find same sum already present in the map then that subarray has zero sum
2. DBMS
- What is database normalization?
- What is Join?
- What is Identity?
- Some basic SQL Queries
Problem approach
Tip 1 : You have to focus on CS Fundamentals - OS, OOPS, DBMS, CN
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
4 rounds | 8 problems
Interviewed by Amazon
Selected 
8518 views
0 comments
0 upvotes
Analytics Consultant
3 rounds | 10 problems
Interviewed by ZS
Selected 907 views
0 comments
0 upvotes
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
Selected 3320 views
0 comments
0 upvotes
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
Selected 2581 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
Selected 6262 views
3 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by BNY Mellon
Selected 0 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by CIS - Cyber Infrastructure
Selected 2160 views
0 comments
0 upvotes