Open unicode-Ind opened 3 years ago
Can someone explain what is exactly needed to be done for following instruction ? -Edit the corresponding README.md file to add the link to your code in the corresponding section in alphabetical order.
I would like to contribute to the above problem in java as I am a participant of GSSOC'21. Kindly assign this to me.
Hi, I am GSSOC'21 participant, My code will be in python with proper comments and test cases. @tarun26091999 @rudrakshi99 Please assign me this. Thankyou!!
Hello, @shubhidua @unicode-Ind @Sathwika-02 @aaadddiii @anubhavitis, I think this is an important question and this should definitely be added in the Algo-Tree and I will start working on it as soon as I get assigned!! as I am a part of GSSoC'21, so I would like to implement this in c++.
@unicode-Ind @shubhidua @Sathwika-02 assigned.
Hi, I would like to solve this issue in C++ with proper test cases and comments. Please assign this issue to me if its not already solved.
@Srishti013 for C++ it's already done. Thanks for your interest!
I would like to contribute to the above code in java. Kindly assign this to me. Thanks.
Is your feature request related to a problem? Please describe. A string is given we have to generate all its possible permutations. A permutation of the string is defined as a word that contains all the characters of the original string but in any order. The output should contain only unique words in lexicographically sorted order.
Describe the solution you'd like The solution is based on recursion and word is generated from left to right. A word is generated by placing a character from available at the current position and solving for subproblem.
For example, (a) abc => abc, acb, bac, bca, cab, cba (b) aba => aab,aba,baa
Do you want to work on it Yes, and I would like to use C++ for this contribution under GSSOC21.