Question d’entretien chez X

A 2d matrix DP problem, longest contiguous sub array whose sum is less than k.