Skip to content

Updated the tags for slow tasks #646

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
May 9, 2024
Merged

Updated the tags for slow tasks #646

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/main/kotlin/g0601_0700/s0695_max_area_of_island/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@ package g0601_0700.s0695_max_area_of_island
// #Medium #Array #Depth_First_Search #Breadth_First_Search #Matrix #Union_Find
// #Algorithm_I_Day_7_Breadth_First_Search_Depth_First_Search
// #Graph_Theory_I_Day_2_Matrix_Related_Problems
// #2023_02_22_Time_324_ms_(24.06%)_Space_47.2_MB_(21.92%)
// #2024_05_09_Time_181_ms_(93.83%)_Space_38.9_MB_(77.78%)

@Suppress("NAME_SHADOWING")
class Solution {
Expand Down
2 changes: 1 addition & 1 deletion src/main/kotlin/g1001_1100/s1053_previous_permutation_with_one_swap/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g1001_1100.s1053_previous_permutation_with_one_swap

// #Medium #Array #Greedy #2023_05_30_Time_338_ms_(25.00%)_Space_71.2_MB_(25.00%)
// #Medium #Array #Greedy #2024_05_09_Time_288_ms_(100.00%)_Space_38.9_MB_(100.00%)

class Solution {
fun prevPermOpt1(arr: IntArray): IntArray {
Expand Down
2 changes: 1 addition & 1 deletion ...ain/kotlin/g1201_1300/s1290_convert_binary_number_in_a_linked_list_to_integer/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g1201_1300.s1290_convert_binary_number_in_a_linked_list_to_integer

// #Easy #Math #Linked_List #Programming_Skills_I_Day_10_Linked_List_and_Tree
// #2023_06_08_Time_145_ms_(25.93%)_Space_33.4_MB_(92.59%)
// #2024_05_09_Time_138_ms_(65.79%)_Space_33.7_MB_(55.26%)

import com_github_leetcode.ListNode

Expand Down
2 changes: 1 addition & 1 deletion ...n/kotlin/g1301_1400/s1347_minimum_number_of_steps_to_make_two_strings_anagram/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g1301_1400.s1347_minimum_number_of_steps_to_make_two_strings_anagram

// #Medium #String #Hash_Table #Counting #2023_06_06_Time_271_ms_(23.08%)_Space_38.7_MB_(92.31%)
// #Medium #String #Hash_Table #Counting #2024_05_09_Time_250_ms_(67.35%)_Space_39.1_MB_(40.82%)

class Solution {
fun minSteps(s: String, t: String): Int {
Expand Down
2 changes: 1 addition & 1 deletion ...tlin/g1401_1500/s1491_average_salary_excluding_the_minimum_and_maximum_salary/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g1401_1500.s1491_average_salary_excluding_the_minimum_and_maximum_salary

// #Easy #Array #Sorting #Programming_Skills_I_Day_1_Basic_Data_Type
// #2023_06_13_Time_165_ms_(27.87%)_Space_33.9_MB_(98.81%)
// #2024_05_09_Time_137_ms_(91.67%)_Space_34.3_MB_(58.33%)

class Solution {
fun average(salary: IntArray): Double {
Expand Down
3 changes: 1 addition & 2 deletions src/main/kotlin/g1901_2000/s1965_employees_with_missing_information/script.sql
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,5 @@
# Write your MySQL query statement below
# #Easy #Database #SQL_I_Day_4_Union_and_Select
# #2023_06_21_Time_1355_ms_(23.96%)_Space_0B_(100.00%)
# #Easy #Database #SQL_I_Day_4_Union_and_Select #2024_05_09_Time_949_ms_(88.66%)_Space_0B_(100.00%)
select employee_id
from employees
where employee_id not in (select employee_id from salaries)
Expand Down
2 changes: 1 addition & 1 deletion src/main/kotlin/g2101_2200/s2181_merge_nodes_in_between_zeros/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g2101_2200.s2181_merge_nodes_in_between_zeros

// #Medium #Simulation #Linked_List #2023_06_26_Time_980_ms_(25.00%)_Space_69.1_MB_(100.00%)
// #Medium #Simulation #Linked_List #2024_05_09_Time_794_ms_(100.00%)_Space_69.1_MB_(64.29%)

import com_github_leetcode.ListNode

Expand Down
2 changes: 1 addition & 1 deletion src/main/kotlin/g2401_2500/s2437_number_of_valid_clock_times/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g2401_2500.s2437_number_of_valid_clock_times

// #Easy #String #Enumeration #2023_07_05_Time_134_ms_(28.57%)_Space_33.5_MB_(71.43%)
// #Easy #String #Enumeration #2024_05_09_Time_133_ms_(64.29%)_Space_33.4_MB_(85.71%)

class Solution {
fun countTime(time: String): Int {
Expand Down
2 changes: 1 addition & 1 deletion .../kotlin/g2901_3000/s2920_maximum_points_after_collecting_coins_from_all_nodes/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g2901_3000.s2920_maximum_points_after_collecting_coins_from_all_nodes

// #Hard #Array #Dynamic_Programming #Depth_First_Search #Tree #Bit_Manipulation
// #2023_12_31_Time_2255_ms_(25.00%)_Space_112.1_MB_(100.00%)
// #2024_05_09_Time_1007_ms_(100.00%)_Space_149.4_MB_(100.00%)

import kotlin.math.max

Expand Down