LeetCode in Golang - Next Permutation

#Array #Permutation #Reverse

Using the below three steps
1. Find the pivot index from the end of the Array where element in pivot index - 1 is less than element in pivot index
2. Find the minimum greater element starting from the pivot index to the end of the Array and swap it with the element in the position pivot index - 1
3. Reverse all the elements after the pivot index till the end of the Array
to solve this LeetCode Next Permutation problem in Golang.

Please subscribe, like and comment to let us learn from each other!