/*** HD - 1
* @param data
* @return the length of the longest ascending sequence in the array
* return 0 if the array is null or empty.
*/
public static int longestAscendingSequenceLength(int[] data) {
return -100; //-100 is just a placeholder to satisfy the "contract", to be completed
}
/*** HD - 2
* @param data
* @return the starting index of the longest ascending sequence in the array
* in case of a tie, return the starting index of the first of the tied sequences
* return -1 if the array is null or empty.
*/
public static int longestAscendingSequenceStart(int[] data) {
return -100; //-100 is just a placeholder to satisfy the "contract", to be completed
}
/*** HD - 3
* @param data
* @return the longest ascending sequence in the array
* in case of a tie, return the first of the tied sequences
* return null if the array is null
* return an empty array if the array is empty
*/
public static int[] longestAscendingSequence(int[] data) {
return new int[0]; //to be completed
}