Problem · String
Longest Happy Prefix
Problem statement
A string is a happy prefix of s when it is a non-empty proper prefix of s and is also a suffix of s.
The problem statement continues
ProExamples
Example 1
s = "level"return = "l"The prefix l is also the suffix, and no longer proper prefix matches.
FastPrep Pro
Reported in 1 Amazon 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
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week