Min Swaps to Group 1s. POTD GFG

Описание: You are given a binary array arr[] consisting only of 0s and 1s. Determine the minimum number of swaps required to group all the 1s together in a contiguous subarray.

A swap operation allows you to choose any two indices i and j and exchange their values (i.e., swap(arr[i], arr[j])).

If the array contains no 1s, return -1.

LIKE the video, COMMENT if you have any questions and SHARE it with your loved once's. SeaU

https://www.geeksforgeeks.org/problem...

#GeeksforGeeks #array #swap #binary #binaryarray #CodingInterview #DSA #Algorithms #GFGPOTD #Programming #ProblemSolving #OBrutus #TechInterview #slidingwindow