Plaid Interview Questions
We track 5 interview questions reported from Plaid: 5 in Coding & Leetcode-style Questions. They average 3.0/5 difficulty — medium for a working engineer — and every one was reported by someone who sat the loop, not written by us. The topics that come up most: greedy, scheduling, simulation, hashmap.
Practice these on the problems board →Question mix
- Coding & Leetcode-style Questions5
Difficulty
- 3/5 — medium5
Asked for SWE (5), Infra (3), DataEng (1)
Topics Plaid asks about
Reported Plaid questions
Stage Makespan with Ordered Job Assignment
3/5Simulate a real-time task scheduling workflow inspired by Plaid engineering interviews. Given a sequence of workload durations and a fixed pool of available processors, your goal is to compute the total execution span by strictly following sequential task allocation rules. This problem assesses your ability to manage stateful simulations, priority tracking, and dynamic queue processing as workers complete jobs asynchronously. Discover the optimal algorithmic approach and fully written reference code with an active subscription.
Coding & Leetcode-style QuestionsheapgreedyschedulingJoin One-to-One and One-to-Many Mappings to Resolve Bank Lookup
3/5This relational data integration challenge, commonly reported during interviews at Plaid, evaluates your ability to combine disparate datasets for rapid retrieval. Candidates must link a singular identifier mapping with a secondary multi-valued association table to establish an efficient lookup structure. The exercise tests preprocessing strategies that ensure subsequent queries execute with minimal latency while gracefully handling missing keys or empty associations. View the complete problem details and an optimal model solution by acquiring a paid subscription.
Coding & Leetcode-style QuestionshashmapjoinindexingPer-User Sliding Window Rate Limiter
3/5This Plaid interview question challenges candidates to implement a per-user sliding window request gatekeeper. Given parameters dictating time boundaries and volume thresholds alongside a chronological event stream, you must determine whether each incoming interaction is permitted or blocked based solely on valid historical activity within the rolling timeframe. Discovering the complete problem analysis, optimal data structures, and the reference implementation requires an active platform subscription.
Coding & Leetcode-style Questionssliding-windowhashmapqueueSequential Pipeline Job Completion
3/5This Plaid coding challenge focuses on optimizing resource allocation within a multi-stage processing pipeline. You need to calculate the total number of jobs that can be fully completed within a given time limit. The pipeline stages must execute sequentially, but within each stage, multiple workers can process jobs in parallel. This problem tests your ability to manage time constraints, understand parallel execution dynamics, and efficiently schedule tasks across different stages. The full problem description and a model solution are available with a subscription.
Coding & Leetcode-style QuestionsmathsimulationgreedyReact UI Exercise: Filtering and Conditional Coloring
3/5This Plaid front-end interview exercise tests your proficiency in React by requiring the creation of a responsive component featuring dynamic filtering and conditional styling. You will need to demonstrate clean state management, effective event handling, and modern component structuring using functional hooks. The task also checks your ability to style layouts effectively using CSS to meet user experience expectations. Gain full access to the prompt requirements and reference implementation through our subscription service.
Coding & Leetcode-style Questionsreactfrontendcss
Companies that ask similar questions
Plaid interview FAQ
- How many Plaid interview questions are available?
- 5 reported Plaid questions, the largest group being Coding & Leetcode-style Questions (5).
- How hard is the Plaid interview?
- Across the questions we track, Plaid averages 3.0 out of 5: 5 at 3/5.
- What topics does Plaid ask about?
- Most often greedy, scheduling, simulation, hashmap, heap.