Longest Increasing Subsequence

Problem

Given an array of integers, find the length of the longest increasing subsequence in the array.
Example input: [10, 9, 2, 5, 3, 7, 101, 18]
Example output: 4

Solution

This solution is in C#. Our A.I. can create solutions in multiple languages.

kayakane

using System;
using System.Collections.Generic;
using System.Linq;

namespace InterviewPreperationGuide.Core.CrackingTheCodingInterview.c17q10 {
    public class Solution {
        public void Init () {
            Console.WriteLine ();
        }
    }
}