Loading...
Is this your company?
A 2d matrix DP problem, longest contiguous sub array whose sum is less than k.
Check out your Company Bowl for anonymous work chats.
Get actionable career advice tailored to you by joining more bowls.
Stay ahead in opportunities and insider tips by following your dream companies.
Get personalised job recommendations and updates by starting your searches.