Intuit SDE-2 Interview Questions, Process, and Tips

There is 1 coding question from ds, and 5 MCQs from general programming knowledge

This is a craft round where you have to finish an assignment keeping in mind all the protocols, basically a production ready code. Around a week's time is given

Q1. This round is based on the project we have done, they asked to do some modifications there and then, examples like change the queries, api responses, unit test cases, logging, caching, implementation of lo...read more
Add your answer

Q1. This is purely DS algo round, they asked a dp based question which I couldn't answer. Something modified on house robbery problem
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Interview held in working timing. They make you comfortable so that you do not feel nervous.

Q1. How would you design a system like Pastebin?
Ans. 
Tip 1 : Ask proper clarifying questions 
Tip 2 : Give reason for each component
Tip 3 : Give multiple solutions if you can think of
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Standard Problem solving round

Q1. 
Boundary Traversal of Binary Tree Problem Statement
Given a binary tree consisting of integers, your task is to provide the boundary nodes of this tree in an anti-clockwise direction, starting with the ro...read more
Ans. Recursion Based Approach
The boundary traversal of a binary tree can be broken down into 4 parts. These parts are given in the same order as they are present in the traversal-
 
1. The root node - The root node will always be our first node in the whole boundary traversal.
    
2. The left boundary - The left most nodes of the left subtree are also included in the boundary traversal, so we will process them next except for...read more
Answered Anonymously
Add your answer
Q2. 
Balanced Parentheses Combinations
Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Explanati...read more
Ans. Recursion
The idea is to generate all possible combinations and check whether the combination is the combination of balanced parentheses or not. We have two choices whether to consider ‘(‘ or ‘)’.
When the number of closing brackets is greater than the number of opening brackets we can consider taking ‘)’ in the sequence and in the other case we can consider taking ‘(‘ for all numbers of opening brackets until the number...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This round was a mix of design and data structures

Q1. 
Count Pairs with Given Sum
Given an integer array/list arr and an integer 'Sum', determine the total number of unique pairs in the array whose elements sum up to the given 'Sum'.
Input:
The first line c...read more
Ans. Brute Force Approach
• Initialize the ans = 0
• Run two loops first from i = 0 to n-1 and second from j = i+1 to  n-1 and if arr[i] + arr[j] == Sum then increase the ans by 1.
• Return ans
Space Complexity: O(1)Explanation:
O(1)
 
As constant extra space is used.
Time Complexity: O(n^2)Explanation:
O(N^2), where N is the size of the array.

As we are running two nested loops of size N.
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

Standard managerial round

Q1. Why should we hire you?
Ans. 
Tip 1 : The cross-questioning can go intense sometimes, think before you speak.

Tip 2 : Be open-minded and answer whatever you are thinking, in these rounds, I feel it is important to have opinion.
 
Tip 3 : Context of questions can be switched, pay attention to the details. It is okay to ask questions in these round, like what are the projects currently the company is investing, which team you are mentoring, how all...read more
Answered Anonymously
Add your answer