Efficient Token Parsing Function | Dataford Interview Questions

Given a string, implement an efficient parsing function that extracts specific tokens.

Assume each token is enclosed by {{ and }}. Return token contents in left-to-right order, ignore ordinary text, and ignore an opening delimiter that has no matching closing delimiter.

Use the signature def extract_tokens(text):. Token contents may be empty and tokens are not nested.

Constraints

0 <= len(text) <= 5000
Tokens use exactly {{ as the opening delimiter and }} as the closing delimiter
Tokens are not nested
An unmatched opening delimiter produces no token

Function Signature

def extract_tokens(text):

Your question is Efficient Token Parsing Function. 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