Perplexity Interview Questions
Reconstructed from 13 verified candidate reports across 4 questions. Aug 2025 – Jul 2026.
This page is a live view of every Perplexity interview question AceOffer has indexed — pulled from real candidate reports, not invented from job descriptions or one founder’s memory. Every question shows how many times it’s been reported and when it was last seen. The catalog gets a refresh pass every month.
Key facts
- •4 distinct Perplexity interview questions indexed
- •13 candidate reports across the catalog
- •Most reported: In-Memory File System — 5× (last seen July 2026)
- •Reports span Aug 2025 – Jul 2026
- •Refreshed monthly · last updated July 2026
The Perplexity loop, from candidate reports
Perplexity's loop opens with a recruiter chat and moves quickly into a coding round (a live '店面' phone screen or an OA), then an onsite. The coding rounds have a distinctive OA-style shape that recurs across reports: a long multi-part prompt where each part ships its own hidden test file, plus a test that forbids regressing earlier parts — so you must extend your code carefully, and Python is typically required. The signature problems are implementation-heavy and AI-flavored: an in-memory Unix file system (LeetCode 588 'lightly modified'), an 'Implement ToDo list for AI' problem built around a task-dependency DAG with cascade failure, and the classic stop-words string problem. System-design rounds carry a product flavor (Design Mint.com, a discovery-page recommender, a trending-queries system). Candidates repeatedly note that interviewers give little help and that questions rotate fast, so a memorized template doesn't carry you.
What gets asked, by round
Counts reflect distinct questions per round, not number of times asked. Frequencies on individual question cards show how many candidates reported getting that specific question.
60 minute design rounds. Interviewers push hard on the specific dimension their team cares about (storage at scale, real-time fan-out, multi-tenancy).
Most reported Perplexity questions
Sorted by candidate-report frequency. These are the questions that have recurred most across the loops we’ve indexed.
| Question | Round | Reported | Last seen |
|---|---|---|---|
| In-Memory File System | Coding | 5× | July 2026 |
| Implement ToDo List for AI | Coding | 4× | May 2026 |
| Stop Word String Processing | Coding | 2× | October 2025 |
| Design Mint.com (Personal Finance Tracker) | System Design | 2× | May 2026 |
Want to see all 4? Browse the full Perplexity catalog →
Read two Perplexity questions free
Full problem statements, candidate-reported follow-ups, and walkthroughs. No signup needed.
Perplexity's most-reported coding round: a multi-part in-memory Unix file system (mkdir/touch/ls → rm/rmdir → cd), often driven by raw command-line strings you parse and execute. Free preview with a tested solution.
A 4-part task-manager problem built on a dependency DAG with cascade failure. The reported wall: a naive DFS cascade times out on a large interdependent-task test — the O(V+E) process-once fix is the bar.
The classic stop-words problem, then the streaming twist: process input too large to read at once with a generator, buffering exactly max(stop_word_len) − 1 chars across chunk boundaries.
The system-design round: link accounts via Plaid/Yodlee, sync + deduplicate transactions (including pending→posted), auto-categorize, and serve a low-latency dashboard. The interview lives in sync + dedup, not CRUD.
- •On the multi-part coding rounds: get the early parts correct AND fast — reports describe most candidates only reaching Part 2 of 4, so pace deliberately and don't over-invest Part 1
- •On the ToDo-list problem: track both edge directions (a task's dependencies AND its dependents) from the start, and state the O(V+E) cascade argument out loud — a naive recursive cascade times out the large hidden test
- •On the file system: build and unit-test the path resolver first, so a bug is localized to one small function instead of hiding in the whole class
- •On Design Mint.com: structure functional vs non-functional requirements before designing, name Plaid/Yodlee + the OAuth token model, and give a concrete dedup strategy (external_tx_id upsert + fuzzy fallback for pending→posted)
- •Clarify ambiguous specs up front (mkdir vs mkdir -p; token vs substring stop-word matching) — the reports show the prompts leave these open on purpose
- •Cascading task failure with a naive recursion and no visited guard — it re-walks shared descendants exponentially and TLEs the large interdependent-task test (the single most-reported wall)
- •Tracking only one dependency direction on the ToDo problem, then having to rewrite mid-round to add the other
- •On the file system: rmdir silently succeeding on a non-empty directory, or path parsing that ignores '.', '..', and absolute-vs-relative
- •Treating Design Mint.com as a CRUD app — skipping transaction dedup, categorization, and (especially) security/PII handling entirely
- •Running out of time on the multi-part OA-style rounds by reading the long instructions slowly under pressure — practice the format, not just the algorithms
Get the full Perplexity catalog
Every question. Every candidate-reported follow-up. The mistakes that sink people, and what passers do instead. Monthly refresh.