BankBazaar.com Interview Experience | Set 7 (For Senior Android Developer)
Question Details
Position : Senior Android DeveloperThe competency would be Tech Fit (Problem Solving, Data Structures Algorithm) First Round:Telephonic Round:1. Clone a linked list with ...
Full Details
Position : Senior Android Developer The competency would be Tech Fit (Problem Solving, Data Structures & Algorithm) First Round: Telephonic Round: 1. Clone a linked list with next and random pointer https://www.geeksforgeeks.org/ a-linked-list-with-next-and- arbit-pointer/ 2. You have to design a data structure where you have a list. You need to do 3 operations 1. Insert at position. 2. Get Value from an index. 3. Update all index All in time complexity O(1). Hint : I have used count for each index and have extra variable to store value if user call Update all index. With the help of count you can determine if you have to pick value from index or from extra update variable. On-site round in banglore Second round: 1. Question related to project. 2.We have n cards with each card numbered from 1 to n. All cards are randomly shuffled. We are allowed only operation MoveCard(n) which moves the card with value n to the top of the pile. We need to sort the pile of cards with minimum number of MoveCard operations. The naive approach which i can think of is start with MoveCard(n), MoveCard(n-1), MoveCard(n-2).... MoveCard(1). This approach will solve the problem in n MoveCard operations. https://stackoverflow.com/questions questions/21852309/sort-a- deck-of-cards-with-minimum- number-of-moves Third Round: 1. It was the variation of tree Common Ancestor problem and linked-list Y node problem. I don't remember exactly but if you know these two you will be able to answer. 2. Longest Increasing Subsequence https://www.geeksforgeeks.org/ dynamic-programming-set-3- longest-increasing- subsequence/ Fourth Round: 1. 100 people are standing in a circle with gun in their hands. 1 kills 2, 3 kills 4, 5 kills 6 and so on till we are left with only one person. Who will be the last person alive. Write code to implement this efficiently. 2. java circular dependency questions. 3. Some basic questions 4. Write a program with two threads (A and B), where A prints 1 , B prints 2 and so on until 50 is reached. Thanks GFG Related Practice Problems Clone a linked list with next and random pointer Sort the pile of cards Longest Increasing Subsequence All Practice Problems for BankBazaar !
About This Question
This is a reported interview question from a bankbazaar interview for a android role (senior level) during the onsite round reported in 2025.
It covers the following topics: Linked List, Trees, Dynamic Programming .
Difficulty rating: Easy
Topics
More Bankbazaar Interview Questions
About Bankbazaar Interview Reports
This question was reported by a candidate who interviewed at Bankbazaar. 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 Bankbazaar are the higher-signal extractions to take from this report.
For broader preparation context, the Bankbazaar 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 Bankbazaar reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Bankbazaar 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 Bankbazaar 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.