Question: Given an array of integers, write a method to find indices m and n such that if you sorted elements m through n, the entire array would be sorted. Minimize n - m (that is, find the smallest such sequence). Example, Input: 1, 2, 4, 7, 10, 11, 7, 12, 6, 7, 16, 28, 29 Output: (3, 9)

From: Cracking the Coding Interview [McDowell]

Subject: Moderate

Load Another Question

Select a Subject

Select a Subject Algorithm Analysis Arrays and Strings Bit Manipulation C and Cpp Code Quality Combinatorial Search Concurrency Data Structures Databases Design Patterns Dynamic Programming General Graph Theory Hard Java Knowledge Based Linked Lists Math and Logic Puzzles Moderate Object-Oriented Design Recursion Recursion and Dynamic Programming Soft Skills Sorting and Searching Stacks and Queues System Design and Scalability Testing Threads and Locks Trees and Graphs