Write a method to compute all permutations of a string

Problem

Write a method to compute all permutations of a string

For example: given an input string, "abc", your program should print the following permutations:

a
ab
abc
ac
acb
b
ba
bac
bc
bca
c
ca
cab
cb

cba

Answer

This question is similar to "Finding all the subset of the given set" problem except for the fact that the order of the element in the subset is important. This means "ab" and "ba" are different.

DFS approach with duplicate subset check. $O(N \times N!)$

Unlike the "Finding all the subset of the given set" problem, we can perform the DFS from 0 to N-1 position, where N is the length of the input string.

While we produce the substring, we will encounter duplicate permutations. To prevent that we can use a hash table to check if we have already produced the current permutation before.
In C++, I used std::set for this purpose. This gives $O(\log N)$ search time.

This algorithm will run in $O(N \times N!$, where N is the length of the input string.
Here is the complete code.



Practice statistics

16:50: made one logical flaw due to the confusion of the usage of std::set. erase method. 

UPDATE(2022-06-13): Solved in python. Had to compose the sub input excluding already used characters. This is a little wasteful in terms of memory since I had to use two buffers one to hold the temporary chars and the other to store the permutation. This way does not require the hashtable since we remove already used chars during the search.

Comments

Post a Comment

Popular posts from this blog

Planting flowers with no adjacent flower plots

Image
Problem Suppose you have a long flowerbed in which some of the plots are planted and some are not. However, flowers cannot be planted in adjacent plots - they would compete for water and both would die. Given a flowerbed (represented as an array containing booleans), return if a given number of new flowers can be planted in it without violating the no-adjacent-flowers rule  Sample inputs  Input: 1,0,0,0,0,0,1,0,0  3 => true  4 => false  Input: 1,0,0,1,0,0,1,0,0  1 => true  2 => false  input: 0  1 => true  2 => false  public boolean canPlaceFlowers(List flowerbed, int numberToPlace) {  // Implementation here  }
Read more
  Given an array of  intervals  where  intervals[i] = [start i , end i ] , merge all overlapping intervals, and return  an array of the non-overlapping intervals that cover all the intervals in the input . Example 1: Input: intervals = [[1,3],[2,6],[8,10],[15,18]] Output: [[1,6],[8,10],[15,18]] Explanation: Since intervals [1,3] and [2,6] overlap, merge them into [1,6]. Example 2: Input: intervals = [[1,4],[4,5]] Output: [[1,5]] Explanation: Intervals [1,4] and [4,5] are considered overlapping.   Constraints: 1 <= intervals.length <= 10 4 intervals[i].length == 2 0 <= start i <= end i <= 10 4
Read more

Find the maximum number of bomb that can be detonated

  Problem You are given a list of bombs. The range of a bomb is defined as the area where its effect can be felt. This area is in the shape of a circle with the center as the location of the bomb. The bombs are represented by a 0-indexed 2D integer array bombs where bombs[i] = [xi, yi, ri]. xi and yi denote the X-coordinate and Y-coordinate of the location of the ith bomb, whereas ri denotes the radius of its range. You may choose to detonate a single bomb. When a bomb is detonated, it will detonate all bombs that lie in its range.  These bombs will further detonate the bombs that lie in their ranges. Given the list of bombs, return the maximum number of bombs that can be detonated if you are allowed to detonate only one bomb. Input: bombs = [[2,1,3],[6,1,4]] Output: 2 Explanation: The above figure shows the positions and ranges of the 2 bombs. If we detonate the left bomb, the right bomb will not be affected. But if we detonate the right bomb, both bombs will be detonated. So...
Read more