1
61%
master: 61%

Ran 23 Mar 2018 08:10AM UTC

Files 27

Run time 1s

Badge

Embed ▾

Committed 23 Mar 2018 08:08AM UTC coverage: 73.219% (-1.9%) from 75.104%

Job # 35.1

Build Type

push

travis-ci

Committed by

dpaukov

Commit Message

Add a method for calculating longest common sub-sequence (LCS).

Given two sequences, find the length of longest subsequence present in both of them.
A subsequence is a sequence that appears in the same relative order, but not necessarily contiguous.

Run Details

555 of 758 relevant lines covered (73.22%)

105.07 hits per line

dpaukov / classic-cherries / 35 / 1
61%
master: 61%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 35.1

dpaukov / classic-cherries / 35 / 1 61% master: 61%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 35.1

dpaukov / classic-cherries / 35 / 1
61%
master: 61%

README BADGES
x