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

EFanZh / LeetCode / 20133986475
100%

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

25 Dec 2025 03:01PM UTC coverage: 99.937% (-0.005%) from 99.942%
20133986475

push

github

EFanZh
Add problem 3233: Find the Count of Numbers Which Are Not Special

296 of 296 branches covered (100.0%)

Branch coverage included in aggregate %.

44 of 49 new or added lines in 2 files covered. (89.8%)

119598 of 119673 relevant lines covered (99.94%)

7861.05 hits per line

New Missed Lines in Diff

Lines Coverage ∆ File
5
88.64
src/problem_3233_find_the_count_of_numbers_which_are_not_special/mathematical.rs
Jobs
ID Job ID Ran Files Coverage
1 20133986475.1 11 Dec 2025 01:04PM UTC 4851
99.94
GitHub Action Run
Source Files on build 20133986475
  • Tree
  • List 4851
  • 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 #20133986475
  • ec256517 on github
  • Prev Build on master (#20131559790)
  • Next Build on master (#20201246092)
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