Oracle Developer interview questions

there were 2 coding questions related to data structures and algorithm

Given an array of integers, find the length of the shortest possible subsequence of integers that are unordered. A set of integers are said to be unordered if they are neither decreasing nor increasing. [Hint: start checking if it is increasing/decreasing and return 0, else check if an unordered triplet exists. If it does, return 3, else 0]