← Intuit Interview InsightsSoftware Engineer

Intuit·Software Engineer·Technical Phone Screen·Intermediate

IntermediateRejected
May 2026

Summary

Interviewed for a software engineer role at Intuit and got hit with a graph problem built around their Quickbooks data. I had the right instinct but couldn't get the code across the finish line, which pretty much tells you how it went.

Questions Asked (1)

Q1

Given business relationship data, implement a function that finds the degrees of separation (shortest path) between two businesses. The argument and return types were intentionally left unspecified.

Algorithms & Data StructuresTechnical Trade-offs
Author's notes

The ambiguity was the first hurdle.

Create a free account to read the full note

AI HintsAI Generated

Suggested Approach

Start by clarifying the problem: define the input data structure (e.g., adjacency list or edge list) and the expected return type (e.g., integer distance or path). Then, discuss using BFS for unweighted graphs to find the shortest path, and consider trade-offs like bidirectional BFS for large graphs. Finally, walk through the algorithm, analyze complexity, and mention edge cases.

Pro tip: Demonstrate awareness of real-world constraints by discussing how to handle large datasets (e.g., using bidirectional BFS or precomputed indexes) and how to gracefully handle disconnected components or missing businesses.

1. Clarify requirements and assumptions

Ask about the input format (e.g., adjacency list, edge list), whether the graph is directed or undirected, and the expected return type (e.g., integer distance, path, or -1 if no path). Confirm if the graph is unweighted.

2. Choose the right algorithm

For unweighted shortest path, BFS is optimal. Mention that bidirectional BFS can be more efficient for large graphs. If the graph is weighted, Dijkstra's algorithm would be needed.

3. Outline the algorithm

Describe BFS: initialize a queue with the start node, track visited nodes and distances, and explore neighbors level by level until the target is found or the queue is exhausted.

4. Analyze complexity and trade-offs

State time and space complexity: O(V + E) for BFS. Discuss trade-offs: bidirectional BFS reduces time to O(b^(d/2)) but adds complexity; precomputation may be beneficial for frequent queries.

5. Handle edge cases and test

Consider cases: start equals target (return 0), no path (return -1 or null), disconnected graph, and large graphs. Suggest testing with small examples and verifying correctness.

Key Points to Mention

  • BFS is optimal for unweighted shortest path
  • Bidirectional BFS can improve performance for large graphs
  • Time and space complexity: O(V + E)
  • Handling disconnected components and returning -1 or null
  • Clarifying input/output types and graph representation
  • Trade-offs between precomputation and on-the-fly computation

AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.