Skip to content

Actions: EFanZh/LeetCode

Actions

Coverage

Actions

Loading...
Loading

Show workflow options

Create status badge

Loading
coverage.yml
430 workflow runs
430 workflow runs

Filter by Event

Filter by Status

Filter by Branch

Filter by Actor

Add problem 3196: Maximize Total Cost of Alternating Subarrays Coverage #2055: Commit bfa2125 pushed by EFanZh
2m 21s master
master
2m 21s
Add problem 3195: Find the Minimum Area to Cover All Ones I Coverage #2054: Commit c3e1271 pushed by EFanZh
2m 13s master
master
2m 13s
Add problem 3195: Find the Minimum Area to Cover All Ones I Coverage #2053: Commit 8a72eb0 pushed by EFanZh
2m 25s master
master
2m 25s
Add problem 3194: Minimum Average of Smallest and Largest Elements Coverage #2052: Commit 98595e8 pushed by EFanZh
2m 15s master
master
2m 15s
Add problem 3192: Minimum Operations to Make Binary Array Elements Eq… Coverage #2051: Commit a304b0a pushed by EFanZh
2m 11s master
master
2m 11s
Add problem 3192: Minimum Operations to Make Binary Array Elements Eq… Coverage #2050: Commit 96e9e9d pushed by EFanZh
2m 22s master
master
2m 22s
Add problem 3191: Minimum Operations to Make Binary Array Elements Eq… Coverage #2049: Commit 1a4ad1c pushed by EFanZh
2m 23s master
master
2m 23s
Add problem 3190: Find Minimum Operations to Make All Elements Divisi… Coverage #2048: Commit af836f0 pushed by EFanZh
2m 2s master
master
2m 2s
Add problem 3186: Maximum Total Damage With Spell Casting Coverage #2047: Commit fc4948e pushed by EFanZh
2m 56s master
master
2m 56s
Add problem 3186: Maximum Total Damage With Spell Casting Coverage #2046: Commit 9b63699 pushed by EFanZh
2m 10s master
master
2m 10s
Add problem 3185: Count Pairs That Form a Complete Day II Coverage #2045: Commit 2f5e2b0 pushed by EFanZh
3m 35s master
master
3m 35s
Add problem 3184: Count Pairs That Form a Complete Day I Coverage #2044: Commit f700868 pushed by EFanZh
2m 8s master
master
2m 8s
Add problem 3179: Find the N-th Value After K Seconds Coverage #2043: Commit a95199e pushed by EFanZh
2m 8s master
master
2m 8s
Add problem 3178: Find the Child Who Has the Ball After K Seconds Coverage #2042: Commit 65fcc64 pushed by EFanZh
2m 25s master
master
2m 25s
Add problem 3175: Find The First Player to win K Games in a Row Coverage #2041: Commit 91e9c34 pushed by EFanZh
2m 26s master
master
2m 26s
Add problem 3175: Find The First Player to win K Games in a Row Coverage #2040: Commit 338a690 pushed by EFanZh
2m 34s master
master
2m 34s
Add problem 3174: Clear Digits Coverage #2039: Commit 1388203 pushed by EFanZh
2m 11s master
master
2m 11s
Add problem 3170: Lexicographically Minimum String After Removing Stars Coverage #2038: Commit 60924ec pushed by EFanZh
2m 44s master
master
2m 44s
Add problem 3169: Count Days Without Meetings Coverage #2037: Commit c0ab54f pushed by EFanZh
2m 9s master
master
2m 9s
Add problem 3168: Minimum Number of Chairs in a Waiting Room Coverage #2036: Commit 49c13d7 pushed by EFanZh
2m 41s master
master
2m 41s
Add problem 3163: String Compression III Coverage #2035: Commit b6b5cb7 pushed by EFanZh
2m 45s master
master
2m 45s
Add problem 3162: Find the Number of Good Pairs I Coverage #2034: Commit dbbfd54 pushed by EFanZh
2m 23s master
master
2m 23s
Remove unneeded #[expect(clippy::needless_range_loop)] Coverage #2033: Commit e59aa8f pushed by EFanZh
3m 14s master
master
3m 14s
Add problem 3164. Find the Number of Good Pairs II Coverage #2032: Commit b25133f pushed by EFanZh
2m 21s master
master
2m 21s
Add problem 3160: Find the Number of Distinct Colors Among the Balls Coverage #2031: Commit 795809b pushed by EFanZh
2m 46s master
master
2m 46s