Hi Everyone My Name is Piyush Kumar, You can connect with me Here.
I am sharing my interview experience with Brane Enterprises from college placement.
Total 4 rounds:
There was 4 section and it was online sections:
Aptitude – 10 Questions
Analytics – 10 Questions
English – 10 Questions
Technical - 30 Questions
Coding – 1 Question (It was a DP-based problem)
The MCQ part was easy but the Coding one was a Hard DP problem ( Equivalent to 1700 DP Problems on Codeforces).
Whoever had solved the coding questions was selected for the interview round.
From 110 students 17 students were selected for the next round.
1st Technical Interview: -
After this Round 11 students were selected for the next round.
2nd Technical Interview: -
After this round 10 students were selected for the next and final round.
3rd Technical Interview: -
Interview started with my Intro.
He then asked me to open projects and discussed the projects with me about the tech stack.
After that he asked Sliding Window Maximum I firstly gave brute force approach and then he asked me to optimize that and write code also on any local or online compiler.
After that he asked me the question: -
Given a set of movie dataset given the genre of movies also and you are given the input as set of genre you need to tell which movies come under this genre
Input: -

I told him the brute force one then he told me to optimize that I did using map by storing all the genre and done some precomputation also and I did in time complexity of O(K*NlogN).
But he asked me to optimize further and I tried but I was not able to come up with more optimized approach and till now I am not able to solve this question I once tried to solve this using Trie data structures but unable to do that also.
If anyone get the intuition of this problem feel free to answer.
Interview lasted about 1 hour 10 minutes
After this round 4 students were finally selected.
Final Verdict - Rejected