First Round: Written Test

This round contained 3 sections, each having a different fixed time. Each question also had a fixed time.

Second and third rounds were interviews of average difficulty.

Given an array of integers, find the length of the shortest possible subsequence of integers that are unordered. A set of integers is said to be unordered if it is neither decreasing nor increasing.

[Hint: Start checking if it is increasing or decreasing and return 0. Else, check if an unordered triplet exists. If it does, return 3. Else, return 0.]