Skip to content

Latest commit

 

History

History
9 lines (5 loc) · 313 Bytes

README.md

File metadata and controls

9 lines (5 loc) · 313 Bytes

Good morning! Here's your coding interview problem for today.

This problem was asked by WhatsApp.

Given an array of integers out of order, determine the bounds of the smallest window that must be sorted in order for the entire array to be sorted. For example, given [3, 7, 5, 6, 9], you should return (1, 3).