Ran
|
Files
3104
|
Run time
57s
|
Badge
Embed ▾
README BADGES
|
push
github
316 of 316 branches covered (100.0%)
Branch coverage included in aggregate %.
90821 of 90821 relevant lines covered (100.0%)
12144.73 hits per line
Coverage | ∆ | File | Lines | Relevant | Covered | Missed | Hits/Line | Branch Hits | Branch Misses |
---|---|---|---|---|---|---|---|---|---|
100.0 | ...ata-structures/tree-node-with-next-right-pointer.h | 17 | 2 | 2 | 0 | 41.0 | |||
100.0 | ...ating-next-right-pointers-in-each-node/iterative.h | 41 | 16 | 16 | 0 | 2.0 | |||
100.0 | ...ating-next-right-pointers-in-each-node/recursive.h | 43 | 19 | 19 | 0 | 3.0 | |||
100.0 | ...ng-next-right-pointers-in-each-node-ii/iterative.h | 80 | 44 | 44 | 0 | 7.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 | 203 | 139 | 139 | 0 | 1359.0 | |||
100.0 | ...t-code/problem-0321-create-maximum-number/greedy.h | 120 | 77 | 77 | 0 | 18236.0 | |||
100.0 | ...oblem-0373-find-k-pairs-with-smallest-sums/bfs-2.h | 61 | 26 | 26 | 0 | 20.0 | |||
100.0 | ...problem-0373-find-k-pairs-with-smallest-sums/bfs.h | 63 | 28 | 28 | 0 | 26.0 | |||
100.0 | c++/include/leet-code/data-structures/list-node.h | 15 | 2 | 2 | 0 | 17.0 |