Skip to content

Commit 68015a6

Browse files
javadevjavadev
authored
Updated exec time 535-551.
1 parent b6d170a commit 68015a6

File tree

12 files changed

+28
-28
lines changed

12 files changed

+28
-28
lines changed

‎README.md‎

Lines changed: 17 additions & 17 deletions
Original file line numberDiff line numberDiff line change
@@ -112,7 +112,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
112112

113113
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
114114
|-|-|-|-|-|-
115-
| 0542 |[01 Matrix](src/main/java/g0501_0600/s0542_01_matrix/Solution.java)| Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix | 6 | 96.78
115+
| 0542 |[01 Matrix](src/main/java/g0501_0600/s0542_01_matrix/Solution.java)| Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix | 7 | 95.83
116116
| 0994 |[Rotting Oranges](src/main/java/g0901_1000/s0994_rotting_oranges/Solution.java)| Medium | Array, Breadth_First_Search, Matrix | 3 | 74.27
117117

118118
#### Day 10 Recursion Backtracking
@@ -197,7 +197,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
197197
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
198198
|-|-|-|-|-|-
199199
| 0200 |[Number of Islands](src/main/java/g0101_0200/s0200_number_of_islands/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 3 | 97.76
200-
| 0547 |[Number of Provinces](src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 1 | 94.56
200+
| 0547 |[Number of Provinces](src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 2 | 69.51
201201

202202
#### Day 7 Breadth First Search Depth First Search
203203

@@ -960,7 +960,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
960960
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
961961
|-|-|-|-|-|-
962962
| 1091 |[Shortest Path in Binary Matrix](src/main/java/g1001_1100/s1091_shortest_path_in_binary_matrix/Solution.java)| Medium | Array, Breadth_First_Search, Matrix | 22 | 69.99
963-
| 0542 |[01 Matrix](src/main/java/g0501_0600/s0542_01_matrix/Solution.java)| Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix | 6 | 96.78
963+
| 0542 |[01 Matrix](src/main/java/g0501_0600/s0542_01_matrix/Solution.java)| Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix | 7 | 95.83
964964

965965
#### Day 6 Matrix Related Problems
966966

@@ -980,7 +980,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
980980

981981
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
982982
|-|-|-|-|-|-
983-
| 0547 |[Number of Provinces](src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 1 | 94.56
983+
| 0547 |[Number of Provinces](src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 2 | 69.51
984984
| 1319 |[Number of Operations to Make Network Connected](src/main/java/g1301_1400/s1319_number_of_operations_to_make_network_connected/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 9 | 67.64
985985

986986
#### Day 9 Standard Traversal
@@ -1270,7 +1270,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
12701270

12711271
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
12721272
|-|-|-|-|-|-
1273-
| 0543 |[Diameter of Binary Tree](src/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree | 1 | 55.16
1273+
| 0543 |[Diameter of Binary Tree](src/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree | 1 | 65.86
12741274
| 0437 |[Path Sum III](src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree | 18 | 45.66
12751275

12761276
#### Day 8 Binary Search
@@ -1358,7 +1358,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
13581358

13591359
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
13601360
|-|-|-|-|-|-
1361-
| 0547 |[Number of Provinces](src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 1 | 94.56
1361+
| 0547 |[Number of Provinces](src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 2 | 69.51
13621362
| 0947 |[Most Stones Removed with Same Row or Column](src/main/java/g0901_1000/s0947_most_stones_removed_with_same_row_or_column/Solution.java)| Medium | Depth_First_Search, Graph, Union_Find | 5 | 98.95
13631363

13641364
#### Day 20 Brute Force/Backtracking
@@ -1502,7 +1502,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
15021502
| 0103 |[Binary Tree Zigzag Level Order Traversal](src/main/java/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.java)| Medium | Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree | 1 | 95.00
15031503
| 0108 |[Convert Sorted Array to Binary Search Tree](src/main/java/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.java)| Easy | Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer | 0 | 100.00
15041504
| 1008 |[Construct Binary Search Tree from Preorder Traversal](src/main/java/g1001_1100/s1008_construct_binary_search_tree_from_preorder_traversal/Solution.java)| Medium | Array, Tree, Binary_Tree, Stack, Monotonic_Stack, Binary_Search_Tree | 0 | 100.00
1505-
| 0543 |[Diameter of Binary Tree](src/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree | 1 | 55.16
1505+
| 0543 |[Diameter of Binary Tree](src/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree | 1 | 65.86
15061506
| 0938 |[Range Sum of BST](src/main/java/g0901_1000/s0938_range_sum_of_bst/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 0 | 100.00
15071507
| 0100 |[Same Tree](src/main/java/g0001_0100/s0100_same_tree/Solution.java)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00
15081508
| 0226 |[Invert Binary Tree](src/main/java/g0201_0300/s0226_invert_binary_tree/Solution.java)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00
@@ -3255,17 +3255,17 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
32553255
| 0554 |[Brick Wall](src/main/java/g0501_0600/s0554_brick_wall/Solution.java)| Medium | Array, Hash_Table | 13 | 75.64
32563256
| 0553 |[Optimal Division](src/main/java/g0501_0600/s0553_optimal_division/Solution.java)| Medium | Array, Dynamic_Programming, Math | 1 | 96.63
32573257
| 0552 |[Student Attendance Record II](src/main/java/g0501_0600/s0552_student_attendance_record_ii/Solution.java)| Hard | Dynamic_Programming | 8 | 99.21
3258-
| 0551 |[Student Attendance Record I](src/main/java/g0501_0600/s0551_student_attendance_record_i/Solution.java)| Easy | String | 1 | 68.22
3259-
| 0547 |[Number of Provinces](src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find, Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_8_Standard_Traversal, Level_2_Day_19_Union_Find | 1 | 94.56
3260-
| 0546 |[Remove Boxes](src/main/java/g0501_0600/s0546_remove_boxes/Solution.java)| Hard | Array, Dynamic_Programming, Memoization | 86 | 60.93
3261-
| 0543 |[Diameter of Binary Tree](src/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Level_2_Day_7_Tree, Udemy_Tree_Stack_Queue | 1 | 55.16
3262-
| 0542 |[01 Matrix](src/main/java/g0501_0600/s0542_01_matrix/Solution.java)| Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix, Algorithm_I_Day_9_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_5_Matrix_Related_Problems | 6 | 96.78
3263-
| 0541 |[Reverse String II](src/main/java/g0501_0600/s0541_reverse_string_ii/Solution.java)| Easy | String, Two_Pointers | 1 | 93.18
3258+
| 0551 |[Student Attendance Record I](src/main/java/g0501_0600/s0551_student_attendance_record_i/Solution.java)| Easy | String | 0 | 100.00
3259+
| 0547 |[Number of Provinces](src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find, Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_8_Standard_Traversal, Level_2_Day_19_Union_Find | 2 | 69.51
3260+
| 0546 |[Remove Boxes](src/main/java/g0501_0600/s0546_remove_boxes/Solution.java)| Hard | Array, Dynamic_Programming, Memoization | 45 | 95.58
3261+
| 0543 |[Diameter of Binary Tree](src/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Level_2_Day_7_Tree, Udemy_Tree_Stack_Queue | 1 | 65.86
3262+
| 0542 |[01 Matrix](src/main/java/g0501_0600/s0542_01_matrix/Solution.java)| Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix, Algorithm_I_Day_9_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_5_Matrix_Related_Problems | 7 | 95.83
3263+
| 0541 |[Reverse String II](src/main/java/g0501_0600/s0541_reverse_string_ii/Solution.java)| Easy | String, Two_Pointers | 1 | 100.00
32643264
| 0540 |[Single Element in a Sorted Array](src/main/java/g0501_0600/s0540_single_element_in_a_sorted_array/Solution.java)| Medium | Array, Binary_Search, Binary_Search_II_Day_9 | 0 | 100.00
3265-
| 0539 |[Minimum Time Difference](src/main/java/g0501_0600/s0539_minimum_time_difference/Solution.java)| Medium | Array, String, Math, Sorting | 3 | 93.52
3266-
| 0538 |[Convert BST to Greater Tree](src/main/java/g0501_0600/s0538_convert_bst_to_greater_tree/Solution.java)| Medium | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 1 | 83.78
3267-
| 0537 |[Complex Number Multiplication](src/main/java/g0501_0600/s0537_complex_number_multiplication/Solution.java)| Medium | String, Math, Simulation | 7 | 62.22
3268-
| 0535 |[Encode and Decode TinyURL](src/main/java/g0501_0600/s0535_encode_and_decode_tinyurl/Codec.java)| Medium | String, Hash_Table, Design, Hash_Function | 4 | 65.42
3265+
| 0539 |[Minimum Time Difference](src/main/java/g0501_0600/s0539_minimum_time_difference/Solution.java)| Medium | Array, String, Math, Sorting | 2 | 99.62
3266+
| 0538 |[Convert BST to Greater Tree](src/main/java/g0501_0600/s0538_convert_bst_to_greater_tree/Solution.java)| Medium | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 1 | 88.41
3267+
| 0537 |[Complex Number Multiplication](src/main/java/g0501_0600/s0537_complex_number_multiplication/Solution.java)| Medium | String, Math, Simulation | 6 | 71.88
3268+
| 0535 |[Encode and Decode TinyURL](src/main/java/g0501_0600/s0535_encode_and_decode_tinyurl/Codec.java)| Medium | String, Hash_Table, Design, Hash_Function | 2 | 89.67
32693269
| 0532 |[K-diff Pairs in an Array](src/main/java/g0501_0600/s0532_k_diff_pairs_in_an_array/Solution.java)| Medium | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers, Udemy_Arrays | 13 | 58.23
32703270
| 0530 |[Minimum Absolute Difference in BST](src/main/java/g0501_0600/s0530_minimum_absolute_difference_in_bst/Solution.java)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 1 | 92.05
32713271
| 0529 |[Minesweeper](src/main/java/g0501_0600/s0529_minesweeper/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix | 0 | 100.00

‎src/main/java/g0501_0600/s0535_encode_and_decode_tinyurl/Codec.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0501_0600.s0535_encode_and_decode_tinyurl;
22

33
// #Medium #String #Hash_Table #Design #Hash_Function
4-
// #2022_05_01_Time_4_ms_(65.42%)_Space_43.4_MB_(58.94%)
4+
// #2022_08_02_Time_2_ms_(89.67%)_Space_42.1_MB_(96.88%)
55

66
import java.util.HashMap;
77
import java.util.Map;

‎src/main/java/g0501_0600/s0537_complex_number_multiplication/Solution.java‎

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

3-
// #Medium #String #Math #Simulation #2022_03_20_Time_7_ms_(62.22%)_Space_42.5_MB_(27.62%)
3+
// #Medium #String #Math #Simulation #2022_08_02_Time_6_ms_(71.88%)_Space_42.3_MB_(44.10%)
44

55
public class Solution {
66
public String complexNumberMultiply(String num1, String num2) {

‎src/main/java/g0501_0600/s0538_convert_bst_to_greater_tree/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0501_0600.s0538_convert_bst_to_greater_tree;
22

33
// #Medium #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree
4-
// #2022_03_20_Time_1_ms_(83.78%)_Space_50.7_MB_(7.18%)
4+
// #2022_08_02_Time_1_ms_(88.41%)_Space_50_MB_(23.08%)
55

66
import com_github_leetcode.TreeNode;
77

‎src/main/java/g0501_0600/s0539_minimum_time_difference/Solution.java‎

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

3-
// #Medium #Array #String #Math #Sorting #2022_03_20_Time_3_ms_(93.52%)_Space_44.5_MB_(65.24%)
3+
// #Medium #Array #String #Math #Sorting #2022_08_02_Time_2_ms_(99.62%)_Space_44.5_MB_(75.58%)
44

55
import java.util.Arrays;
66
import java.util.List;

‎src/main/java/g0501_0600/s0540_single_element_in_a_sorted_array/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0501_0600.s0540_single_element_in_a_sorted_array;
22

33
// #Medium #Array #Binary_Search #Binary_Search_II_Day_9
4-
// #2022_03_20_Time_0_ms_(100.00%)_Space_61_MB_(16.72%)
4+
// #2022_08_02_Time_0_ms_(100.00%)_Space_60.5_MB_(44.30%)
55

66
public class Solution {
77
public int singleNonDuplicate(int[] nums) {

‎src/main/java/g0501_0600/s0541_reverse_string_ii/Solution.java‎

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

3-
// #Easy #String #Two_Pointers #2022_03_20_Time_1_ms_(93.18%)_Space_44.1_MB_(44.48%)
3+
// #Easy #String #Two_Pointers #2022_08_02_Time_1_ms_(100.00%)_Space_45_MB_(13.41%)
44

55
public class Solution {
66
public String reverseStr(String s, int k) {

‎src/main/java/g0501_0600/s0542_01_matrix/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@
33
// #Medium #Array #Dynamic_Programming #Breadth_First_Search #Matrix
44
// #Algorithm_I_Day_9_Breadth_First_Search_Depth_First_Search
55
// #Graph_Theory_I_Day_5_Matrix_Related_Problems
6-
// #2022_03_20_Time_6_ms_(96.78%)_Space_46_MB_(83.86%)
6+
// #2022_08_02_Time_7_ms_(95.83%)_Space_46.4_MB_(86.74%)
77

88
import java.util.Arrays;
99

‎src/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0501_0600.s0543_diameter_of_binary_tree;
22

33
// #Easy #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree
4-
// #Udemy_Tree_Stack_Queue #2022_03_20_Time_1_ms_(55.16%)_Space_43.3_MB_(41.25%)
4+
// #Udemy_Tree_Stack_Queue #2022_08_02_Time_1_ms_(65.86%)_Space_43.5_MB_(33.52%)
55

66
import com_github_leetcode.TreeNode;
77

‎src/main/java/g0501_0600/s0546_remove_boxes/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0501_0600.s0546_remove_boxes;
22

33
// #Hard #Array #Dynamic_Programming #Memoization
4-
// #2022_03_20_Time_86_ms_(60.93%)_Space_84.4_MB_(31.16%)
4+
// #2022_08_02_Time_45_ms_(95.58%)_Space_52.3_MB_(87.17%)
55

66
public class Solution {
77
private Integer[][][] dp;

0 commit comments

Comments
 (0)