1
61%
master: 61%

Ran 13 Mar 2018 07:16AM UTC

Files 20

Run time 1s

Badge

Embed ▾

Committed 13 Mar 2018 07:14AM UTC coverage: 66.845% (-0.6%) from 67.468%

Job # 22.1

Build Type

push

travis-ci

Committed by

dpaukov

Commit Message

Add a solution for the Letter Combinations of a Phone Number issue based on
the Backtracking algorithm.

Given a digit string, return all possible letter combinations that the number could represent.
A mapping of digit to letters is just like on the telephone buttons is given.
Input:Digit string "23"
Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].

Run Details

375 of 561 relevant lines covered (66.84%)

37.41 hits per line

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

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 22.1

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

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 22.1

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

README BADGES
x