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

EFanZh / LeetCode / 21358565756
100%

Build:
DEFAULT BRANCH: master
Ran 26 Jan 2026 01:02PM UTC
Jobs 1
Files 4938
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

06 Feb 2026 02:49PM UTC coverage: 99.928% (-0.002%) from 99.93%
21358565756

push

github

EFanZh
Add problem 3326: Minimum Division Operations to Make Array Non Decreasing

296 of 296 branches covered (100.0%)

Branch coverage included in aggregate %.

117 of 119 new or added lines in 3 files covered. (98.32%)

121275 of 121362 relevant lines covered (99.93%)

7821.3 hits per line

New Missed Lines in Diff

Lines Coverage ∆ File
1
98.15
src/problem_3326_minimum_division_operations_to_make_array_non_decreasing/dynamic_programming.rs
1
98.18
src/problem_3326_minimum_division_operations_to_make_array_non_decreasing/dynamic_programming_cached.rs
Jobs
ID Job ID Ran Files Coverage
1 21358565756.1 26 Jan 2026 01:02PM UTC 4938
99.93
GitHub Action Run
Source Files on build 21358565756
  • Tree
  • List 4938
  • 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 #21358565756
  • e062da97 on github
  • Prev Build on master (#21355661467)
  • Next Build on master (#21437003580)
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