Clear the Binary Grid by Normalizing Row Patterns

A control room monitors a rectangular wall of indicator lamps arranged as an m x n grid named grid. Each lamp holds one of two binary states: 0 means dark and 1 means lit. Two kinds of master switches are wired to the wall. Using a row switch reverses the state of every lamp in one chosen row, and using a column switch reverses the state of every lamp in one chosen column. Each switch may be used any number of times, in any order. Return true if some sequence of switch uses leaves every lamp dark, and false if no sequence can.

Examples
Input: [[1,0],[1,0]]
Output: true
Hints

Clear the Binary Grid by Normalizing Row Patterns

A control room monitors a rectangular wall of indicator lamps arranged as an `m x n` grid named `grid`. Each lamp holds one of two binary states: `0` means dark and `1` means lit. Two kinds of master switches are wired to the wall. Using a row switch reverses the state of every lamp in one chosen row, and using a column switch reverses the state of every lamp in one chosen column. Each switch may be used any number of times, in any order. Return `true` if some sequence of switch uses leaves every lamp dark, and `false` if no sequence can.