• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

Silvochka / dynamic-programming-with-ts / 9 / 1
98%
main: 98%

Build:
DEFAULT BRANCH: main
Ran 24 Jun 2021 04:14AM UTC
Files 17
Run time 1s
Badge
Embed ▾
README BADGES
x

If you need to use a raster PNG badge, change the '.svg' to '.png' in the link

Markdown

Textile

RDoc

HTML

Rst

24 Jun 2021 04:13AM UTC coverage: 98.447% (+0.4%) from 98.0%
9.1

push

travis-ci-com

Silvochka
Add family of Fibonacci problems

- Classic Fibonacci
- Number of ways to reach top of staircase
- Min jumps to reach top of staircase with variable jumps length
- Min jumps to reach top of staircase with fee for every step
- Get max gain for thief

Also moved helper to the common folder

71 of 74 branches covered (95.95%)

Branch coverage included in aggregate %.

246 of 248 relevant lines covered (99.19%)

20.52 hits per line

Source Files on job 9.1
  • Tree
  • List 0
  • Changed 10
  • Source Changed 10
  • Coverage Changed 3
Coverage ∆ File Lines Relevant Covered Missed Hits/Line Branch Hits Branch Misses
  • Back to Build 8
  • Travis Job 9.1
  • a4fa57fe on github
  • Prev Job for on main (#8.1)
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2026 Coveralls, Inc