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

EFanZh / LeetCode / 25670461165
100%

Build:
DEFAULT BRANCH: master
Ran 11 May 2026 12:37PM UTC
Jobs 1
Files 5125
Run time 27min
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

10 May 2026 01:54PM UTC coverage: 100.0% (+0.2%) from 99.85%
25670461165

push

github

EFanZh
Add problem 3627: Maximum Median Sum of Subsequences of Size 3

296 of 296 branches covered (100.0%)

Branch coverage included in aggregate %.

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

1 existing line in 1 file now uncovered.

100649 of 100649 relevant lines covered (100.0%)

9432.36 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 25670461165.1 11 May 2026 12:37PM UTC 5125
99.85
GitHub Action Run
Source Files on build 25670461165
  • Tree
  • List 5125
  • Changed 0
  • Source Changed 0
  • Coverage Changed 0
Coverage ∆ File Lines Relevant Covered Missed Hits/Line Branch Hits Branch Misses
  • Back to Repo
  • Github Actions Build #25670461165
  • 38b95504 on github
  • Prev Build on master (#25551872567)
  • Next Build on master (#25672146071)
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