Me postulé a través de otra fuente. El proceso tomó 2 días. Acudí a una entrevista en Flipkart (Bangalore Rural) en ene 2025
Entrevista
The interview started with an introduction followed by two DSA questions. The first question was to merge two linked lists, which was an easy question.
The second was a backtracking question, which required dfs implementation. It was about printing the path to reach from top left to bottom right,t while you can travel in all four directions.
Preguntas de entrevista [1]
Pregunta 1
The first question was to merge two linked lists, which was an easy question.
The second was a backtracking question, which required dfs implementation. It was about printing the path to reach from top left to bottom right,t while you can travel in all four directions.
Me postulé a través de una facultad o universidad. El proceso tomó 1 día. Acudí a una entrevista en Flipkart (Bhubaneshwar) en oct 2025
Entrevista
First round 3 questions 1hr 30min time
round 2 sort the stack without using extra space and next question is give the length of the last word in a string
many questions regarding my projects and simple dbms questions like what is meant by indexing
Preguntas de entrevista [1]
Pregunta 1
explain the logicfirst clearly and go to coding part next
Me postulé a través de una facultad o universidad. El proceso tomó 2 días. Acudí a una entrevista en Flipkart (Hyderabad) en oct 2025
Entrevista
There are 2 rounds - one is coding round. Questions are of easy to medium level
1)Find LCA in binary tree
2)given an array of prime numbers and a positive integer k, consider a array of numbers whose prime factors consists of only primes given in the prime numbers list. Return the kth(1-based indexing) smallest element of the array
Preguntas de entrevista [1]
Pregunta 1
Second round is for testing software knowledge
They asked me to design minimal version of twitter. Design schema and queries based on that schema.