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

EFanZh / LeetCode / 30268541043
100%

Build:
DEFAULT BRANCH: master
Ran 27 Jul 2026 01:06PM UTC
Jobs 1
Files 5300
Run time 11min
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

05 Aug 2026 03:02PM UTC coverage: 99.839%. Remained the same
30268541043

push

github

EFanZh
Add problem 3857: Minimum Cost to Split into Ones

296 of 296 branches covered (100.0%)

Branch coverage included in aggregate %.

15 of 15 new or added lines in 2 files covered. (100.0%)

1 existing line in 1 file now uncovered.

126844 of 127049 relevant lines covered (99.84%)

7472.46 hits per line

Coverage Regressions

Lines Coverage ∆ File
1
87.8
0.0% src/problem_3588_find_maximum_area_of_a_triangle/greedy.rs
Jobs
ID Job ID Ran Files Coverage
1 30268541043.1 27 Jul 2026 01:06PM UTC 5300
99.84
GitHub Action Run
Source Files on build 30268541043
  • Tree
  • List 5300
  • Changed 1
  • Source Changed 0
  • Coverage Changed 1
Coverage ∆ File Lines Relevant Covered Missed Hits/Line Branch Hits Branch Misses
  • Back to Repo
  • Github Actions Build #30268541043
  • 9231495a on github
  • Prev Build on master (#30262048693)
  • Next Build on master (#30360859824)
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE TRIAL · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2026 Coveralls, Inc