String Permutations

Function Name: generateStringPermutations

Description

In this challenge, you are required to write a function named 'generateStringPermutations' that takes a single string as an input parameter and returns all possible permutations of the characters in the string. A permutation is a re-arrangement of the elements of an ordered list. Each permutation should be unique, meaning if the string contains duplicate characters, permutations that are identical should be returned only once. The order of permutations in the returned collection does not matter.

Requirements

• The function must take exactly one parameter: a string.
• The function must return a collection (e.g., an array or list) containing all unique permutations of the string.
• Assume that the string only contains English letters (both uppercase and lowercase) and has a maximum length of 8 characters.
• Do not use any built-in permutation generation functions; implement the logic from scratch.
• The time complexity should be taken into consideration as generating permutations can be computationally intensive.

Examples

Example 1: generateStringPermutations('abc') should return ['abc', 'acb', 'bac', 'bca', 'cab', 'cba'].Example 2: generateStringPermutations('aab') should return ['aab', 'aba', 'baa']."Note: The order of the permutations in the output does not matter and may vary."

Links