Question

You are given an Nx N matrix in which every cell is colored black or white.
Columns are numbered from 0 to N-1 (from left to right). This coloring is
represented by a non-empty array of integers A. If the K-th number in the
array is equal to X then the X lowest cells in the K-th column of the matrix al
black. The rest of the cells in the K-th column are white. The task is to
calculate the side length of the biggest black square (a square containing
only black cells).
Write a function:
class Solution { public int solution(int[] A); }
that, given an array of integers A of length N representing the coloring of the
matrix, returns the side length of the biggest black square.
Examples:
1. Given A = [1, 2,5, 3, 1,3), the function should return 2. For example, the
black square of side 2 contains the two lowest rows of the 1st and 2nd
columns (counting from 0).​

Answer 1

Answer:

xxnx

hshdbdhhɗhdyeuehhrgrgg4hh4ue

Answer 2

Answer: please any one answer this

Step-by-step explanation: