1
100%
master: 100%

Ran 11 Nov 2024 03:49PM CUT

Files 4013

Run time 1min

Badge

Committed 11 Nov 2024 03:47PM CUT coverage: 100.0%. Remained the same

Build Type

push

github

Committed by

Commit Message

Add problem 2304: Minimum Path Cost in a Grid

Run Details

316 of 316 branches covered (100.0%)

Branch coverage included in aggregate %.

112786 of 112786 relevant lines covered (100.0%)

10165.87 hits per line

Coverage	File	Lines	Relevant	Covered	Hits/Line
100.0	...ata-structures/tree-node-with-next-right-pointer.h	12	2	2	41.0
100.0	...ating-next-right-pointers-in-each-node/iterative.h	33	16	16	2.0
100.0	...ating-next-right-pointers-in-each-node/recursive.h	35	19	19	3.0
100.0	...ng-next-right-pointers-in-each-node-ii/iterative.h	71	44	44	7.0
100.0	...em-0237-delete-node-in-a-linked-list/modify-this.h	15	3	3	5.0
100.0	...m-0321-create-maximum-number/dynamic-programming.h	195	139	139	1359.0
100.0	...t-code/problem-0321-create-maximum-number/greedy.h	112	77	77	18236.0
100.0	...oblem-0373-find-k-pairs-with-smallest-sums/bfs-2.h	53	26	26	20.0
100.0	...problem-0373-find-k-pairs-with-smallest-sums/bfs.h	55	28	28	26.0
100.0	c++/include/leet-code/data-structures/list-node.h	10	2	2	17.0