adding algo minimum number of operations to turn array of positive numbers into a palindrome

Author: ivanpenaloza

src/my_project/interviews/amazon_high_frequency_23/round_2/minimum_number_of_operations_to_turn_array_into_a_palindrom.py

@@ -0,0 +1,29 @@
+from typing import List, Union, Collection, Mapping, Optional
+from abc import ABC, abstractmethod
+
+class Solution:
+    def minimumOperations(self, nums: List[int]) -> int:
+
+        l, r = 0, len(nums) -1 
+        ls = nums[l]
+        rs = nums[r]
+        answer = 0
+
+        while l < r:
+
+            if ls == rs:
+                l += 1
+                r -= 1
+                ls = nums[l]
+                rs = nums[r]
+            elif ls <= rs:
+                l += 1
+                ls += nums[l]
+                answer += 1
+            else:
+                r -= 1
+                rs += nums[r]
+                answer += 1
+
+        return answer
+

src/my_project/interviews/amazon_high_frequency_23/round_2/minimum_swaps_to_group_all_ones.py

@@ -10,3 +10,13 @@ def minSwaps(self, data: List[int]) -> int:
             if i >= k: val -= data[i-k]
             if i+1 >= k: ans = max(ans, val)
         return k - ans
+    
+'''
+Window size (k): Count total number of 1s in the array. This is the size of the window needed to fit all 1s.
+
+Sliding window: Move a window of size k across the array and count how many 1s are already in each window position.
+
+Find maximum 1s: Track the maximum number of 1s found in any window (ans).
+
+Calculate swaps: The minimum swaps needed = k - ans (total 1s minus the maximum 1s already grouped in any window).
+'''