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

Software Engineer

BirdEye
upvote
share-icon
5 rounds | 9 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 6 months
Topics: Data structures, OOPS, DBMS, CN, OS, Low level design
Tip
Tip

Tip 1 : Data Structures must be at top priority
Tip 2 : Must know some basic low level design
Tip 3 : Computer science fundamentals and resume should be prepared well

Application process
Where: Campus
Eligibility: 6 CGPA
Resume Tip
Resume tip

Tip 1 : Good projects with web development or machine learning
Tip 2 : Must mention your coding profiles

Interview rounds

01
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date23 Mar 2022
Coding problem2

Some MCQs and  2 coding question were asked

1. Count Number Of Ways To Cover A Distance

Easy
15m average time
85% success
0/40
Asked in companies
OlaCIS - Cyber InfrastructureNagarro Software

Divyansh is in Dhanbad and wants to travel to different places. He can take one, two or three steps at max while travelling. He knows the distance and wants to find the number of ways to reach his destination. He is weak at calculations and wants your help in this. Given the distance from Dhanbad to his destination, count the total number of ways to cover the distance with 1, 2 and 3 steps.

Problem approach

Think of recursive solution
Then optimise the code

Try solving now

2. Minimum Subarray With Required Sum

Moderate
18m average time
85% success
0/80
Asked in companies
CIS - Cyber InfrastructureMicrosoftFacebook

You have been given an array(ARR) of positive integers and an integer X. You have to find the minimum length subarray such that the sum of all of its elements is strictly greater than the given integer X.

Note:
A subarray is a contiguous block of elements that can be formed by deleting some (possibly zero) elements from the beginning or the end of the original array. 
For example :
If the given array is [1, 2, 3, 4, 5], then [2, 3, 4], [1, 2], [5] are some subarrays while [1, 3], [2, 3, 5] are not.

If there are multiple subarrays with minimum length, find one which appears earlier in the array (i.e. subarray that starts with lower index).

If there is no such subarray, print an empty line.
Problem approach

A simple solution is to use two nested loops. The outer loop picks a starting element, the inner loop considers all elements (on right side of current start) as ending element. Whenever sum of elements between current start and end becomes more than the given number, update the result if current length is smaller than the smallest length so far. 

Try solving now
02
Round
Medium
Face to Face
Duration60 minutes
Interview date24 Jun 2022
Coding problem2

It was mainly focused on DSA two coding questions from DSA were asked

1. Longest Increasing Subsequence

Moderate
30m average time
65% success
0/80
Asked in companies
PhonePeChegg Inc.Barclays

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

Suggest basic recursive approach first
Then try to optimise the code

Try solving now

2. Trapping Rain Water

Moderate
15m average time
80% success
0/80
Asked in companies
RazorpayMorgan StanleyUber

Basic standard array problem.. Can be solved using stack

Problem approach

It is a famous question so apply the approach which I practised for this question

Try solving now
03
Round
Medium
Face to Face
Duration60 minutes
Interview date25 Jun 2022
Coding problem2

One DSA question and one system design problem

1. Permutations

Moderate
10m average time
90% success
0/80
Asked in companies
CIS - Cyber InfrastructureCventBirdEye

Basic recursion problem with hashing as optimisation for unique permutations

Problem approach

Used recursion to solve this question

Try solving now

2. System Deisgn

Suggesting low level design for parking lot

Problem approach

Tip 1 : Practice System Design Questions
Tip 2 : Go through online platforms for most asked system design questions

04
Round
Easy
Face to Face
Duration60 minutes
Interview date26 Jun 2022
Coding problem2

One problem from System Design and one puzzle was asked in this round.

1. System Design

Design chat application

Problem approach

Tip 1 : Practice System Design Questions
Tip 2 : Go through online platforms for most asked system design questions

2. Puzzle

Water Mug Puzzle

 

We have two water jugs, one measures 4 Gallons (4G) while the other measure 9 Gallons (9G). But there is no measuring label mentioned on either of these two jugs i.e. we cannot know the exact amount filled in the jug. Now, assuming there is an infinite amount of water supply, can we measure all 1G, 2G, 3G…….. up to 9G using these unmarked jugs.

Problem approach

Tip 1 : Listen to the problem patiently
Tip 2 : First think in your mind before giving answer

05
Round
Easy
HR Round
Duration20 minutes
Interview date26 Jun 2022
Coding problem1

It was a HR Round. I got the selection letter after this round. Interviewer was very friendly

1. Basic HR Questions

  • Introduce yourself
  • What are your strengths and weakness?
  • How do you think one can overcome his weakness?
  • Why do you want to join Birdeye?
  • Explain the working of your project
Problem approach

Tip 1 : Stay honest
Tip 2 : Reply with confidence, there should be no hesitation

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
Backend Developer
4 rounds | 7 problems
Interviewed by BirdEye
2624 views
1 comments
0 upvotes
company logo
Software Backend Engineer
3 rounds | 7 problems
Interviewed by BirdEye
0 views
0 comments
0 upvotes
company logo
Software Engineer
4 rounds | 4 problems
Interviewed by BirdEye
1440 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3452 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
7874 views
1 comments
0 upvotes
company logo
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
9973 views
1 comments
0 upvotes
company logo
Software Engineer
2 rounds | 4 problems
Interviewed by Amazon
4310 views
1 comments
0 upvotes