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

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

Build:
DEFAULT BRANCH: master
Ran 30 May 2019 05:46AM UTC
Files 109
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

30 May 2019 05:43AM UTC coverage: 44.004% (+1.0%) from 43.052%
126.1

push

travis-ci

dpaukov
Solution for 329. Longest Increasing Path in a Matrix (Hard).
https://leetcode.com/problems/longest-increasing-path-in-a-matrix/

1343 of 3052 relevant lines covered (44.0%)

0.44 hits per line

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