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

EFanZh / LeetCode / 20336269169
100%

Build:
DEFAULT BRANCH: master
Ran 18 Dec 2025 12:04PM UTC
Jobs 1
Files 4867
Run time 197min
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

02 Jan 2026 01:35PM UTC coverage: 99.935% (-0.001%) from 99.936%
20336269169

push

github

EFanZh
Add problem 3251: Find the Count of Monotonic Pairs II

296 of 296 branches covered (100.0%)

Branch coverage included in aggregate %.

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

119951 of 120029 relevant lines covered (99.94%)

7837.76 hits per line

New Missed Lines in Diff

Lines Coverage ∆ File
1
96.43
src/problem_3251_find_the_count_of_monotonic_pairs_ii/dynamic_programming.rs
Jobs
ID Job ID Ran Files Coverage
1 20336269169.1 18 Dec 2025 12:04PM UTC 4867
99.94
GitHub Action Run
Source Files on build 20336269169
  • Tree
  • List 4867
  • 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 #20336269169
  • c231c851 on github
  • Prev Build on master (#20336210890)
  • Next Build on master (#20368853216)
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