Given a dictionary of alternatives {a: [\'a1\', \'a2\'], b: [\'b2\', \'bbb\']} take a string and print all possible versions eg. Output: ab -> \ta1b2, \ta1bbb \ta2b2 \ta2bbb Any thoughts for an optimal solution?

LeetCode Question · Nov 2021

Microsoft | Onsite | Dictonary of String versions

SWE Onsite

318 views 5 replies

Question Details

Given a dictionary of alternatives {a: [\'a1\', \'a2\'], b: [\'b2\', \'bbb\']} take a string and print all possible versions eg. Output: ab -> a1b2, a1bbb a2b2 a2bbb Any thoughts for an optimal solution?

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Hash Table Strings

More from Microsoft

Reddit I analyzed 11k available dev jobs to find out what skills employers are looking for right now Reddit Best Resources/Materials For FAANG Companies Reddit Is it positive sign ? Reddit Premera’s Software Development Summer Internship Interview Reddit Tips Needed

← All Microsoft questions Microsoft Software Engineer Questions → All Backtracking Questions →