← Accolite questions

Largest strictly increasing contiguous subarray with one deletion

Filed under Accolite

Given an array of N integers, find the length of the longest strictly increasing contiguous subarray, allowing at most one element deletion to maximize the length.

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 Accolite questions

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