All Eyes On Code

Latest Post

Longest Increasing Subsequence in O(n lg n) in Erlang.

In this attempt I have tried to code for more of a typical problem, finding longest increasing subsequence, which I will call LIS throughout. LIS is sister of a more general Longest Common Subsequence (LCS) problem used to find longest common subsequences in two strings. Both of them are solved using dynamic programming paradigm in … Continue reading →