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

dpaukov / classic-cherries / #127
61%

Build:
DEFAULT BRANCH: master
Ran 19 Jan 2025 05:04AM UTC
Jobs 1
Files 286
Run time 1min
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

19 Jan 2025 05:04AM UTC coverage: 61.433% (+0.3%) from 61.14%
#127

push

dpaukov
Solution for 3428. Maximum and Minimum Sums of at Most Size K Subsequences (Medium).
https://leetcode.com/problems/maximum-and-minimum-sums-of-at-most-size-k-subsequences/description/

4500 of 7325 relevant lines covered (61.43%)

0.61 hits per line

Jobs
ID Job ID Ran Files Coverage
1 #127.1 19 Jan 2025 05:04AM UTC 286
61.43
Source Files on build #127
  • Tree
  • List 286
  • Changed 0
  • Source Changed 0
  • Coverage Changed 0
Coverage ∆ File Lines Relevant Covered Missed Hits/Line
  • Back to Repo
  • cfdb6bd5 on github
  • Prev Build on master
  • Next Build on master
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

© 2025 Coveralls, Inc