Skip to content

Commit 097b51f

Browse files
authored
Updated tags
1 parent 24b5667 commit 097b51f

File tree

5 files changed

+5
-5
lines changed

5 files changed

+5
-5
lines changed

src/main/kotlin/g2601_2700/s2608_shortest_cycle_in_a_graph/Solution.kt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g2601_2700.s2608_shortest_cycle_in_a_graph
22

3-
// #Hard #Graph #Breadth_First_Search #2023_07_14_Time_1061_ms_(100.00%)_Space_54.9_MB_(100.00%)
3+
// #Hard #Breadth_First_Search #Graph #2023_07_14_Time_1061_ms_(100.00%)_Space_54.9_MB_(100.00%)
44

55
import java.util.LinkedList
66
import java.util.Queue

src/main/kotlin/g2601_2700/s2612_minimum_reverse_operations/Solution.kt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g2601_2700.s2612_minimum_reverse_operations
22

3-
// #Hard #Array #Ordered_Set #Breadth_First_Search
3+
// #Hard #Array #Breadth_First_Search #Ordered_Set
44
// #2023_07_14_Time_923_ms_(100.00%)_Space_66.3_MB_(66.67%)
55

66
class Solution {

src/main/kotlin/g2601_2700/s2641_cousins_in_binary_tree_ii/Solution.kt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g2601_2700.s2641_cousins_in_binary_tree_ii
22

3-
// #Medium #Hash_Table #Tree #Binary_Tree #Depth_First_Search #Breadth_First_Search
3+
// #Medium #Hash_Table #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
44
// #2023_07_18_Time_922_ms_(90.91%)_Space_67.3_MB_(36.36%)
55

66
import com_github_leetcode.TreeNode

src/main/kotlin/g2601_2700/s2646_minimize_the_total_price_of_the_trips/Solution.kt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g2601_2700.s2646_minimize_the_total_price_of_the_trips
22

3-
// #Hard #Array #Dynamic_Programming #Tree #Graph #Depth_First_Search
3+
// #Hard #Array #Dynamic_Programming #Depth_First_Search #Tree #Graph
44
// #2023_07_19_Time_264_ms_(100.00%)_Space_39.6_MB_(100.00%)
55

66
class Solution {

src/main/kotlin/g2601_2700/s2658_maximum_number_of_fish_in_a_grid/Solution.kt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g2601_2700.s2658_maximum_number_of_fish_in_a_grid
22

3-
// #Medium #Array #Matrix #Union_Find #Depth_First_Search #Breadth_First_Search
3+
// #Medium #Array #Depth_First_Search #Breadth_First_Search #Matrix #Union_Find
44
// #2023_07_21_Time_269_ms_(80.00%)_Space_45.4_MB_(80.00%)
55

66
class Solution {

0 commit comments

Comments
 (0)