Leetcode 1284 Minimum Number of Flips to Convert Binary Matrix to Zero Matrix - Hard Question

If you find this video helpful, please 'Like' or 'Subscribe'.
This is really helpful for the channel and also motivates me to do more of such good videos.

Leetcode 1284 Minimum Number of Flips to Convert Binary Matrix to Zero Matrix - Hard Question

Link To The Problem:

Problem Description:
Given a m x n binary matrix mat. In one step, you can choose one cell and flip it and all the four neighbors of it if they exist (Flip is changing 1 to 0 and 0 to 1). A pair of cells are called neighbors if they share one edge.

Return the minimum number of steps required to convert mat to a zero matrix or -1 if you cannot.

A binary matrix is a matrix with all cells equal to 0 or 1 only.

A zero matrix is a matrix with all cells equal to 0.

GITHUB LINK:

#coding #softwareengineer #Leetcode #Algorithm #DataStructure #Java #programmer #tech #software #codinglife #preparation
#interview #programminglife #programmingisfun #matrix #leetcode #codeforces #algorithm #algorithms #datastructure #datastructuresandalgorithms