Minimum Number of Clicks to Make All Cells Zero

Problem Statement

Minimum Number of Clicks to Make All Cells Zero Problem Description You are given an n x m binary matrix, where each cell contains either 0 or 1. You can perform a special operation called a "click" on any cell (i, j), which toggles the value of the cell (i, j) and its immediate neighbors (up, down, left, right). Toggling a cell means flipping its value from 0 to 1 or from 1 to 0. Your task is to determine the minimum number of clicks required to convert the entire matrix into a matrix with all cells containing 0. Return the minimum number of clicks to make all the matrix cell elements as 0. Input Format The first line of input contains 2 space separated integers n, m; representing row size and column size of the matrix. Next n lines, each contain m characters (either '0' or '1'); representing the rows of the grid. Output Format Output contains an integer representing the minimum number of clicks to make all the matrix cell elements as 0. Constraints 2 <= n, m <= 50 Matrix contai