Updated tags

jscrdev · Jul 12, 2023 · 30857d4 · 30857d4
1 parent 7b1ba48
commit 30857d4
Show file tree

Hide file tree

Showing 9 changed files with 11 additions and 10 deletions.
diff --git a/src.save/main/kotlin/g1401_1500/s1407_top_travellers/script.sql b/src.save/main/kotlin/g1401_1500/s1407_top_travellers/script.sql
@@ -5,4 +5,4 @@ select u.name,IFNULL(sum(r.distance), 0) as travelled_distance
 from Users u left join Rides r
 on u.id = r.user_id
 group by u.id
-order by travelled_distance desc,name asc
+order by travelled_distance desc,name asc
diff --git a/src.save/main/kotlin/g1401_1500/s1462_course_schedule_iv/Solution.kt b/src.save/main/kotlin/g1401_1500/s1462_course_schedule_iv/Solution.kt
@@ -1,9 +1,11 @@
 package g1401_1500.s1462_course_schedule_iv
 
+// #Medium #Depth_First_Search #Breadth_First_Search #Graph #Topological_Sort
+// #2023_07_12_Time_512_ms_(100.00%)_Space_56.4_MB_(92.31%)
+
 import java.util.LinkedList
 import java.util.Queue
 
-// #Medium #Depth_First_Search #Breadth_First_Search #Graph #Topological_Sort
 class Solution {
     fun checkIfPrerequisite(
         numCourses: Int,

diff --git a/src.save/main/kotlin/g1801_1900/s1847_closest_room/Solution.kt b/src.save/main/kotlin/g1801_1900/s1847_closest_room/Solution.kt
@@ -1,10 +1,10 @@
 package g1801_1900.s1847_closest_room
 
+// #Hard #Array #Sorting #Binary_Search #2023_06_22_Time_1179_ms_(100.00%)_Space_92.1_MB_(100.00%)
+
 import java.util.Arrays
 import java.util.TreeSet
 
-// #Hard #Array #Sorting #Binary_Search #2023_06_22_Time_1179_ms_(100.00%)_Space_92.1_MB_(100.00%)
-
 class Solution {
     fun closestRoom(rooms: Array<IntArray>, queries: Array<IntArray>): IntArray {
         val numRoom = rooms.size

diff --git a/src.save/main/kotlin/g1901_2000/s1978_employees_whose_manager_left_the_company/script.sql b/src.save/main/kotlin/g1901_2000/s1978_employees_whose_manager_left_the_company/script.sql
@@ -2,4 +2,3 @@
 # #Easy #Database #2023_06_23_Time_686_ms_(64.74%)_Space_0B_(100.00%)
 select employee_id from employees where manager_id not in (select distinct (employee_id) from employees)
 AND salary < 30000 order by employee_id
-
diff --git a/...otlin/g2501_2600/s2556_disconnect_path_in_a_binary_matrix_by_at_most_one_flip/Solution.kt b/...otlin/g2501_2600/s2556_disconnect_path_in_a_binary_matrix_by_at_most_one_flip/Solution.kt
@@ -1,6 +1,6 @@
 package g2501_2600.s2556_disconnect_path_in_a_binary_matrix_by_at_most_one_flip
 
-// #Medium #Array #Dynamic_Programming #Matrix #Depth_First_Search #Breadth_First_Search
+// #Medium #Array #Dynamic_Programming #Depth_First_Search #Breadth_First_Search #Matrix
 // #2023_07_06_Time_571_ms_(100.00%)_Space_68_MB_(100.00%)
 
 class Solution {

diff --git a/src/main/kotlin/g2501_2600/s2577_minimum_time_to_visit_a_cell_in_a_grid/Solution.kt b/src/main/kotlin/g2501_2600/s2577_minimum_time_to_visit_a_cell_in_a_grid/Solution.kt
@@ -1,6 +1,6 @@
 package g2501_2600.s2577_minimum_time_to_visit_a_cell_in_a_grid
 
-// #Hard #Array #Matrix #Heap_Priority_Queue #Graph #Shortest_Path #Breadth_First_Search
+// #Hard #Array #Breadth_First_Search #Matrix #Heap_Priority_Queue #Graph #Shortest_Path
 // #2023_07_10_Time_1446_ms_(100.00%)_Space_62.8_MB_(100.00%)
 
 import java.util.PriorityQueue

diff --git a/src/main/kotlin/g2501_2600/s2581_count_number_of_possible_root_nodes/Solution.kt b/src/main/kotlin/g2501_2600/s2581_count_number_of_possible_root_nodes/Solution.kt
@@ -1,6 +1,6 @@
 package g2501_2600.s2581_count_number_of_possible_root_nodes
 
-// #Hard #Hash_Table #Dynamic_Programming #Tree #Depth_First_Search
+// #Hard #Hash_Table #Dynamic_Programming #Depth_First_Search #Tree
 // #2023_07_11_Time_1352_ms_(100.00%)_Space_138.7_MB_(100.00%)
 
 import java.util.ArrayList

diff --git a/src/main/kotlin/g2501_2600/s2583_kth_largest_sum_in_a_binary_tree/Solution.kt b/src/main/kotlin/g2501_2600/s2583_kth_largest_sum_in_a_binary_tree/Solution.kt
@@ -1,6 +1,6 @@
 package g2501_2600.s2583_kth_largest_sum_in_a_binary_tree
 
-// #Medium #Tree #Binary_Search #Breadth_First_Search
+// #Medium #Breadth_First_Search #Tree #Binary_Search
 // #2023_07_11_Time_557_ms_(83.33%)_Space_62.6_MB_(66.67%)
 
 import com_github_leetcode.TreeNode

diff --git a/src/main/kotlin/g2501_2600/s2596_check_knight_tour_configuration/Solution.kt b/src/main/kotlin/g2501_2600/s2596_check_knight_tour_configuration/Solution.kt
@@ -1,6 +1,6 @@
 package g2501_2600.s2596_check_knight_tour_configuration
 
-// #Medium #Array #Matrix #Simulation #Depth_First_Search #Breadth_First_Search
+// #Medium #Array #Depth_First_Search #Breadth_First_Search #Matrix #Simulation
 // #2023_07_12_Time_179_ms_(100.00%)_Space_39.1_MB_(100.00%)
 
 class Solution {