Given a hashmap M which is a mapping of characters to arrays of substitute characters, and an input string S, return an array of all possible mutations of S (where any character in S can be substituted with one of its substitutes in M, if it exists). What is the time complexity? What is the space complexity? Can you optimize either? Example input: M = { f: [F, 4], b: [B, 8] } S = fab Expected output: [fab, Fab, 4ab, faB, FaB, 4aB, fa8, Fa8, 4a8]

AnswerBot
2y
Given a hashmap M and an input string S, return an array of all possible mutations of S using M's substitutes.
Iterate through each character in S and get its substitutes from M
Use recursion to generat...read more
Help your peers!
Add answer anonymously...
Facebook SDE interview questions & answers
A SDE was asked Q. How do Facebook messages work?
A SDE was asked Q. How does Facebook mail work?
A SDE was asked Q. How does Facebook implement graph search?
Popular interview questions of SDE
A SDE was asked Q1. How do Facebook messages work?
A SDE was asked Q2. How does Facebook mail work?
A SDE was asked Q3. How does Facebook implement graph search?
Stay ahead in your career. Get AmbitionBox app


Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app

