Haiku Substring Detection | Dataford Interview Questions

Given a list of strings, decide whether it begins as a haiku and then determine if a haiku exists anywhere within the string. Treat each list element as one line of English text. Return a dictionary with begins and exists booleans, using a deterministic syllable estimator based on vowel groups and silent trailing e rules. A haiku consists of three consecutive lines with 5, 7, and 5 syllables.

Constraints

0 <= lines.length <= 10^5
Each line contains at most 10^4 characters
Input text consists of English words, whitespace, punctuation, and ASCII letters
A haiku must use three consecutive list elements
Syllables are estimated by contiguous vowel groups, with the specified silent trailing e rule

Function Signature

def analyze_haiku(lines):

Your question is Haiku Substring Detection. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Constraints

0 <= lines.length <= 10^5
Each line contains at most 10^4 characters
Input text consists of English words, whitespace, punctuation, and ASCII letters
A haiku must use three consecutive list elements
Syllables are estimated by contiguous vowel groups, with the specified silent trailing e rule

Function Signature

def analyze_haiku(lines):

Your question is Haiku Substring Detection. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.