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...
The approach is to use Recursion along with Bitmasking. We can observe that we only need to know the last M cells we processed. We should only consider the cells at the top and left of the current cell because the right direction will be covered by someone else's left position, and the bottom position will be covered by someone else's top position. If a cell is filled, its contribution is fixed. If a nei...
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:
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 basic idea of this approach is to break the problem into subproblems.
Now, there are three possible cases:
Let us define a recursive function, ‘getDiamter’, which takes the root of the binary tree as input parameter and return...
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...
Disjoint-set (or Union-find) is a data structure that stores a collection of disjoint (non-overlapping) sets. This data structure consists of three basic operations:
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...
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...
Used DFS and Flood Fill Algorithm.
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...
A twisted level of Longest Palindromic Substring. If you know the approach for this, the question was a cakewalk.
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' -> '...
Use a Stack based approach storing the heads in 2 stacks. Reverse the second half and join the linked list.
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, ...
I used a heap based approach and so did it in O(Log(n)). Interviewers told me to optimise so I did it with a Dequeue in O(n).
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:
I just had to write the push and pop functions. After discussing my approach and its complexities, I was allowed to code.
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.
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 Campus Placement and was interviewed in Jun 2024. There were 2 interview rounds.
Technical MCQ questions on core computer science subjects were asked.
posted on 1 Oct 2023
I applied via Google updates and was interviewed before Oct 2022. There were 3 interview rounds.
posted on 16 Sep 2021
I was interviewed in Apr 2021.
Round duration - 30 Minutes
Round difficulty - Easy
Timing of test start from 11 AM and everything goes well here .
Round duration - 60 Minutes
Round difficulty - Easy
It happen nicely and no problem occur.
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
The idea here is to travel over every elevation on the map and calculate the units of water the elevation can store.
Here is the algorithm :
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Use any good sorting algorithm like Merge Sort, Quick Sort or inbuilt sorting function of different languages.
O(1), As we are using constant space.
Time Complexity: O(nlogn)Explanation:O(N*log(N)), where ‘N’ is the size of the array.
We are using inbuilt sort algorithm which has Overall Time Complexity O(N*log(N))
Round duration - 90 mintues
Round difficulty - Hard
Environment is very bad the intervier video call is lagging.
Given an array of size N
and Q
queries, each query requires left rotating the original array by a specified number of elements. Return the modified array for each query.
The idea is to create a function which would rotate the array one element at a time. This can be done by shifting the array towards left by one element and copying the first element to the end of the array. For every query repeatedly call the above function, until the desired rotation is obtained.
If the number of rotations required, say ‘K’, is greater than the number of elements, ‘N’,...
Tip 1 : Prepare Data structure and algorithm
Tip 2 : Focus on operating system
Tip 3 : RDBMS and CAO are also important
Tip 1 : Have some projects on resume.
Tip 2 : Always write things which you can explain there.
based on 3 interviews
1 Interview rounds
based on 1 review
Rating in categories
Senior Software Engineer
219
salaries
| ₹20.9 L/yr - ₹76.4 L/yr |
Software Engineer2
146
salaries
| ₹20 L/yr - ₹60 L/yr |
Software Engineer
126
salaries
| ₹14 L/yr - ₹43.8 L/yr |
Devops Engineer
45
salaries
| ₹4.2 L/yr - ₹16 L/yr |
Staff Software Engineer
43
salaries
| ₹32 L/yr - ₹97 L/yr |
Salesforce
Yodlee
SAP
Oracle