Birst India Interview Experience
Interview Experience
Total 5 rounds: Cleared 3 and reached upto 4 round and then got
rejected :(.1st Round : 20 MCQ 45 mins with 1 min/2 min dedicated question wise. ============Got 85% correc...
Full Details
Total 5 rounds: Cleared 3 and reached upto 4 round and then got
rejected :(. 1st Round : 20 MCQ 45 mins with 1 min/2 min dedicated question wise. ============ Got 85% correct and selected for Next telephonic round. 2nd Round: Telephonic Interview mostly on Java and use of multi-threading/logical =========== Q) How will you save Blogs & Comments & Sub-comments in a database? Q) What is serialversionUID ? How will you transfer Objects between two different Objects in Java (Answer: Serialization) ? How will ensure the version of transferred object is same across both the systems? Q) How Hashmap works in java? Q) How ArrayList work in java? Q) You have two large files having GB's of data. How quickly compare them and tell if they have identical data? 3rd Round : Online Test ============ Q) Design an application which stores millions of key-value pairs and uses commands to create,retrieve,update,delete,retrieve all key-value pairs.
Sample example(CREATE , GET , UPDATE , DELETE, GETALL,QUIT are commands): Enter Commands: CREATE FOOD = APPLE GET FOOD APPLE CREATE FOOD = BANANA ## Key 'FOOD' already exists ## UPDATE WEATHER = RAIN ## Key 'WEATHER' does not exist ## CREATE WEATHER = SUN DELETE FOOD GET FOOD ## Key 'FOOD' does not exist ## GET WEATHER SUN GET ALL ## Key 'ALL' does not exist ## QUIT Further add following functionalities/Enhancements if possible: 1) Adding key hierarchy support such as food/meal/dinner & food/snack/midnight etc.. 2) Adding Cache mechanism. 3) Reading commands and key value pairs from File instead of console.
Solution : I used Trie DS(and not Tree DS) to accomplish this and the 1st enhancement is very easy with this DS with less memory usage. Here is the code for reference in test.zip Q) Given an array in ascending followed by descending order. Find out the max from the array? 4th round: Call from US , Online Live whiteboard test =========== Q) Given an array in ascending followed by descending order. Find out the max from the array in less than O(N) complexity. Could not complete this and got
rejected :(
About This Question
This is a candidate experience report from a birst india interview for a data science role during the oa round reported in 2025.
It covers the following topics: Trees, Arrays, Sql, Trie, Hash Table .
Difficulty rating: Easy
Topics
About Birst India Interview Reports
This question was reported by a candidate who interviewed at Birst India. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.
Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Birst India are the higher-signal extractions to take from this report.
For broader preparation context, the Birst India interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.
How To Practice This Type of Question
Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.
Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Birst India reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Birst India Round
Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.
The single most predictive failure mode in Birst India reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.