Quick Overview

Search for a pattern across the left-to-right concatenation of binary-tree leaf strings, including matches that cross leaf boundaries. This algorithm problem combines tree traversal with scalable substring matching under large input limits.

Search a Pattern Across the Leaf Text of a Binary Tree

Company: Google

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Overview: Search for a pattern across the left-to-right concatenation of binary-tree leaf strings, including matches that cross leaf boundaries. This algorithm problem combines tree traversal with scalable substring matching under large input limits.

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

Loading…