String Permutations Coding | Dataford Interview Questions

Aristocrat game-content tools may need to normalize a text instruction and explore possible symbol arrangements. Implement one function that reverses the words in a sentence and generates every distinct permutation of a separate string.

Formal Specification

Given sentence and token, return a dictionary with:

reversed_sentence: the words from sentence in reverse order, joined by a single space. Any leading, trailing, or repeated whitespace is ignored.
permutations: every distinct arrangement of the characters in token, returned in lexicographic order.

The sentence contains non-empty words separated by arbitrary whitespace. The token contains lowercase English letters and may contain repeated characters.

Constraints

0 <= len(sentence) <= 10^5
1 <= len(token) <= 8
sentence contains words separated by arbitrary whitespace
token contains only lowercase English letters
The permutation output contains only distinct strings

Function Signature

def reverse_words_and_permutations(sentence, token):

Your question is String Permutations Coding. 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