FastPrepDistinct Values in Maximum-Sum Square Windows

Distinct Values in Maximum-Sum Square Windows

ZipRecruiter logoZipRecruiter● MediumNEW GRADOA
Learn

Problem statement

Enumerate every size by size submatrix. Find the maximum window sum, collect each distinct value appearing in any tied maximum window, and return their sum.

Function

sumDistinctMaxWindowValues(matrix: int[][], size: int) → long

Examples

Example 1

matrix = [[1,2,1],[2,1,2],[1,2,1]]size = 2return = 3

All windows tie and the distinct union is {1,2}.

Example 2

matrix = [[1,2],[3,4]]size = 1return = 4

The maximum one-cell window contains 4.

Constraints

  • 1 <= rows,columns <= 200
  • 1 <= size <= min(rows,columns)

More ZipRecruiter problems

See ZipRecruiter hiring insights
public long sumDistinctMaxWindowValues(int[][] matrix, int size) {
    // Write your code here.
}
matrix[[1,2,1],[2,1,2],[1,2,1]]
size2
expected3
Checking account…