801_Minimum_Swaps_To_Make_Sequences_Increasing

Author: Partho Biswas

README.md

@@ -565,6 +565,7 @@ BFS, DFS, Dijkstra, Floyd–Warshall, Bellman-Ford, Kruskal, Prim's, Minimum Spa
 |35| [115. Distinct Subsequences](https://tinyurl.com/gudjxts) | [Python](https://tinyurl.com/wu6rdaw/115_Distinct_Subsequences.py)| **[educative.io](https://tinyurl.com/yx6s5c4m)** | Hard | TODO: Check again |
 |36| **[97. Interleaving String](https://tinyurl.com/qmp8yn5)** | [Python](https://tinyurl.com/wu6rdaw/97_Interleaving_String.py)| **[educative.io](https://tinyurl.com/uzbogsf)**, [Vid 1](https://tinyurl.com/wlmpvjo) | Hard | TODO: Check again. Very difficult and tricky to understand |
 |37| [1048. Longest String Chain](https://tinyurl.com/uvb5v6s) | [Python](https://tinyurl.com/wu6rdaw/1048_Longest_String_Chain.py)| [Art 1](https://tinyurl.com/tcslm9l) | Medium | Modified LIS |
+|38| **[801. Minimum Swaps To Make Sequences Increasing](https://tinyurl.com/rvtcyvb)** | [Python](https://tinyurl.com/wu6rdaw/801_Minimum_Swaps_To_Make_Sequences_Increasing.py)| [Art 1](https://tinyurl.com/tzx7wpv), [Art 2](https://tinyurl.com/ugybcmz) | Medium | TODO: Check again. Very analytical and tricky to come up with |
 
 
 </p>

leetcode.com/python/801_Minimum_Swaps_To_Make_Sequences_Increasing.py

@@ -0,0 +1,22 @@
+
+# Source:   https://tinyurl.com/tzx7wpv
+class Solution(object):
+    def minSwap(self, A, B):
+        """
+        :type A: List[int]
+        :type B: List[int]
+        :rtype: int
+        """
+        arrLen = len(A)
+        swaps, noSwaps = [arrLen] * arrLen, [arrLen] * arrLen
+        swaps[0], noSwaps[0] = 1, 0
+        for i in range(1, arrLen):
+            currentNumA, prevNumA = A[i], A[i - 1]
+            currentNumB, prevNumB = B[i], B[i - 1]
+            if currentNumA > prevNumA and currentNumB > prevNumB:
+                noSwaps[i] = noSwaps[i - 1]
+                swaps[i] = swaps[i - 1] + 1
+            if currentNumB > prevNumA and currentNumA > prevNumB:
+                noSwaps[i] = min(noSwaps[i], swaps[i - 1]) # If we do ot make the swap in this case
+                swaps[i] = min(swaps[i], noSwaps[i - 1] + 1) # If we make the swap in this case
+        return min(swaps[-1], noSwaps[-1])