Intuit Software Engineer Phone Screen Questions

1. A sequence of numbers, 11, 21, 1211... 2. I don't remember exactly, but it was a very simple question, I think it was related to Prime, solved instantly. 3 and 4 were multiple-choice questions, sin

First Round: 75-Minute In-Store Interview Not LeetCode, encountered the same questions as on the forum: The following content requires a score higher than 200. You can already view it. Implement Custo

**Role:** Staff Software Engineer **Location:** Mountain View, CA **Phone Screen (75 mins)** * **Behavioral & Coding:** Covered standard behavioral questions and a straightforward LeetCode Medium codi

I was asked this question in a phone interview recently. posting it here if it helps anyone :) Question: Given a string of "(" and ")" brackets. return the maximum score where...

Intuit came for on-campus hiring for 2016 batch and internship offerings for 2017 batch in our college last week.Round One (Online round, 90 minutes):The shortlisting was ...

Intuit visited our campus for summer internship for positions of Software developer and Software Quality Engineering. I was among the 5 people to be selected for the inter...

I recently cleared Intuit Interview. It was a life changing experience and I am very happy to crack the interview for SSE. Below are the questions asked :Round 1: Java ba...

Adding my Intuit interview experience. It was a full stack role (4 year experience) interview for bangalore location. 1. I had an online coding round that comprised of 1 LC easy...

Intuit Came on July for our campus They Filtered the applied students by criteria CGPA8.5 ( Around 200 Students)1. Round 1 ( Coding )Total Questions - 04 - 90 MinsQn1 : 2D...

Round 1: Glider Find all sets of palindromes in a string. Round 2: Craft Demo Demo on question: All subtrees formed once a node in a given tree is removed. Question was...

Round 1:- Online Hackathon in Geektrust.It was a machine coding round I was asked to design a water management system. Round 2:- Crafts demo round.(1 hr):- The interviewer asked about the...

There were a total of four rounds of interviews, Before Interview: The recruitment team will share the small project requirements, that need to be completed before the interview process. Round 1: You need to...

Status: 3 years Experience in Product Based Companies, B.Tech (CSE) Tier 3 College Position: SE2 at Intuit Location: Bangalore, India Date: April 20, 2022 Technical Phone Screen Round (1 hour) - Find Next greater...

Round 1 : HLD and LLD of Appointment scheduling system . can be used for Hospital appointments. Round 2: Craft demo - Rental bike system . Rejected in this round . 4...

Round 1 : Property Hunt Problem Statement Build a console application for a Property Management Business where you can expose features like register a property, list a property and search properties based on...

https://leetcode.com/problems/binary-tree-vertical-order-traversal/ The first one I did a BFS followed by a sort.. 1st solution on leetcode. I was too nervous, going to the second solution would be intuitive if I weren\'t...

Status: Final year student, Tier2 college Position offered: SDE Intern at Intuit Location: Bangalore, India Date: August 2021 Round 1: Online coding 1. FInd maximum number possible after doing k swaps 2. Given a boolean expression...

Status: SDE in a non-faang Position: SDE2 (frontend) at Intuit Location: Banglore, India Date: 1 October 2021 There aren\'t many frontend interview experiences on leetcode so I\'m posting my experience. The interview process and...

I recently found myself in a technical phone interview (2nd stage) and blanked when I got presented the question. Here is the question I got asked: Given a 2D grid cells with...

## Problem You have `n` support agents and a stream of incoming tickets. Each ticket has a priority (1-5, higher is more urgent) and an estimated handle time. Agents take one ticket at a time. Assign each incoming ticket to the agent who will be free soonest; break ties by agent index. Simulate the schedule and return the finish time of the last ticket. ```python def schedule_tickets( n_agents: int, tickets: list[tuple[int, int]] # (priority, handle_time) ) -> int: """Return the timestamp when the last ticket finishes.""" pass ``` ``` Input: n_agents=2, tickets=[(5,3),(3,5),(4,2),(2,4)] Output: 9 # t=0: Agent0 takes ticket0 (free at 3), Agent1 takes ticket1 (free at 5) # t=3: Agent0 free, takes ticket2 (free at 5) # t=5: Agent0 and Agent1 both free, Agent0 takes ticket3 (free at 9) # Last finish: 9 ``` ## Follow-ups 1. How does a min-heap on `(free_time, agent_id)` efficiently find the next available agent? 2. Should priority affect which ticket is assigned next, or which ticket each agent picks up? Explain your design choice. 3. How would you modify the simulation to support ticket escalation if wait time exceeds a threshold? 4. Extend to agents with different skill sets where only certain agents can handle certain ticket categories.