← Plaid Interview Insights

Plaid·Software Engineer·Technical Phone Screen·Intermediate

Intermediate
May 2026

Summary

Plaid data engineering interview with a data cleaning and ID mapping problem. Pretty focused on schema design and how you handle messy real-world data, which felt very on-brand for Plaid.

Questions Asked (1)

Q1

You have a dataset that maps bank names and identifiers to two ID systems (internal and external). Write a function that produces a clean mapping of every internal bank ID to its corresponding external bank ID.

Data ModelingTechnical Trade-offsAlgorithms & Data Structures
Author's notes

The base case is a 1:1 join once you line up bank name and identifier correctly, which sounds easy but the first thing I fumbled was not asking about nullability up front.

Create a free account to read the full note

AI HintsAI Generated

Suggested Approach

First, clarify the data model: understand the structure of the input (e.g., separate tables for internal and external IDs linked by bank name/identifier) and the expected output (a dictionary or table mapping internal IDs to external IDs). Then, outline an algorithm that joins the two ID systems on the common bank identifier, handling edge cases like missing mappings or duplicates. Finally, discuss trade-offs such as time/space complexity, data consistency, and scalability.

Pro tip: Mention that you would validate the mapping by checking for orphaned internal IDs (those without external counterparts) and log them for data quality monitoring, showing you think about production reliability.

1. Clarify the data model

Ask about the input format: are internal and external IDs in separate tables, or is there a single table with bank name, internal ID, and external ID? Confirm the uniqueness and cardinality of bank identifiers.

2. Define the output

Specify the desired output: a dictionary mapping internal ID to external ID, or a new table. Consider whether to include only matched pairs or also report unmatched IDs.

3. Design the algorithm

Propose an efficient join: build a hash map from bank identifier to external ID, then iterate over internal IDs to look up the corresponding external ID. Discuss time and space complexity.

4. Handle edge cases

Address scenarios like missing external IDs, duplicate bank names, or conflicting mappings. Decide whether to raise errors, skip, or log them.

5. Discuss trade-offs and scalability

Compare in-memory vs. database joins, and consider data freshness, consistency, and performance for large datasets.

Key Points to Mention

  • Use a hash map (dictionary) for O(1) lookups to achieve O(n) time complexity.
  • Clarify the join key: bank name or a unique bank identifier? Ensure it's consistent across both ID systems.
  • Handle one-to-many or many-to-one relationships if bank identifiers are not unique.
  • Consider data quality: log or report internal IDs that have no external mapping.
  • Discuss whether the mapping should be static or updated dynamically as new data arrives.
  • Mention potential need for normalization (e.g., case-insensitive bank names) before joining.

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