C#: Longest Increasing Consecutive Subsequence

Difficulty Level: HARD

Problem Statement:

Given N elements, write a program that prints the length of the longest increasing subsequence whose adjacent element difference is one.

Input:

arr[] = {15, 8, 9, 2, 10, 11, 12, 13, 16, 17 }

Output:

6