Filter interviews by
I was interviewed in Mar 2022.
Round duration - 60 minutes
Round difficulty - Medium
Interview held in working timing. They make you comfortable so that you do not feel nervous.
Design a system like Pastebin for sharing text snippets
Use a web application framework like Django or Flask for the backend
Store text snippets in a database with unique URLs for each snippet
Implement user authentication and permissions for private and public sharing
Include features like syntax highlighting, expiration dates, and password protection
Optimize for fast and efficient text retrieval and storage
Round duration - 60 minutes
Round difficulty - Medium
Standard Problem solving round
Given a binary tree consisting of integers, your task is to provide the boundary nodes of this tree in an anti-clockwise direction, starting with the ro...
Boundary traversal of a binary tree to find left boundary, right boundary, and leaf nodes in an anti-clockwise direction.
Perform a pre-order traversal to get the left boundary nodes
Perform an in-order traversal to get the leaf nodes
Perform a post-order traversal to get the right boundary nodes
Combine the results in the required order to get the boundary nodes
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use backtracking to generate all valid combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Recursively build the combinations by adding open parentheses if there are remaining, and then adding close parentheses if the number of open parentheses is greater than the numbe...
Round duration - 60 minutes
Round difficulty - Medium
This round was a mix of design and data structures
Given an integer array/list arr
and an integer 'Sum', determine the total number of unique pairs in the array whose elements sum up to the given 'Sum'.
The first line c...
Count the total number of unique pairs in an array whose elements sum up to a given value.
Use a hashmap to store the frequency of each element in the array.
Iterate through the array and for each element, check if (Sum - current element) exists in the hashmap.
Increment the count of pairs if the complement exists in the hashmap.
Divide the count by 2 to avoid counting duplicates like (arr[i], arr[j]) and (arr[j], arr[i])
Round duration - 30 minutes
Round difficulty - Medium
Standard managerial round
Tip 1 : Practice every topic and company related questions of each topic
Tip 2 : Practice system design well
Tip 1 : Keep it short
Tip 2 : Showcase your work by highlighting the impact that it had
I applied via Referral and was interviewed before Mar 2023. There were 4 interview rounds.
Coding platform with problem solving skill
Design an event driven scheduler for managing tasks and events.
Use a message queue system to handle incoming events and tasks.
Implement event listeners to trigger actions based on specific events.
Utilize a scheduling algorithm to prioritize and manage tasks.
Include error handling mechanisms to handle failures gracefully.
I applied via LinkedIn and was interviewed in Jul 2022. There were 2 interview rounds.
4 question, highly proctored, have to be very carefull
I applied via Campus Placement and was interviewed before Jun 2023. There were 3 interview rounds.
Basic aptitude easily to moderate simple
Dsa basics only no need to worry
Advanced DDA trees dp various topics
Intuit interview questions for popular designations
I applied via LinkedIn and was interviewed in Jun 2021. There were 4 interview rounds.
Get interview-ready with Top Intuit Interview Questions
I applied via Approached by Company and was interviewed before Feb 2023. There was 1 interview round.
Make e-commerce website design.
I applied via LinkedIn and was interviewed in Dec 2021. There were 4 interview rounds.
Coding Test
Assignment
I was interviewed in Feb 2021.
Round duration - 90 Minutes
Round difficulty - Medium
Timing: 6 PM to 7:30 PM IST
Environment: Test took place on Hackerrank. The test was proctored.
Details: 4 questions with varying difficulty were there. Partial score was allowed.
In this problem, you are given a grid of size N*M containing two types of people: type ‘A’ and type ‘B’. You are given the number of people of each type: 'countA' denotes the num...
Given a grid with type A and B people, maximize satisfaction based on neighbors.
Start with type A people for maximum satisfaction
Optimally place people to maximize satisfaction
Consider satisfaction levels for each type of person and their neighbors
In this game, you are given a collection of 'N' numbers. The objective is to minimize the total penalty incurred while playing by following these steps:
The objective is to minimize total penalty by selecting two numbers, summing them, and accumulating the penalty until only one number remains.
Iteratively select two numbers, sum them, and accumulate the penalty until only one number remains.
Choose the two smallest numbers to minimize the penalty.
Repeat the process until only one number remains to find the minimum possible penalty.
You are given a Binary Tree, and you need to determine the length of the diameter of the tree.
The diameter of a binary tree is the length of the longest path betwe...
The task is to find the diameter of a binary tree, which is the longest path between any two nodes in the tree.
Traverse the tree to find the longest path between two nodes.
Keep track of the maximum diameter found during traversal.
The diameter may or may not pass through the root node.
Consider the height of the left and right subtrees to calculate the diameter.
You are given ‘n’ cities, some of which are connected by bidirectional roads. You also have an ‘n x n’ matrix ‘roads’, where if city ‘i’ and city ‘j’ are conne...
Find the number of states of cities connected by roads in a matrix.
Identify connected cities using DFS or Union-Find algorithm
Count the number of disjoint sets to determine the number of states
Handle self-connections of cities by setting roads[i][i] = 1
Round duration - 30 Minutes
Round difficulty - Easy
Problems were asked from projects, and with one easy algorithm problem, they tested problem-solving skill.
The interview started with an introduction, post which my projects were discussed.
Out of two projects, one was discussed for about 15 minutes, and another for 5 minutes. The questions were more on underlying concepts, its conceptual working, rather than implementation details. They were satisfied with my answer.
Given an array or list ARR
consisting of N
integers, your task is to identify all distinct triplets within the array that sum up to a specified number K
.
A t...
Identify all distinct triplets within an array that sum up to a specified number.
Iterate through the array and use nested loops to find all possible triplets.
Use a set to store unique triplets and check if the sum equals the target.
Handle edge cases like duplicate elements and no valid triplets.
Return the triplets as space-separated integers or -1 if no triplets exist.
Round duration - 60 Minutes
Round difficulty - Medium
In this round, my project was discussed for 5 minutes, and later only OS, DBMS was asked. No coding problems were asked.
It was more of a discussion round for me.
One of the interviewers had 20+ years of experience, while the other 7+ years of eperience.
Questions were mostly asked from the OS course (nearly 45 minutes) and had a healthy discussion. I didn't knew the answers to a few questions, of which the interviewer explained the answer.
Tip 1 : Keep practising questions on Data Structures and Algorithms to enhance problem-solving skills.
Tip 2 : Do at least one project with a proper understanding of underlying concepts.
Tip 3 : Coursework are important
Tip 1 : Have at least one project.
Tip 2 : Do not put things which you are not completely comfortable.
I applied via Naukri.com and was interviewed before Oct 2022. There were 3 interview rounds.
Ds questions related to hashing
I was interviewed before Mar 2021.
Round duration - 90 minutes
Round difficulty - Hard
4 questions. 2 hard, 1 medium, 1 easy. Those who were able to 2.5 questions were shortlisted. 2 DP Questions Hard, 1 Graph medium and 1 easy array based question.
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.
Maintain a visited array to keep track of visited cells to avoid redundant traversal.
Increment the island count each time a new island is encountered.
Consider edge cases like boundary conditions and handling of diagonals while traversing.
Handle the...
Round duration - 40 minutes
Round difficulty - Medium
Face to Face Interaction. Project discussion in great depth. Talked about Machine learning.
You are provided with a string STR
of length N
. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...
Given a string, find the longest palindromic substring, prioritizing the one with the smallest start index.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found and its starting index
Return the longest palindromic substring with the smallest start index
Round duration - 60 minutes
Round difficulty - Hard
Very tough Data structure questions to get the most optimum approach only.
Given a singly linked list in the form 'L1' -> 'L2' -> 'L3' -> ... 'Ln', your task is to rearrange the nodes to the form 'L1' -> 'Ln' -> 'L2' -> '...
Rearrange the nodes of a singly linked list in a specific order without altering the data of the nodes.
Use two pointers to split the linked list into two halves, reverse the second half, and then merge the two halves alternately.
Ensure to handle cases where the number of nodes is odd or even separately.
Time complexity: O(N), Space complexity: O(1)
Example: Input: 1 -> 2 -> 3 -> 4 -> 5 -> NULL, Output: 1 -
Given an array containing N
distinct positive integers and a number K
, determine the Kth largest element in the array.
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...
Find the Kth largest element in an array of distinct positive integers.
Sort the array in non-increasing order and return the Kth element.
Use a priority queue or quick select algorithm for efficient solution.
Handle constraints like array size and element values properly.
Ensure all elements in the array are distinct for accurate results.
Tip 1 : Keep your good projects ready in Resume and be ready to explain design related questions. They are looking for approaches.
Tip 2 : Practice by writing the code from scratch and not completing a simple function.
Tip 3 : Good Communication skills will be an added advantage.
Tip 1 : Keep your 2 best projects and interview experiences.
Tip 2 : NEVER put things that you don't thoroughly know.
Top trending discussions
Some of the top questions asked at the Intuit interview -
The duration of Intuit interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 57 interviews
Interview experience
based on 164 reviews
Rating in categories
Senior Software Engineer
219
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer2
146
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
126
salaries
| ₹0 L/yr - ₹0 L/yr |
Devops Engineer
45
salaries
| ₹0 L/yr - ₹0 L/yr |
Staff Software Engineer
43
salaries
| ₹0 L/yr - ₹0 L/yr |
Salesforce
Yodlee
SAP
Oracle