HTML Tag Parser Challenge | Dataford Interview Questions

Write code to parse a simple HTML-like tag structure such as .

Implement parse_html_like(s). Tags contain only letters and digits, have no attributes, and may be nested or appear as siblings. Text between tags should be preserved as strings. Return a nested tree rooted at the single outermost tag, or None if tags are malformed, improperly nested, or if there is not exactly one root element.

Signature: def parse_html_like(s):

Constraints

0 <= len(s) <= 2000
Tag names contain only ASCII letters and digits
Tags do not contain attributes, self-closing syntax, or comments
The output uses dictionaries with tag and children keys, and text is represented by strings
Return None for malformed input or input without exactly one root element

Function Signature

def parse_html_like(s):

Your question is HTML Tag Parser Challenge. 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

Write code to parse a simple HTML-like tag structure such as .

Signature: def parse_html_like(s):

Constraints

0 <= len(s) <= 2000
Tag names contain only ASCII letters and digits
Tags do not contain attributes, self-closing syntax, or comments
The output uses dictionaries with tag and children keys, and text is represented by strings
Return None for malformed input or input without exactly one root element

Function Signature

def parse_html_like(s):

Your question is HTML Tag Parser Challenge. 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.