J'ai postulé via un recruteur. Le processus a pris 1 jour. J'ai passé un entretien chez Intuit en oct. 2012
Entretien
two phone interview, one is for technical, one is for behavior. The technical question is easy , just some basic questions about java and one simple algorithm problem. The behavior question is a little difficult and weird. Java question is very basic concept question and the algorithm question is also very easy one.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 1 jour. J'ai passé un entretien chez Intuit (Bengaluru) en août 2025
Entretien
It was on college opporutunity, consisting of one OA and 2 interview rounds. OA had 4 questions, easy. Interviews concentrated on DSA and projects we developed. First round lasted 45min and second round lasted 1hr 15min.
Questions d'entretien [1]
Question 1
A dsa questions on graphs and another design a data structure question.
it was good supportive and difficult. dsa, dev, puzzles, os, dbms was asked
Coding round
Consists of: 4 QUESTIONS to be solved in 90 minutes
Each question is of Leetcode Medium/Hard level.
You might not get as much of complex data structure questions like Binary tree/Graphs
You will get complex array/list questions including multidimentional arrays like matrix questions.
Remember to know how to get and use space seperated integers for input
You can choose between multiple langauges – Python, Java, C++ etc
Questions d'entretien [1]
Question 1
Dynamic Programming question and sliding window question
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 3 jours. J'ai passé un entretien chez Intuit en juil. 2021
Entretien
First an online coding round was conducted. It consisted of 4 coding questions. All are of medium to hard difficulty level.
Only a few students were shortlisted. I have solved just 1 dp problem fully , and another string problem partially.
Questions d'entretien [1]
Question 1
DP - true or false (counting boolean paranthesizations)
DP - Partition a set into two subsets such that the difference of subset sums is minimum