# Intuit Interview Questions with Answers

8 previously-asked interview questions from Intuit's hiring process, each with the correct answer and a worked explanation. Written against the company's actual test pattern.

_Source: Astra (https://useastra.in). Updated 2026-09-05._

### 1. How would you design a URL shortener at a high level?

**Answer:** Map a unique short key to the long URL in a datastore. Generate keys by base62 encoding an auto-increment id or a hash. On lookup, redirect via the stored URL. Discuss scale: caching hot links, database sharding, and collision handling.

**Explanation:** Key to URL mapping; base62 ids, caching, sharding.

### 2. What is the difference between a HashMap and a TreeMap?

**Answer:** A HashMap stores entries in buckets with average O(1) operations but no ordering. A TreeMap keeps keys sorted using a balanced tree with O(log n) operations, supporting range and ordered queries. Choose HashMap for speed, TreeMap for order.

**Explanation:** HashMap: O(1), unordered. TreeMap: O(log n), sorted.

### 3. How does a hash table handle collisions?

**Answer:** Collisions are handled by chaining (each bucket holds a list or tree of entries) or open addressing (probing for the next free slot, such as linear or quadratic probing). Keeping the load factor low and using a good hash function minimises collisions.

**Explanation:** Chaining or open addressing, with a good hash and low load factor.

### 4. What is Big O notation and why does it matter?

**Answer:** Big O describes how an algorithm running time or memory grows with input size, ignoring constants, focusing on the dominant term. It matters because it predicts scalability and lets you compare algorithms independent of hardware.

**Explanation:** Describes growth with input size; predicts scalability.

### 5. How would you detect a cycle in a linked list?

**Answer:** Use Floyd algorithm with a slow pointer moving one node and a fast pointer moving two. If they meet, there is a cycle; if fast reaches null, there is none. Time O(n), space O(1).

**Explanation:** Floyd slow and fast pointers.

### 6. What does it mean for code to be thread-safe?

**Answer:** Thread-safe code behaves correctly when accessed by multiple threads at once, avoiding race conditions on shared state. It is achieved with synchronization (locks, atomics), immutability, or thread-local data. The goal is consistent results regardless of thread interleaving.

**Explanation:** Correct under concurrent access; uses locks, atomics, or immutability.

### 7. Tell me about yourself.

**Answer:** Give a focused 60 to 90 second overview: your degree, strong CS and problem solving skills, a project you built with its impact, and why Intuit interests you. Emphasise coding and product thinking.

**Explanation:** Structured pitch; emphasise coding and product thinking.

### 8. Why do you want to join Intuit?

**Answer:** Mention Intuit mission of powering prosperity through products like TurboTax, QuickBooks, and Mailchimp, its strong engineering culture, data and AI work, and customer obsession. Tie it to your interest in building impactful products.

**Explanation:** Mission-driven products, strong engineering, customer focus.

More Intuit preparation, including the full recruitment process: https://useastra.in/campus/intuit