Intuit Bangalore SDE 2 | Rejected
Summary
I interviewed for an SDE-2 role at Intuit Bangalore in June 2022, going through several technical rounds including system design, a craft demo, and coding challenges. Despite clearing most rounds, I was ultimately rejected after the final coding assessment.
Full Experience
I had my interview process with Intuit for the SDE-2 position in Bangalore in June 2022. It consisted of multiple rounds:
- 1st Telephonic (Zoom) Screening round: I was asked to design a circuit breaker. This was a high-level discussion with no coding involved. I passed this round.
- 2nd Telephonic Screening Round: The interviewer asked me to design a URL shortener, which is a standard HLD problem. I also discussed a problem related to product of array except self. I passed this round as well.
- Craft Demo: For this round, I was given a problem statement and input files/data beforehand. The task was to design a system to score similarities between two transactions from two given files. We discussed the High-Level Design (HLD), potential challenges, and the benefits of using multithreading. There was no coding involved, only a discussion. I successfully cleared this round.
- Coding interview (Assessor round): In this round, I faced two coding problems. First, I was given the problem to flatten a binary tree to a linked list, which I unfortunately couldn't solve. The second problem was to search a 2D matrix. Additionally, I was asked to create a multithreading program where the first thread prints odd natural numbers and the second prints even natural numbers, scheduled alternately. There were also various core Java questions on Garbage Collection and Collections. Despite my efforts, I was rejected after this round.
Interview Questions (7)
Design a circuit breaker system. Focus on high-level design principles without writing code.
Design a URL shortening service. This is a standard High-Level Design problem.
Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer. You must write an algorithm that runs in O(n) time without using the division operator.
Design a system that scores the similarity between two transactions from two given files. Discuss the High-Level Design (HLD), potential challenges, and the benefits of using multithreading for this system.
Given the root of a binary tree, flatten the tree into a 'linked list': The 'linked list' should use the same TreeNode class where the right child pointer points to the next node in the list and the left child pointer is always null. The 'linked list' should be in the same order as a pre-order traversal of the binary tree.
You are given an m x n integer matrix with the following two properties: Each row is sorted in non-decreasing order. The first integer of each row is greater than the last integer of the previous row. Given an integer target, return true if target is in the matrix, otherwise return false. You must write an algorithm that runs in O(log(m * n)) time complexity.
Implement a multithreaded program where the first thread prints only odd natural numbers and the second thread prints only even natural numbers. The threads should be scheduled to print alternately, one after another.