Intuit Interview Questions and Answers for Freshers

Q1. Write code for stack operations
Ans. 
Code for stack operations in C++ using array
• Declare an array to store stack elements

• Implement push operation to add elements to the top of the stack

• Implement pop operation to remove elements from the top of the stack

• Implement peek operation to view the top element without removing it
Answered by AI
Add your answer
Q2. Java 8 functionalities
Add your answer
Q3. Bubble sort
Add your answer
Q4. AWS technologies on which you worked
Ans. 
I have worked on AWS technologies such as EC2, S3, Lambda, and RDS.
• EC2 (Elastic Compute Cloud)

• S3 (Simple Storage Service)

• Lambda

• RDS (Relational Database Service)
Answered by AI
Add your answer
Q5. HLD of project worked previously
Ans. 
Designed a high-level architecture for a web-based project using microservices and RESTful APIs.
• Utilized microservices architecture to break down the project into smaller, independent services.

• Implemented RESTful APIs for communication between services.

• Used a service discovery mechanism like Eureka or Consul for dynamic service registration and discovery.

• Ensured scalability and fault tolerance by incorporating load bal...read more
Answered by AI
Add your answer
Q6. Craft demo on Authentication System with test cases. Enhancements that can be done in craft demo Why use hashing for encryption
Add your answer

Q1. What is polymorphism?
Ans. 
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...read more
Answered by AI
Add your answer
Q2. And other questions related to cs fundamentals
Add your answer

4 coding question were there . The level was medium to hard

Q1. This round was of 45 min with 1 coding ques and computer fundamentals
Add your answer
Q2. Two sum was asked oops concept
Add your answer

Consist of 4 dsa problems of dynamic programming on grid , strings

1. GIVEN 2 INTEGERS C AND S FIND MAXIMUM INTEGER i SUCH THAT C*log(i)*sqrt(i)*i<=S
2. Merge two sorted list

Q1. Semaphore definition and a problem on in
Add your answer
Q2. Normalization in DBMS
Ans. 
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.
• Normalization involves breaking down a table into smaller tables and establishing relationships between them.

• There are different levels of normalization, with each level addressing a specific type of data redundancy.

• Normalization helps to prevent data inconsistencies and anomalies, and improves database perform...read more
Answered by AI
Add your answer
Q3. Oops, inheritance and polymorphism
Add your answer

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.

Q1. 
Grid Satisfaction Problem
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...read more
Ans. 
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
Answered by AI
Add your answer
Q2. 
Max Game Minimum Penalty Problem
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:
1. Select any two ...read more
Ans. 
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.
Answered by AI
Add your answer
Q3. 
Binary Tree Diameter Problem Statement
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...read more
Ans. 
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.
Answered by AI
Add your answer
Q4. 
Problem Statement: Find the Number of States
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...read more
Ans. 
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
Answered by AI
Add your answer

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.

Q1. 
Triplets with Given Sum Problem
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.
Explanation:
A t...read more
Ans. 
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.
Answered by AI
Add your answer

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.