Problem · String
Find a Template Across Binary-Tree Leaves
Problem statement
The text represented by a binary tree is formed by concatenating the values of its leaves from left to right. A leaf value may be a string, a single character, or a space.
In this practice interface, leafValues lists the leaf values in that same left-to-right order. Given leafValues and a string templateText, return true if templateText occurs as a contiguous substring of the tree's text. Otherwise, return false.
The problem statement continues
ProExamples
Example 1
leafValues = ["ab","c"," de"]templateText = "c d"return = trueThe leaves form abc de. The template c d appears across the boundary between the second and third leaf values.
FastPrep Pro
Reported in 1 Google interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$9/month
Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week