Me postulé a través de una facultad o universidad. El proceso tomó 1 día. Acudí a una entrevista en Intuit (Chennai) en jul 2023
Entrevista
Once you get shortlisted by INTUIT for their internship, they will put you up to a coding round first and foremost. Those who get selected in the coding round move on to interview rounds and further on.
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
Online proctored test experience
You will have to install a plugin/extension for screen sharing/screen proctoring where they can see your screen and monitor all activities in it.
Preguntas de entrevista [4]
Pregunta 1
Good array – Sub arrays with K different integers – Leetcode hard level
Minimum cost path – In 2D matrix
Kady is standing on a two-dimensional plane of size m*n square units. The plane is partitioned into unit squares. So, in total, there are m*n squares. Kady has his favorite number “X” so each time when he will jump he will take jump of “X” units.
In short, the plane can be considered a 2D matrix. Kady is currently standing at position S(p,q) where p is the pth row of the matrix and q is qth column of the matrix. Kady wants to go from his position S to his new position R(u,v) by taking jumps of exactly X units each time.
Determine if Kady can reach his destination or not. If he can reach, print the minimum number of jumps he needs to take to go from S to R.
Descriptive array question 1 – Louise is a philologist, who studies ancient languages. He came accross an ancient language whose language can be interpreted from matrix m*n of symbols. Thankfully there were exactly 26 symbols and Louise mapped each symbol to a small-case english alphabet. Louise through his research found that each valid word in the language consists of atleast 2 consecutive symbols taken horizontally left to right or vertically top to bottom from the symbol matrix.
Given a sequence of q carvings help Louise in finding if each carving is made up of valid words
Descriptive array question 2 – Yesterday thieves broke into a local jewelry store and stole some jewels. Your colleague is investigating the case and knows that the jewels were numbered from X to Y (inclusive), The numbers are distinct. However, your colleague does not know the exact values of X and Y. It is guaranteed that X is less than or equal to Y. Currently, there are N jewels in the store.
Your task is to help your colleague determine the minimum number of jewels the thieves have stolen.
Acudí a una entrevista en Intuit (Bangalore Rural)
Entrevista
started with introduction friendly interview resume discussion basic 5 10 mins procedded to dsa problem related to dfs talked throught the code and edge cases solved with an example friendly interview only 1 dsa problem as not enough time
Two rounds
First round of 45 minutes focused on a medium level DSA problem.
Second round was of 1 h 15 mins spanned across OS , OOPs and again a DSA problem ( graph related).
Me postulé a través de una facultad o universidad. El proceso tomó 1 día. Acudí a una entrevista en Intuit (Kānpur, Uttar Pradesh) en jul 2025
Entrevista
Initial coding round with four questions(easy to medium)
Two technical interview and 1 HR interview
Technical was mainly based on OOPS and there was 1 coding problem on arrays(leetcode medium), DBMS and questions on resume were also asked.
Preguntas de entrevista [1]
Pregunta 1
Object Oriented Programming and DSA(leetcode medium)
