This problem is Enough to got potential !!!!

Revision en1, by sanhayu546, 2023-06-21 07:49:24

Like we have an array containing 0 and 1 only of length (10^5). we have to do some sort of operation on 1 only like the right shift or left shift by one unit of length so that All 1 in same fashion. And one operation of cost is 1 unit, in minimum cost all 1 in the same fashion.

Example:- 0010101 -> Like in 2 operations we have an array look like this 0001110.

can somebody tell me how to solve this problem.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English sanhayu546 2023-06-21 07:49:53 2 Tiny change: 'is problem.\n\n' -> 'is problem?\n\n' (published)
en1 English sanhayu546 2023-06-21 07:49:24 467 please help (saved to drafts)