Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Flipkart (Bengaluru) nel mese di ago 2021
Colloquio
Round 1 started with 3 questions, all of them was from dp, and one of the questions were from graph.
2nd question was string operation questions,
and third question was a hard variant of coin exchange problem.
Domande di colloquio [1]
Domanda 1
Dynamic Programming, String Match Operation and Coin Exchange similar problem.
started with self intro, then oops concepts and the projects i did. later,2 coding questions 1 array and 1 string solved array problem
Array problem -return true if the array is strict mountain else false
Domande di colloquio [1]
Domanda 1
OOPS concepts, projects and problem solving
Array problem -return true if the array is strict mountain else false
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Flipkart (Nuova Delhi) nel mese di ago 2025
Colloquio
Round 1 :
1. Find the longest substring with non repeating characters.
2. Find the longest subarray with sum equals 0.
Round 2 :
Mostly HR based, and Resume Grilling.
Domande di colloquio [1]
Domanda 1
1. What is bubbling in Javascript ?
2. What is variable hoisting ?
3. How does HashMap work ?
