Ran
|
Jobs
1
|
Files
1393
|
Run time
3min
|
Badge
README BADGES
|
push
github
38940 of 38943 relevant lines covered (99.99%)
23498.89 hits per line
ID | Job ID | Ran | Files | Coverage | |
---|---|---|---|---|---|
1 | 1058120921.1 | 0 |
99.99 |
GitHub Action Run |
Coverage | ∆ | File | Lines | Relevant | Covered | Missed | Hits/Line |
---|---|---|---|---|---|---|---|
95.95 | .../problem_0692_top_k_frequent_words/quick_select.rs | 109 | 74 | 71 - 3 | 3 + 3 | 11.0 + 1.0 | |
100.0 | ...ating-next-right-pointers-in-each-node/iterative.h | 41 | 21 | 21 | 0 | 1.0 | |
100.0 | ...t-code/problem-0321-create-maximum-number/greedy.h | 120 | 94 | 94 | 0 | 19320.0 | |
100.0 | ...ng-next-right-pointers-in-each-node-ii/iterative.h | 78 | 58 | 58 | 0 | 5.0 | |
100.0 | ...em-0237-delete-node-in-a-linked-list/modify-this.h | 23 | 3 | 3 | 0 | 5.0 | |
100.0 | ...m-0321-create-maximum-number/dynamic-programming.h | 201 | 175 | 175 | 0 | 1216.0 | |
100.0 | ...ating-next-right-pointers-in-each-node/recursive.h | 43 | 21 | 21 | 0 | 2.0 | |
100.0 | ...oblem-0373-find-k-pairs-with-smallest-sums/bfs-2.h | 61 | 35 | 35 | 0 | 20.0 | |
100.0 | ...problem-0373-find-k-pairs-with-smallest-sums/bfs.h | 63 | 37 | 37 | 0 | 24.0 | |
100.0 | ...ata-structures/tree-node-with-next-right-pointer.h | 17 | 2 | 2 | 0 | 34.0 |