EFanZh / LeetCode
100%

DEFAULT BRANCH: master
Repo Added
Files 4743
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

LAST BUILD ON BRANCH master
branch: SELECT
CHANGE BRANCH
x

coverage: 99.962%. Remained the same
18874343579

push

github

EFanZh 
Add problem 3120: Count the Number of Special Characters I

316 of 316 branches covered (100.0%)

Branch coverage included in aggregate %.

19 of 19 new or added lines in 2 files covered. (100.0%)

117964 of 118009 relevant lines covered (99.96%)

7971.84 hits per line

Relevant lines Covered
118009 RELEVANT LINES 117964 COVERED LINES
7971.84 HITS PER LINE
Source Files on master

Recent builds

Builds Branch Commit Type Ran Committer Via Coverage
18874343579 master Add problem 3120: Count the Number of Special Characters I push EFanZh github
99.96
18872489338 master Add problem 3115: Maximum Prime Difference push EFanZh github
99.96
18841196162 master Add problem 3114: Latest Time You Can Obtain After Replacing Characters push EFanZh github
99.96
18816453617 master Add problem 3111: Minimum Rectangles to Cover Points push EFanZh github
99.97
18748248851 master Add problem 3111: Minimum Rectangles to Cover Points push EFanZh github
99.97
18747813923 master Add problem 3110: Score of a String push EFanZh github
99.97
18719875814 master Refactor push EFanZh github
99.97
18715871831 master Add problem 3107: Minimum Operations to Make Median of Array Equal to K push EFanZh github
99.97
18714860948 master Add problem 3106: Lexicographically Smallest String After Operations With Constraint push EFanZh github
99.97
18683477108 master Add problem 3105: Longest Strictly Increasing or Strictly Decreasing Subarray push EFanZh github
99.97
See All Builds (1946)