Fewest Board Switches to Travel Between Two Pins via Shared Boards

Read the full interview experience this question came from →

Quick Overview

Given boards that each hold a list of pins, where one pin can appear on several boards, compute the fewest board switches needed to travel from a start pin to an end pin. Tests graph modeling of shared memberships, minimum-step search, and careful handling of same-board and unreachable cases.

Fewest Board Switches to Travel Between Two Pins via Shared Boards

Company: Pinterest

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Overview: Given boards that each hold a list of pins, where one pin can appear on several boards, compute the fewest board switches needed to travel from a start pin to an end pin. Tests graph modeling of shared memberships, minimum-step search, and careful handling of same-board and unreachable cases.

Read the full Pinterest Software Engineer interview experience this question came from

Pinterest logo
Pinterest
Sep 7, 2026
mediumSoftware EngineerTechnical ScreenCoding & Algorithms
30
0
Loading...