← Wells Fargo questions
CodingReported in a candidate post, Sep 2020

Most Negative Number in Subarrays

Filed under Wells Fargo

Given an array of N integers and an integer K, find the most negative (minimum) number in every contiguous subarray of length K. If no negative numbers exist in a subarray, output 0 for that window.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Wells Fargo questions

Collected from public candidate posts and coding forums. Updated Nov 2026.