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

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

Build:
DEFAULT BRANCH: master
Ran 16 May 2019 10:16PM UTC
Files 105
Run time 8s
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

16 May 2019 10:14PM UTC coverage: 42.556% (-0.8%) from 43.34%
117.1

push

travis-ci

dpaukov
Solution for 124. Binary Tree Maximum Path Sum (Hard).
https://leetcode.com/problems/binary-tree-maximum-path-sum/

1129 of 2653 relevant lines covered (42.56%)

34.1 hits per line

Source Files on job 117.1
  • Tree
  • List 0
  • Changed 0
  • Source Changed 0
  • Coverage Changed 0
Coverage ∆ File Lines Relevant Covered Missed Hits/Line
  • Back to Build 83
  • Travis Job 117.1
  • bf6d4a77 on github
  • Prev Job for on master (#116.1)
  • Next Job for on master (#118.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