Leetcode 3567. Minimum Absolute Difference in Sliding Submatrix

For each k×k sliding submatrix of an m×n integer grid, compute the smallest absolute difference between any two distinct values; the core challenge is efficiently maintaining the multiset/sorted order (or frequency buckets) of values as the window moves in 2D so you can quickly find the minimal adjacent gap.