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

dpaukov / classic-cherries / 117
61%

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

pending completion
117

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

Jobs
ID Job ID Ran Files Coverage
1 117.1 16 May 2019 10:16PM UTC 0
42.56
Travis Job 117.1
Source Files on build 117
Detailed source file information is not available for this build.
  • Back to Repo
  • Travis Build #117
  • bf6d4a77 on github
  • Prev Build on master (#116)
  • Next Build on master (#118)
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