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

EFanZh / LeetCode / 4391269118 / 1
100%
master: 100%

Build:
DEFAULT BRANCH: master
Ran 11 Mar 2023 07:44AM UTC
Files 2706
Run time 34s
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

11 Mar 2023 07:44AM UTC coverage: 100.0%. Remained the same
4391269118.1

push

github

EFanZh
Add problem 1477: Find Two Non-overlapping Sub-arrays Each With Target Sum

316 of 316 branches covered (100.0%)

Branch coverage included in aggregate %.

79900 of 79900 relevant lines covered (100.0%)

13731.93 hits per line

Source Files on job 4391269118.1
  • Tree
  • List 0
  • Changed 24
  • Source Changed 1
  • Coverage Changed 24
Coverage ∆ File Lines Relevant Covered Missed Hits/Line Branch Hits Branch Misses
  • Back to Build 4391269118
  • d5859c73 on github
  • Prev Job for on master (#4383958565.1)
  • Next Job for on master (#4391322600.1)
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