File tree 9 files changed +9
-10
lines changed
g0601_0700/s0695_max_area_of_island
g1001_1100/s1053_previous_permutation_with_one_swap
g1201_1300/s1290_convert_binary_number_in_a_linked_list_to_integer
g1301_1400/s1347_minimum_number_of_steps_to_make_two_strings_anagram
g1401_1500/s1491_average_salary_excluding_the_minimum_and_maximum_salary
g1901_2000/s1965_employees_with_missing_information
g2101_2200/s2181_merge_nodes_in_between_zeros
g2401_2500/s2437_number_of_valid_clock_times
g2901_3000/s2920_maximum_points_after_collecting_coins_from_all_nodes
9 files changed +9
-10
lines changed Original file line number Diff line number Diff line change @@ -3,7 +3,7 @@ package g0601_0700.s0695_max_area_of_island
3
3
// #Medium #Array #Depth_First_Search #Breadth_First_Search #Matrix #Union_Find
4
4
// #Algorithm_I_Day_7_Breadth_First_Search_Depth_First_Search
5
5
// #Graph_Theory_I_Day_2_Matrix_Related_Problems
6
- // #2023_02_22_Time_324_ms_(24.06%)_Space_47.2_MB_(21.92 %)
6
+ // #2024_05_09_Time_181_ms_(93.83%)_Space_38.9_MB_(77.78 %)
7
7
8
8
@Suppress(" NAME_SHADOWING" )
9
9
class Solution {
Original file line number Diff line number Diff line change 1
1
package g1001_1100.s1053_previous_permutation_with_one_swap
2
2
3
- // #Medium #Array #Greedy #2023_05_30_Time_338_ms_(25 .00%)_Space_71.2_MB_(25 .00%)
3
+ // #Medium #Array #Greedy #2024_05_09_Time_288_ms_(100 .00%)_Space_38.9_MB_(100 .00%)
4
4
5
5
class Solution {
6
6
fun prevPermOpt1 (arr : IntArray ): IntArray {
Original file line number Diff line number Diff line change 1
1
package g1201_1300.s1290_convert_binary_number_in_a_linked_list_to_integer
2
2
3
3
// #Easy #Math #Linked_List #Programming_Skills_I_Day_10_Linked_List_and_Tree
4
- // #2023_06_08_Time_145_ms_(25.93 %)_Space_33.4_MB_(92.59 %)
4
+ // #2024_05_09_Time_138_ms_(65.79 %)_Space_33.7_MB_(55.26 %)
5
5
6
6
import com_github_leetcode.ListNode
7
7
Original file line number Diff line number Diff line change 1
1
package g1301_1400.s1347_minimum_number_of_steps_to_make_two_strings_anagram
2
2
3
- // #Medium #String #Hash_Table #Counting #2023_06_06_Time_271_ms_(23.08%)_Space_38.7_MB_(92.31 %)
3
+ // #Medium #String #Hash_Table #Counting #2024_05_09_Time_250_ms_(67.35%)_Space_39.1_MB_(40.82 %)
4
4
5
5
class Solution {
6
6
fun minSteps (s : String , t : String ): Int {
Original file line number Diff line number Diff line change 1
1
package g1401_1500.s1491_average_salary_excluding_the_minimum_and_maximum_salary
2
2
3
3
// #Easy #Array #Sorting #Programming_Skills_I_Day_1_Basic_Data_Type
4
- // #2023_06_13_Time_165_ms_(27.87%)_Space_33.9_MB_(98.81 %)
4
+ // #2024_05_09_Time_137_ms_(91.67%)_Space_34.3_MB_(58.33 %)
5
5
6
6
class Solution {
7
7
fun average (salary : IntArray ): Double {
Original file line number Diff line number Diff line change 1
1
# Write your MySQL query statement below
2
- # #Easy #Database #SQL_I_Day_4_Union_and_Select
3
- # #2023_06_21_Time_1355_ms_(23.96%)_Space_0B_(100.00%)
2
+ # #Easy #Database #SQL_I_Day_4_Union_and_Select #2024_05_09_Time_949_ms_(88.66%)_Space_0B_(100.00%)
4
3
select employee_id
5
4
from employees
6
5
where employee_id not in (select employee_id from salaries)
Original file line number Diff line number Diff line change 1
1
package g2101_2200.s2181_merge_nodes_in_between_zeros
2
2
3
- // #Medium #Simulation #Linked_List #2023_06_26_Time_980_ms_(25 .00%)_Space_69.1_MB_(100.00 %)
3
+ // #Medium #Simulation #Linked_List #2024_05_09_Time_794_ms_(100 .00%)_Space_69.1_MB_(64.29 %)
4
4
5
5
import com_github_leetcode.ListNode
6
6
Original file line number Diff line number Diff line change 1
1
package g2401_2500.s2437_number_of_valid_clock_times
2
2
3
- // #Easy #String #Enumeration #2023_07_05_Time_134_ms_(28.57 %)_Space_33.5_MB_(71.43 %)
3
+ // #Easy #String #Enumeration #2024_05_09_Time_133_ms_(64.29 %)_Space_33.4_MB_(85.71 %)
4
4
5
5
class Solution {
6
6
fun countTime (time : String ): Int {
Original file line number Diff line number Diff line change 1
1
package g2901_3000.s2920_maximum_points_after_collecting_coins_from_all_nodes
2
2
3
3
// #Hard #Array #Dynamic_Programming #Depth_First_Search #Tree #Bit_Manipulation
4
- // #2023_12_31_Time_2255_ms_(25 .00%)_Space_112.1_MB_ (100.00%)
4
+ // #2024_05_09_Time_1007_ms_(100 .00%)_Space_149.4_MB_ (100.00%)
5
5
6
6
import kotlin.math.max
7
7
You can’t perform that action at this time.
0 commit comments