Candidatei-me por meio de uma faculdade ou universidade. O processo levou 1 dia. Fui entrevistado pela Flipkart (Bengaluru) em ago. de 2021
Entrevista
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.
Perguntas de entrevista [1]
Pergunta 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
Perguntas de entrevista [1]
Pergunta 1
OOPS concepts, projects and problem solving
Array problem -return true if the array is strict mountain else false
Candidatei-me por meio de uma faculdade ou universidade. O processo levou 1 dia. Fui entrevistado pela Flipkart (Nova Deli) em ago. de 2025
Entrevista
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.
Perguntas de entrevista [1]
Pergunta 1
1. What is bubbling in Javascript ?
2. What is variable hoisting ?
3. How does HashMap work ?
