Intuit Interview Experience | Off Campus - Oct 2022

New update is available. Click here to update.

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

SDE - 1

Intuit

2 rounds | 4 Coding problems

Anonymous

Fresher | Oct 2022

Rejected

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

Round

Medium

Video Call

Duration45 mins

Interview date1 Oct 2022

Problems2

1. Level Order Traversal

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...

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

Try solving now

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

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:

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.

Try solving now

Round

Medium

Video Call

Duration45 mins

Interview date1 Oct 2022

Problems2

1. Ways To Make Coin Change

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 ...

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.

Try solving now

2. OOPS Questions

(interface vs functional interface)

asked about functional programming and advantages.

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.

Was this interview experience helpful?