DSA-Questions
DSA-Questions copied to clipboard
Next Permutation
Implement the next permutation, which rearranges the list of numbers into Lexicographically next greater permutation of list of numbers. If such arrangement is not possible, it must be rearranged to the lowest possible order i.e. sorted in an ascending order. You are given an list of numbers arr[ ] of size N.
Input: N = 6 arr = {1, 2, 3, 6, 5, 4} Output: {1, 2, 4, 3, 5, 6}
Hey can I work on this issue?
Can you assign me this issue?
this repo is not considered to hacktoberfest but you can contribute as community work, it will help many students