Commit7e7714a

authored

Improved tags

1 parenta84d61a commit7e7714aCopy full SHA for 7e7714a

File tree

-5

lines changed

-5

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,6 @@`
`1`	`1`	`packageg2801_2900.s2812_find_the_safest_path_in_a_grid;`
`2`	`2`
`3`		`-// #Medium #Array #Binary_Search #Matrix #Union_Find #Breadth_First_Search`
	`3`	`+// #Medium #Array #Breadth_First_Search #Binary_Search #Matrix #Union_Find`
`4`	`4`	`// #2023_11_20_Time_57_ms_(100.00%)_Space_65.3_MB_(77.00%)`
`5`	`5`
`6`	`6`	`importjava.util.Arrays;`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,6 @@`
`1`	`1`	`packageg2801_2900.s2850_minimum_moves_to_spread_stones_over_grid;`
`2`	`2`
`3`		`-// #Medium #Array #Dynamic_Programming #Matrix #Breadth_First_Search`
	`3`	`+// #Medium #Array #Dynamic_Programming #Breadth_First_Search #Matrix`
`4`	`4`	`// #2023_12_15_Time_1_ms_(100.00%)_Space_40.5_MB_(89.16%)`
`5`	`5`
`6`	`6`	`publicclassSolution {`

Lines changed: 2 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,13 +1,14 @@`
`1`	`1`	`packageg2801_2900.s2858_minimum_edge_reversals_so_every_node_is_reachable;`
`2`	`2`
`3`		`-// #Hard #Dynamic_Programming #Graph #Depth_First_Search #Breadth_First_Search`
	`3`	`+// #Hard #Dynamic_Programming #Depth_First_Search #Breadth_First_Search #Graph`
`4`	`4`	`// #2023_12_19_Time_52_ms_(92.31%)_Space_119.5_MB_(75.38%)`
`5`	`5`
`6`	`6`	`importjava.util.ArrayList;`
`7`	`7`	`importjava.util.LinkedList;`
`8`	`8`	`importjava.util.List;`
`9`	`9`	`importjava.util.Queue;`
`10`	`10`
	`11`	`+@SuppressWarnings("unchecked")`
`11`	`12`	`publicclassSolution {`
`12`	`13`	`publicint[]minEdgeReversals(intn,int[][]edges) {`
`13`	`14`	`List<int[]>[]nexts =newList[n];`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,6 @@`
`1`	`1`	`packageg2801_2900.s2867_count_valid_paths_in_a_tree;`
`2`	`2`
`3`		`-// #Hard #Dynamic_Programming #Math #Tree #Number_Theory #Depth_First_Search`
	`3`	`+// #Hard #Dynamic_Programming #Math #Depth_First_Search #Tree #Number_Theory`
`4`	`4`	`// #2023_12_20_Time_26_ms_(97.33%)_Space_84.2_MB_(80.00%)`
`5`	`5`
`6`	`6`	`importjava.util.ArrayList;`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,6 @@`
`1`	`1`	`packageg2801_2900.s2872_maximum_number_of_k_divisible_components;`
`2`	`2`
`3`		`-// #Hard #Dynamic_Programming #Tree #Depth_First_Search`
	`3`	`+// #Hard #Dynamic_Programming #Depth_First_Search #Tree`
`4`	`4`	`// #2023_12_21_Time_24_ms_(93.51%)_Space_65.3_MB_(19.48%)`
`5`	`5`
`6`	`6`	`importjava.util.ArrayList;`

Comments

(0)