Once you are shortlisted by Intuit for their internship, they will first put you through a coding round. Those who are selected in the coding round move on to interview rounds and further.

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 many complex data structure questions like Binary Tree/Graphs. You will get complex array/list questions, including multidimensional arrays like matrix questions. Remember to know how to get and use space-separated integers for input. You can choose between multiple languages – 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 on it.

Good array – Subarrays with K different integers – Leetcode hard level

Minimum cost path – In a 2D matrix

Kady is standing on a two-dimensional plane of size mn square units. The plane is partitioned into unit squares, for a total of mn squares.

Kady has a favorite number, "X". Each time he jumps, he will take a jump of "X" units.

In short, the plane can be considered a 2D matrix. Kady is currently at position S(p,q), where p is the row and q is the column. Kady wants to go from his position S to his destination R(u,v) by taking jumps of exactly X units each time.

Determine if Kady can reach his destination. If he can reach it, print the minimum number of jumps he needs to take.

Descriptive array question 1 – Louise is a philologist who studies ancient languages. He came across an ancient language whose interpretation comes from an m*n matrix of symbols. There are exactly 26 symbols, and Louise mapped each symbol to a lowercase English alphabet. Louise discovered that each valid word consists of at least 2 consecutive symbols taken horizontally from left to right or vertically from top to bottom within the symbol matrix.

Given a sequence of q carvings, help Louise determine 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), and 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.