⚡️ Tryprepforge
Backend Engineer Senior programming

Given a string, return all possible permutations of that string. The permutations should not include duplicates. ### Constraints: - The input string will have at most 8 characters. ### Examples: 1. Input: 'abc' Output: ['abc', 'acb', 'bac', 'bca', 'cab', 'cba'] 2. Input: 'aab' Output: ['aab', 'aba', 'baa']

Suggested Answer

Practice More Questions Like This

Generate unlimited interview questions with structured answers, code runner, and AI-powered walkthroughs.

No credit card required

More Backend Engineer Interview Prep

Link copied to clipboard