Intuit interview experience Real time questions & tips from candidates to crack your interview

# SDE - 1

Intuit
2 rounds | 4 Coding problems

## Interview preparation journey

Preparation
Duration: 3 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip

Tip 1 : Practice coding from Leetcode, Interview bit, at least 100 questions
Tip 2 : Practice any one automation framework includes design patterns

Application process
Where: Referral
Eligibility: Above 7 CGPA
Resume tip

Tip 1 : Restrict your resume to 1 page and write your practical work only
Tip 2 : Mention top topics like Selenium, Rest Assured Automation, Language used Java etc

## Interview rounds

01
Round
Medium
Video Call
Duration45 mins
Interview date1 Oct 2022
Coding problem2

### 1. Level Order Traversal

Easy
15m average time
85% success
0/40

#### You have been given a Binary Tree of integers. You are supposed to return the level order traversal of the given tree.

##### For example:
``````For the given binary tree
``````

``````The level order traversal will be {1,2,3,4,5,6,7}.
``````
Problem approach

You have been given a Binary Tree of integers. You are supposed to return the level order traversal of the given tree.
For Example:
For the given binary tree

### 2. k-th node from the end of the linked list

Easy
15m average time
85% success
0/40

#### Given the head node of the singly linked list and an integer ‘k’, , find the value at the kth node from the end of the linked list.

##### For example:

``````For the above-linked list, if k=2, then the value at the kth i.e second node from the end is ‘12’.
``````
Problem approach

Given the head node of the singly linked list and an integer ‘k’, , find the value at the kth node from the end of the linked list.

02
Round
Medium
Video Call
Duration45 mins
Interview date1 Oct 2022
Coding problem2

### 1. Ways To Make Coin Change

Moderate
20m average time
80% success
0/80

#### You are given an infinite supply of coins of each of denominations D = {D0, D1, D2, D3, ...... Dn-1}. You need to figure out the total number of ways W, in which you can make a change for value V using coins of denominations from D. Print 0, if a change isn't possible.

Problem approach

You are given an infinite supply of coins of each of denominations D = {D0, D1, D2, D3, ...... Dn-1}. You need to figure out the total number of ways W, in which you can make a change for value V using coins of denominations from D. Print 0, if a change isn't possible.

### 2. OOPS Questions

(interface vs functional interface)

Front end projects and current projects i was working in my current organization.

Problem approach

Think out loud. Ask interviews if you have any questions and doubts.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

What does ROLLBACK do in DBMS?

Start a Discussion
Similar interview experiences
SDE - 1
2 rounds | 3 problems
Interviewed by Intuit
910 views
SDE - 1
2 rounds | 4 problems
Interviewed by Intuit
746 views
SDE - 1
1 rounds | 2 problems
Interviewed by Intuit
841 views
SDE - 1
3 rounds | 6 problems
Interviewed by Intuit
668 views
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
104062 views