Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso Intuit (Bengaluru) nel mese di set 2018
Colloquio
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.
Domande di colloquio [2]
Domanda 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?
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Intuit (Bengaluru) nel mese di ago 2025
Colloquio
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.
Domande di colloquio [1]
Domanda 1
A dsa questions on graphs and another design a data structure question.
Ho sostenuto un colloquio presso Intuit (Bengaluru)
Colloquio
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
Domande di colloquio [1]
Domanda 1
Dynamic Programming question and sliding window question
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 3 giorni. Ho sostenuto un colloquio presso Intuit nel mese di lug 2021
Colloquio
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.
Domande di colloquio [1]
Domanda 1
DP - true or false (counting boolean paranthesizations)
DP - Partition a set into two subsets such that the difference of subset sums is minimum