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

EFanZh / LeetCode / 38401173490
100%

Build:
DEFAULT BRANCH: master
Ran 13 Oct 2026 12:59PM UTC
Jobs 1
Files 5444
Run time 3min
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 Oct 2026 01:56PM UTC coverage: 99.82% (-0.001%) from 99.821%
38401173490

push

github

EFanZh
Add problem 4074: Maximum Product Pair With Target Sum

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%)

1 existing line in 1 file now uncovered.

129631 of 129865 relevant lines covered (99.82%)

7314.93 hits per line

Coverage Regressions

Lines Coverage ∆ File
1
87.8
-1.22% src/problem_3588_find_maximum_area_of_a_triangle/greedy.rs
Jobs
ID Job ID Ran Files Coverage
1 38401173490.1 13 Oct 2026 12:59PM UTC 5444
99.82
GitHub Action Run
Source Files on build 38401173490
  • Tree
  • List 5444
  • 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 #38401173490
  • 25387db6 on github
  • Prev Build on master (#38397583485)
  • Next Build on master (#38559617558)
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