22
61%

Ran 13 Mar 2018 07:16AM UTC

Jobs 2

Files 20

Run time 25s

Badge

Embed ▾

pending completion

Build # 22

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

391 of 567 relevant lines covered (68.96%)

74.83 hits per line

Jobs

ID	Job ID	Ran	Files	Coverage
1	22.1	13 Mar 2018 07:16AM UTC	0	66.84	Travis Job 22.1
2	22.2	13 Mar 2018 07:16AM UTC	0	68.96	Travis Job 22.2

Source Files on build 22

Detailed source file information is not available for this build.

dpaukov / classic-cherries / 22
61%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 22

dpaukov / classic-cherries / 22 61%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 22

dpaukov / classic-cherries / 22
61%

README BADGES
x