EFanZh / LeetCode
100%

DEFAULT BRANCH: master
Repo Added
Files 4855
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.938% (+0.001%) from 99.937%
20231254382

push

github

EFanZh 
Add problem 3239: Minimum Number of Flips to Make Binary Grid Palindromic I

296 of 296 branches covered (100.0%)

Branch coverage included in aggregate %.

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

119657 of 119732 relevant lines covered (99.94%)

7857.18 hits per line

Relevant lines Covered
119732 RELEVANT LINES 119657 COVERED LINES
7857.18 HITS PER LINE
Source Files on master

Recent builds

Builds Branch Commit Type Ran Committer Via Coverage
20231254382 master Add problem 3239: Minimum Number of Flips to Make Binary Grid Palindromic I push EFanZh github
99.94
20230822616 master Add problem 3238: Find the Number of Winning Players push EFanZh github
99.94
20201246092 master Fix Clippy warnings push EFanZh github
99.94
20133986475 master Add problem 3233: Find the Count of Numbers Which Are Not Special push EFanZh github
99.94
20131559790 master Add problem 3232: Find if Digit Game Can Be Won push EFanZh github
99.94
20097245902 master Add problem 3228: Maximum Number of Operations to Move Ones to the End push EFanZh github
99.94
20096457826 master Add problem 3227: Vowels Game in a String push EFanZh github
99.94
20062363781 master Add problem 3226: Number of Bit Changes to Make Two Integers Equal push EFanZh github
99.94
20061224499 master Add problem 3223: Minimum Length of String After Operations push EFanZh github
99.94
20028508899 master Add problem 3222: Find the Winning Player in Coin Game push EFanZh github
99.94
See All Builds (2008)