BirdEye interview experience Real time questions & tips from candidates to crack your interview
Backend Developer
BirdEye
4 rounds | 4 Coding
problems
Selected Interview preparation journey
Journey
I started my coding journey around 4 years back. Since then I've been practicing DSA almost regularly by solving questions and participating in contests, mostly because I love solving challenging and logical problems. Currently, I have a streak of 1150+ days on coding platforms.
Application story
I reached out to a friend working at BirdEye and asked for a referral. After the referral, I received an email from HR within 2 days for an online test, which I needed to complete within a week.
Why selected/rejected for the role?
I had a good grasp of DSA and OOP concepts.
I optimized my code to such a level (in terms of both space and time) that even the interviewer did not expect.
Additionally, I had a strong project on my resume, which I explained well to the interviewer.
Preparation
Duration: 1 month
Topics: DSA - Arrays, Linked List, Stacks, Queues, Heaps, Dynamic Programming, OOPs, DBMS, SQL, Spring Boot
Tip 1: You must have a good understanding of DSA.
Tip 2: Knowledge of DBMS, SQL, and Spring Boot (if you are applying for a Java Developer position) is an advantage.
Tip 3: You must know OOPs in the language you are applying for.
Application process
Where: Referral
Eligibility: Good knowledge of DSA, OOPs, SQL, DBMS + Having some projects in Resume.
Tip 1: Add at least one good project to your resume, one that you understand and have in-depth knowledge about.
Tip 2: Keep your resume to a single page with proper formatting.
Tip 3: Include only the skills and tools you know well and can confidently answer questions about.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration75 minutes
Interview date2 Jul 2022
Coding problem2
It was an online coding round, which had:
1.) 10 MCQ questions
2.) 1 DSA question
3.) 1 SQL question
1. Maximum Sum Circular Subarray
Moderate
10m average time
90% success
0/80
Asked in companies
Find the maximum sum of a circular subarray. The subarray may be non-contiguous in the original array.
Problem approach
1. Unlike the standard Kedane algorithm, I ran the loop to twice the size of the array, instead of just once.
2. Then for the indices, that exceeded the size of the array, just take the modulo with size, and then the logic is the same as Kedane's.
2. SQL Query
There were 2 tables from which we needed to write a nested query, with some conditions and fetch the data. (Learn)
Problem approach
1. Understood and wrote the requirements of the question.
2. Approached backwards to the solution - wrote the structure of SQL query, then the data required and finally the conditions.
02
Round
Medium
Video Call
Duration60 minutes
Interview date12 Jul 2022
Coding problem1
1.) Brief introduction
2.) 1 DSA question based on Greedy + Array
3.) Questions based on OOPs in Java, DBMS
1. Frog Jump
Easy
30m average time
60% success
0/40
Asked in companies
You are given a 0-indexed integer array of stones sorted in strictly increasing order representing the positions of stones in a river. A frog, initially on the first stone, wants to travel to the last stone and then return to the first stone. However, it can jump to any stone at most once. The length of a jump is the absolute difference between the position of the stone the frog is currently on and the position of the stone to which the frog jumps. More formally, if the frog is at stones[i] and is jumping to stones[j], the length of the jump is |stones[i] - stones[j]|. The cost of a path is the maximum length of a jump among all jumps in the path. Return the minimum cost of a path for the frog.
Problem approach
1.) I first thought that to minimize the jump size, we should use every stone.
2.) Then I told the interviewer that if we leave more than one stone for a jump, then it will not minimize the answer, so we should use alternate rocks on both traversals.
03
Round
Medium
Video Call
Duration45 minutes
Interview date15 Jul 2022
Coding problem1
1.) Managerial round.
2.) Brief introduction
3.) 1 DSA question based on Linked List. The interviewer didn't ask me to code but just think about the logic.
4.) Some questions based on Java OOPs + DBMS
1. Delete Node In A Linked List
Easy
15m average time
80% success
0/40
Asked in companies
You are given a node in a linked list (having the next pointer, node value as objects in the class), which you need to delete. (Not given any head, just that node).
Problem approach
I was thinking about how can I use all of the given data. Whether we can use the next pointer in some way.
We just need to assign the value of the next node the the given node, then move that node forward, and then keep doing the same until the end of the linked list.
04
Round
Easy
Video Call
Duration30 minutes
Interview date28 Jul 2022
Coding problem0
1.) Director round.
2.) Brief introduction.
3.) Asked some questions from my resume.
4.) Asked about my role in my previous internship.
5.) Asked about my projects and the motivation behind them.
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
Backend Developer
4 rounds | 7 problems
Interviewed by BirdEye
Selected 
2624 views
1 comments
0 upvotes
SDE - 1
3 rounds | 3 problems
Interviewed by BirdEye
Selected 2128 views
0 comments
0 upvotes
Software Backend Engineer
3 rounds | 4 problems
Interviewed by BirdEye
Selected 2887 views
0 comments
0 upvotes
Software Backend Engineer
3 rounds | 6 problems
Interviewed by BirdEye
Selected 827 views
0 comments
0 upvotes