Pretty Complicated as started off with basics of array and projects accomplished but then some tricky concept of DAA , which were rough to catch up with.
So, just be clear with basics and know the role applying for .
Questions d'entretien [1]
Question 1
K distance sort
N-1 elements in an array from 1 to n, find the missing one
LRU cache implementation using array, stack/queue, doubly linked list, circular linked list, Hash map
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 1 jour. J'ai passé un entretien chez Flipkart (Bhubaneshwar) en oct. 2025
Entretien
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
Questions d'entretien [1]
Question 1
explain the logicfirst clearly and go to coding part next
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 2 jours. J'ai passé un entretien chez Flipkart (Hyderâbâd) en oct. 2025
Entretien
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
Questions d'entretien [1]
Question 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.