You are given an array of n strings strs, where each string has the same length.

These strings can be arranged into a grid, with each string placed on a separate row.

You want to identify all columns that are not sorted lexicographically from top to bottom.

Return the total number of columns that must be deleted so that every remaining column is lexicographically sorted.

Constraints:

• n == strs.length

• $1 \leq$ n $\leq 100$

• $1 \leq$ strs[i].length $\leq 1000$

• strs[i] consists of lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.