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

EFanZh / LeetCode / 25799657692
100%

Build:
DEFAULT BRANCH: master
Ran 13 May 2026 12:42PM UTC
Jobs 1
Files 5136
Run time 12min
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

15 May 2026 01:38PM UTC coverage: 99.851%. Remained the same
25799657692

push

github

EFanZh
Add problem 3658: GCD of Odd and Even Sums

296 of 296 branches covered (100.0%)

Branch coverage included in aggregate %.

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

1 existing line in 1 file now uncovered.

124716 of 124903 relevant lines covered (99.85%)

7600.76 hits per line

Coverage Regressions

Lines Coverage ∆ File
1
86.59
0.0% src/problem_3588_find_maximum_area_of_a_triangle/greedy.rs
Jobs
ID Job ID Ran Files Coverage
1 25799657692.1 13 May 2026 12:42PM UTC 5136
99.85
GitHub Action Run
Source Files on build 25799657692
  • Tree
  • List 5136
  • 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 #25799657692
  • 4585efca on github
  • Prev Build on master (#25798946100)
  • Next Build on master (#25860794733)
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