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

EFanZh / LeetCode / 38051448301
100%

Build:
DEFAULT BRANCH: master
Ran 10 Oct 2026 12:20PM UTC
Jobs 1
Files 5436
Run time 5min
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

11 Oct 2026 03:16PM UTC coverage: 99.82%. Remained the same
38051448301

push

github

EFanZh
Add problem 2513: Minimize the Maximum of Two Arrays

296 of 296 branches covered (100.0%)

Branch coverage included in aggregate %.

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

1 existing line in 1 file now uncovered.

129485 of 129719 relevant lines covered (99.82%)

7323.13 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 38051448301.1 10 Oct 2026 12:20PM UTC 5436
99.82
GitHub Action Run
Source Files on build 38051448301
  • Tree
  • List 5436
  • 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 #38051448301
  • df92fafa on github
  • Prev Build on master (#37924526343)
  • Next Build on master (#38335028100)
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