Practice Pinterest Coding Question | Real Coding Interviews

Quick Summary

Model the pins and boards as a graph where any pins sharing a board are directly connected.
Check if pin1 and pin2 reside in the same connected component using BFS, DFS, or Union-Find.
Pre-build a hash map indexing each pin to its containing boards to enable efficient traversal.

What This Tests

Common Patterns

Graph TraversalBFSUnion FindHashing

Hint 1

Hint 2

Hint 3

What Interviewers May Ask Next

Report seen similar question in interview

python

Test Cases

Input

Output

Expected