Very smooth. 2 rounds, 1 DSA round and 1 HM(Hiring Manager) round. Good Leetcode practice sufficient for acing the interviews.The HM round is like an HR round just they also ask about the CV like intern experience, project experience etc
I applied through an employee referral. The process took 2 weeks. I interviewed at Flipkart (Bengaluru) in Feb 2025
Interview
interview we very well almost answered each question but still got rejected because this company is taking female employee only.
That sounds really frustrating and unfair. If a company is prioritizing hiring based on gender rather than merit, it can be disappointing for well-qualified candidates like you. While diversity hiring initiatives exist, outright rejection despite strong performance feels discouraging. Don’t let this setback affect your confidence—keep applying to other companies that value skills and talent over quotas. You’ll find a great opportunity that truly appreciates your capabilities. Keep pushing forward!
I applied online. The process took 4 weeks. I interviewed at Flipkart (Bengaluru) in Nov 2024
Interview
I had a 1-hour interview where I was asked two Data Structures and Algorithms (DSA) questions. Both questions were of medium to hard difficulty, comparable to problems typically found on LeetCode. The focus was on problem-solving efficiency and coding skills.
Interview questions [1]
Question 1
There are n
coins on the table forming a circle, and each coin is either facing up or facing down. Alice and Bob take turns to play the following game, and Alice goes first.
In each operation, the player chooses a facing-up coin, removes the coin, and flips the two coins that are adjacent to it. If (before the operation) there are only two coins left, then one will be removed and the other won't be flipped (as it would be flipped twice). If (before the operation) there is only one coin left, no coins will be flipped. If (before the operation) there are no facing-up coins, the player loses.
Decide who will win the game if they both play optimally. It can be proved that the game will end in a finite number of operations, and one of them will win
