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

EFanZh / LeetCode / 20336210890
100%

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

01 Jan 2026 02:29PM UTC coverage: 99.936% (-0.001%) from 99.937%
20336210890

push

github

EFanZh
Add problem 3250: Find the Count of Monotonic Pairs I

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

119919 of 119996 relevant lines covered (99.94%)

7839.92 hits per line

New Missed Lines in Diff

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