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

EFanZh / LeetCode / 31103661657
100%

Build:
DEFAULT BRANCH: master
Ran 06 Aug 2026 12:59PM UTC
Jobs 1
Files 5326
Run time 9min
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

18 Aug 2026 01:50PM UTC coverage: 99.837% (-0.002%) from 99.839%
31103661657

push

github

EFanZh
Add problem 3867: Sum of GCD of Formed Pairs

296 of 296 branches covered (100.0%)

Branch coverage included in aggregate %.

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

2 existing lines in 1 file now uncovered.

127230 of 127438 relevant lines covered (99.84%)

7449.65 hits per line

Coverage Regressions

Lines Coverage ∆ File
2
86.59
-2.44% src/problem_3588_find_maximum_area_of_a_triangle/greedy.rs
Jobs
ID Job ID Ran Files Coverage
1 31103661657.1 06 Aug 2026 12:59PM UTC 5326
99.84
GitHub Action Run
Source Files on build 31103661657
  • Tree
  • List 5326
  • 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 #31103661657
  • d080cc58 on github
  • Prev Build on master (#31102182552)
  • Next Build on master (#31390728579)
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