From 65c530be3353a6b48011283ba1ed8b96816a4bc8 Mon Sep 17 00:00:00 2001
From: Sangeeth Sudheer <sangeeth96@users.noreply.github.com>
Date: Tue, 5 Apr 2022 21:59:48 +0530
Subject: [PATCH] feat(0031_next-permutation): add py3 soln

---
 0031_next-permutation/README.md           | 36 +++++++++++++++++++++++
 0031_next-permutation/python3/solution.py | 35 ++++++++++++++++++++++
 2 files changed, 71 insertions(+)
 create mode 100644 0031_next-permutation/README.md
 create mode 100644 0031_next-permutation/python3/solution.py

diff --git a/0031_next-permutation/README.md b/0031_next-permutation/README.md
new file mode 100644
index 0000000..3562b3c
--- /dev/null
+++ b/0031_next-permutation/README.md
@@ -0,0 +1,36 @@
+A **permutation** of an array of integers is an arrangement of its members into a sequence or linear order.
+
+*   For example, for `arr = [1,2,3]`, the following are considered permutations of `arr`: `[1,2,3]`, `[1,3,2]`, `[3,1,2]`, `[2,3,1]`.
+
+The **next permutation** of an array of integers is the next lexicographically greater permutation of its integer. More formally, if all the permutations of the array are sorted in one container according to their lexicographical order, then the **next permutation** of that array is the permutation that follows it in the sorted container. If such arrangement is not possible, the array must be rearranged as the lowest possible order (i.e., sorted in ascending order).
+
+*   For example, the next permutation of `arr = [1,2,3]` is `[1,3,2]`.
+*   Similarly, the next permutation of `arr = [2,3,1]` is `[3,1,2]`.
+*   While the next permutation of `arr = [3,2,1]` is `[1,2,3]` because `[3,2,1]` does not have a lexicographical larger rearrangement.
+
+Given an array of integers `nums`, _find the next permutation of_ `nums`.
+
+The replacement must be **[in place](http://en.wikipedia.org/wiki/In-place_algorithm)** and use only constant extra memory.
+
+**Example 1:**
+
+    Input: nums = [1,2,3]
+    Output: [1,3,2]
+    
+
+**Example 2:**
+
+    Input: nums = [3,2,1]
+    Output: [1,2,3]
+    
+
+**Example 3:**
+
+    Input: nums = [1,1,5]
+    Output: [1,5,1]
+    
+
+**Constraints:**
+
+*   `1 <= nums.length <= 100`
+*   `0 <= nums[i] <= 100`
\ No newline at end of file
diff --git a/0031_next-permutation/python3/solution.py b/0031_next-permutation/python3/solution.py
new file mode 100644
index 0000000..a550c60
--- /dev/null
+++ b/0031_next-permutation/python3/solution.py
@@ -0,0 +1,35 @@
+class Solution:
+    def nextPermutation(self, nums: List[int]) -> None:
+        """
+        Do not return anything, modify nums in-place instead.
+        """
+        # Find start of strictly decreasing section from the right
+        # and identify the position of element right before it
+        
+        right = len(nums) - 1
+        
+        while right > 0:
+            if nums[right - 1] < nums[right]:
+                break
+            
+            right -= 1
+        
+        swap_pos = right - 1
+        
+        # Array is already in decreasing order, hence we return the reverse
+        if swap_pos < 0:
+            nums.reverse()
+            return
+        
+        # Find next greatest element from [swap_pos + 1, n)
+        right = len(nums) - 1
+        while right > swap_pos:
+            if nums[right] > nums[swap_pos]:
+                break
+            
+            right -= 1
+        
+        nums[swap_pos], nums[right] = nums[right], nums[swap_pos]
+        
+        # Reverse [swap_pos + 1, n)
+        nums[swap_pos + 1:] = nums[:swap_pos:-1]