Algorithms and Data Structures

  • Profound Academy

    • Status
      • 1
        Implementation
      • 2
        Bitwise operations
      • 3
        Prefix Sums
      • 4
        Sliding window / Two pointers
      • 5
        Modular Arithmetic
      • 6
        Number Theory
      • 7
        Binary Search
      • 8
        Basic Sorting
      • 9
        Greedy Algorithms
      • 10
        Basic Dynamic Programming
      • 11
        Recursion
      • 12
        Linked LIst
      • 13
        Queue & Stack
      • 14
        Binary tree + BST
      • 15
        Divide & Conquer + Advanced Sorting
      • 16
        Heap
      • 17
        Hashing
      • 18
        Graph Representation

    • Generate permutations

    Given a string with unique characters s, you are asked to print all the possible |s|! permutations of the string.

    Input

    The input contains a single line representing s (1 ≤ |s| ≤ 8). It’s guaranteed that all the letters are unique.

    Output

    The program should print all the possible permutations of s each on a separate line. They can be in arbitrary order.

    Examples

    Input
    Output
    abc
    abc acb bac bca cab cba
     

    Constraints

    Time limit: 3 seconds

    Memory limit: 512 MB

    Output limit: 15 MB

    To check your solution you need to sign in
    Sign in to continue