Filter interviews by
DSA based on any general language prefer C++
Polymorphism is the ability of a function or method to behave differently based on the object it is acting upon.
Polymorphism allows objects of different classes to be treated as objects of a common superclass.
There are two types of polymorphism: compile-time (method overloading) and runtime (method overriding).
Example: Inheritance allows a child class to override a method from its parent class, exhibiting polymorphic b
I applied via Job Portal and was interviewed in May 2023. There were 3 interview rounds.
4 coding question were there . The level was medium to hard
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.
Intuit interview questions for designations
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.
Get interview-ready with Top Intuit Interview Questions
I was interviewed in Oct 2020.
Round duration - 30 minutes
Round difficulty - Medium
The round lasted for about 45 min. I was asked a lot of OOPs questions. There was a detailed discussion on one of my project along with current problems in my project. How can I make it more secured and increase scalability.
Develop a Stack Data Structure to store integer values using two Queues internally.
Your stack implementation should provide these public functions:
Implement a stack using two queues to store integer values.
Use two queues to simulate stack operations efficiently.
Maintain the top element in one of the queues for easy access.
Ensure proper handling of edge cases like empty stack.
Example: Push elements onto one queue, then dequeue and enqueue to the other queue for pop operation.
Example: Use a flag to track the top element and update it accordingly.
Round duration - 90 minutes
Round difficulty - Hard
There were two interviewers. After introduction, and small discussion on my project. They asked my favourite subject, I answered OOP- was asked to differentiate between OOP language and Procedure Oriented Languages. Then definition of OOP and real life examples of overloading and overriding.
I was asked to code a data structure where I can obtain, add, remove one occurrence and all occurrence in O(1). I tried using maps, he was not very satisfied.
Tip 1 : Do competitive programming in 1st and 2nd year.
Tip 2 : Study every data structure and algorithm in dfs manner. Once done then practice.
Tip 3 : Don't ignore theoretical subjects.
Tip 1 : Do at least 2 projects.
Tip 2 : Mention your programming accounts.
I was interviewed before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
This was a coding round in which two questions were asked. I solved first question fully and the second question partially.
Round duration - 60 minutes
Round difficulty - Easy
This was face to face interview round and the interviewer asked me one question only.
Use sliding window technique to find smallest subarray with k distinct values.
Use a sliding window approach to keep track of the subarray with k distinct values.
Use a hashmap to store the frequency of each element in the window.
Slide the window to the right until the hashmap contains k distinct elements.
Shrink the window from the left while maintaining k distinct elements.
Update the minimum subarray length as you slide...
Round duration - 60 minutes
Round difficulty - Easy
I had an interview with two tech people from Intuit who had an experience of 5-6 years in the industry.
I used Codezen platform of Coding Ninjas to practice data structures related questions . There you will get topic wise questions. So try to do as much as practice there or at any other coding portal to enhance your speed and efficiency.
Application resume tips for other job seekersMention good level projects in your resume and also your internships or previous experiences with a brief explanation about what you have done in that internship.
Final outcome of the interviewSelectedTop trending discussions
I applied via Company Website and was interviewed before Dec 2020. There were 4 interview rounds.
I applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 interview rounds.
I applied via Approached by Company and was interviewed before Apr 2021. There were 3 interview rounds.
My resume
based on 3 interviews
1 Interview rounds
based on 1 review
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