Me postulé a través de una facultad o universidad. Acudí a una entrevista en Intuit (Bengaluru) en sept 2018
Entrevista
Coding test: Data Structures, graph problems like BFS/DFS and string manipulation.
This was followed by followed by algorithm development to play then Minesweeper game, and then tech interview process consisting of algo/pseudocode writing/design problems and answering time complexity questions etc.
Preguntas de entrevista [2]
Pregunta 1
Q. Given that you need to get a total of 23 rupees and you have 5 rupee, 2 rupee and 1 rupee coins available, what is the minimum number of coins needed and how do you find the answer?
Me postulé a través de una facultad o universidad. El proceso tomó 1 día. Acudí a una entrevista en Intuit (Bengaluru) en ago 2025
Entrevista
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.
Preguntas de entrevista [1]
Pregunta 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
Preguntas de entrevista [1]
Pregunta 1
Dynamic Programming question and sliding window question
Me postulé a través de una facultad o universidad. El proceso tomó 3 días. Acudí a una entrevista en Intuit en jul 2021
Entrevista
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.
Preguntas de entrevista [1]
Pregunta 1
DP - true or false (counting boolean paranthesizations)
DP - Partition a set into two subsets such that the difference of subset sums is minimum
