Dataford
Interview QuestionsInterview GuidesExperiencesCoaching
New
Pricing
Get started
Dataford
Popular roles
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Browse
Browse All RolesEvery role hub, from analyst to MLBrowse All CompaniesCompany-specific interview loopsAll Interview GuidesThe full guide library
Top questions by role
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Top questions by skill
SQLPythonStatisticsMachine LearningA/B TestingSystem DesignGenerative AIProduct SenseMetricsBehavioral
Browse all questions →Try a mock interview
Experiences
Practice
Mock InterviewsTimed interview simulations with feedbackCoaching1:1 coaching with people at your target companiesSuccess PathYour 6-week structured planModulesCurated lessons by topicWebinarsTalks from ex-Big Tech data leadsPlaygroundA free-form scratch editor
Learn
BlogInterview strategy and career adviceTech Job Market ReportHiring trends across data and AI rolesFor UniversitiesDataford for career centersAbout DatafordWho we are and how we build
Pricing
Build my plan
String Normalization Combinatorics
00:00
5 left

String Normalization Combinatorics

HardPython

Problem

Grammarly Editor may represent uncertain text with alternatives such as {grammarly|Grammarly}. Given a pattern, generate every possible combination and return the unique results after text normalization.

A pattern contains ordinary text and zero or more non-nested alternative groups. Each group has the form {option1|option2|...}. Alternatives may contain letters, digits, punctuation, and whitespace, but not {, }, or |.

Normalize each generated string by converting it to lowercase, replacing every consecutive whitespace sequence with one space, and removing leading or trailing spaces. Return the normalized strings in lexicographic order, without duplicates.

Formal Specification

Implement generate_normalized_variants(pattern). The input is a string, and the output is a list of strings. Every output string must result from selecting exactly one option from each alternative group, then applying the normalization rules.

Constraints

  • 1 <= len(pattern) <= 1000
  • The pattern contains at most 12 alternative groups
  • Every group contains at least two non-empty options
  • The total number of combinations is at most 5000
  • Groups are non-nested and braces are balanced

Function Signature

def generate_normalized_variants(pattern):
Interviewer

Your question is String Normalization Combinatorics. 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.

You need to log in / sign up to run or submit.
CodePython 3
Sign up free to run your codeLog inLn 2
Run your code to see test output here.