Brane Enterprises Interview Experience
Four Rounds of Assessments:
Online Sections:
- Aptitude – 10 Questions
- Analytics – 10 Questions
- English – 10 Questions
- Technical – 30 Questions
Coding:
1 Question (Dynamic Programming-based, equivalent to 1700-level DP Problems on competitive programming platforms).
The multiple-choice questions were manageable, but the coding challenge posed a significant challenge.
First Technical Interview:
- Commenced with self-introduction, followed by a deep dive into Data Structures and Algorithms.
- Tasked with solving the Trapping Rainwater problem, followed by optimizing it.
- Requested to provide the time complexity proof for Merge Sort.
- Delved into Computer Science fundamentals: Transactions, Object-Oriented Programming, and its advantages.
- Presented with the Largest Rectangle in Histogram problem and asked to optimize.
- Ended with a question on Reverse Integer.
Duration: 1 hour and 15 minutes.
Second Technical Interview:
- Began with self-introduction.
- Given a task to find the length of an array without utilizing built-in functions.
- Explored Linked Lists, including finding their length and handling cycles.
- Discussed basics of Trees, Binary Trees, Binary Search Trees, and DFS.
- Presented with the Number of Islands problem.
- Requested to discuss personal projects.
Duration: 1 hour and 15 minutes.
Third Technical Interview:
- Initiated with self-introduction and project discussion.
- Challenged with the Sliding Window Maximum problem and asked to optimize.
- Presented with a movie dataset problem, where given genres, the task was to identify movies falling under those genres.
Optimized the solution using precomputation and further enhanced it.
Duration: 1 hour and 10 minutes.