## Editorial for BSSPC '21 S1 - Lakshy and Palindromic Rectangle

Remember to use this editorial

**only**when stuck, and**not to copy-paste code from it**. Please be respectful to the problem author and editorialist.**Submitting an official solution before solving the problem yourself is a bannable offence.**Author:

#### Subtask 1

In order for every row and column to be a palindrome, the grid must be of the form:

Where are (not necessarily distinct) lowercase letters. We therefore check each group of cells that must contain the same letter if we can make this the case, filling in empty cells as needed.

**Time Complexity:**

#### Subtask 2

Generalizing the previous solution to an arbitrary by grid, we notice that every cell , denoting the row and column, is with a set of four not necessarily distinct cells that must contain the same letter: . Since these sets are disjoint, we can handle each one independently, like in the previous subtask.

**Time Complexity:**

## Comments