Skip to content

Commit a023604

Browse files
javadevjavadev
authored
Updated exec time 405-416.
1 parent 0920124 commit a023604

File tree

11 files changed

+25
-28
lines changed

11 files changed

+25
-28
lines changed

‎README.md‎

Lines changed: 15 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -94,8 +94,8 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
9494

9595
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
9696
|-|-|-|-|-|-
97-
| 0415 |[Add Strings](src.save/main/java/g0401_0500/s0415_add_strings/Solution.java)| Easy | String, Math, Simulation | 3 | 75.64
98-
| 0409 |[Longest Palindrome](src.save/main/java/g0401_0500/s0409_longest_palindrome/Solution.java)| Easy | String, Hash_Table, Greedy | 1 | 100.00
97+
| 0415 |[Add Strings](src.save/main/java/g0401_0500/s0415_add_strings/Solution.java)| Easy | String, Math, Simulation | 3 | 82.41
98+
| 0409 |[Longest Palindrome](src.save/main/java/g0401_0500/s0409_longest_palindrome/Solution.java)| Easy | String, Hash_Table, Greedy | 2 | 92.90
9999

100100
#### Day 7 String
101101

@@ -1306,7 +1306,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
13061306
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
13071307
|-|-|-|-|-|-
13081308
| 0121 |[Best Time to Buy and Sell Stock](src.save/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 1 | 100.00
1309-
| 0409 |[Longest Palindrome](src.save/main/java/g0401_0500/s0409_longest_palindrome/Solution.java)| Easy | String, Hash_Table, Greedy | 1 | 100.00
1309+
| 0409 |[Longest Palindrome](src.save/main/java/g0401_0500/s0409_longest_palindrome/Solution.java)| Easy | String, Hash_Table, Greedy | 2 | 92.90
13101310

13111311
#### Day 6 Tree
13121312

@@ -1470,7 +1470,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
14701470

14711471
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
14721472
|-|-|-|-|-|-
1473-
| 0416 |[Partition Equal Subset Sum](src.save/main/java/g0401_0500/s0416_partition_equal_subset_sum/Solution.java)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming | 1 | 99.87
1473+
| 0416 |[Partition Equal Subset Sum](src.save/main/java/g0401_0500/s0416_partition_equal_subset_sum/Solution.java)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming | 2 | 99.96
14741474
| 0152 |[Maximum Product Subarray](src.save/main/java/g0101_0200/s0152_maximum_product_subarray/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 0 | 100.00
14751475

14761476
#### Day 14 Sliding Window/Two Pointer
@@ -1531,7 +1531,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
15311531

15321532
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
15331533
|-|-|-|-|-|-
1534-
| 0412 |[Fizz Buzz](src.save/main/java/g0401_0500/s0412_fizz_buzz/Solution.java)| Easy | Top_Interview_Questions, String, Math, Simulation | 3 | 32.80
1534+
| 0412 |[Fizz Buzz](src.save/main/java/g0401_0500/s0412_fizz_buzz/Solution.java)| Easy | Top_Interview_Questions, String, Math, Simulation | 1 | 100.00
15351535
| 0136 |[Single Number](src.save/main/java/g0101_0200/s0136_single_number/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation | 1 | 99.97
15361536
| 0007 |[Reverse Integer](src.save/main/java/g0001_0100/s0007_reverse_integer/Solution.java)| Medium | Top_Interview_Questions, Math | 2 | 66.74
15371537
| 0009 |[Palindrome Number](src.save/main/java/g0001_0100/s0009_palindrome_number/Solution.java)| Easy | Math | 13 | 58.99
@@ -1858,7 +1858,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
18581858
| 2331 |[Evaluate Boolean Binary Tree](src/main/java/g2301_2400/s2331_evaluate_boolean_binary_tree/Solution.java)| Easy | Binary_Search, Tree, Depth_First_Search | 0 | 100.00
18591859
| 2328 |[Number of Increasing Paths in a Grid](src/main/java/g2301_2400/s2328_number_of_increasing_paths_in_a_grid/Solution.java)| Hard | Array, Dynamic_Programming, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort, Memoization, Matrix | 43 | 100.00
18601860
| 2327 |[Number of People Aware of a Secret](src/main/java/g2301_2400/s2327_number_of_people_aware_of_a_secret/Solution.java)| Medium | Dynamic_Programming, Queue, Simulation | 7 | 80.00
1861-
| 2326 |[Spiral Matrix IV](src/main/java/g2301_2400/s2326_spiral_matrix_iv/Solution.java)| Medium | Array, Linked_List, Matrix, Simulation | 12 | 83.33
1861+
| 2326 |[Spiral Matrix IV](src/main/java/g2301_2400/s2326_spiral_matrix_iv/Solution.java)| Medium | Array, Linked_List, Matrix, Simulation | 12 | 85.48
18621862
| 2325 |[Decode the Message](src/main/java/g2301_2400/s2325_decode_the_message/Solution.java)| Easy | Hash_Table, String | 7 | 42.86
18631863
| 2322 |[Minimum Score After Removals on a Tree](src/main/java/g2301_2400/s2322_minimum_score_after_removals_on_a_tree/Solution.java)| Hard | Array, Bit_Manipulation, Tree, Depth_First_Search | 255 | 70.70
18641864
| 2321 |[Maximum Score Of Spliced Array](src/main/java/g2301_2400/s2321_maximum_score_of_spliced_array/Solution.java)| Hard | Array, Dynamic_Programming | 3 | 99.68
@@ -3353,16 +3353,16 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
33533353
| 0420 |[Strong Password Checker](src.save/main/java/g0401_0500/s0420_strong_password_checker/Solution.java)| Hard | String, Greedy, Heap_Priority_Queue | 0 | 100.00
33543354
| 0419 |[Battleships in a Board](src.save/main/java/g0401_0500/s0419_battleships_in_a_board/Solution.java)| Medium | Array, Depth_First_Search, Matrix | 1 | 83.10
33553355
| 0417 |[Pacific Atlantic Water Flow](src.save/main/java/g0401_0500/s0417_pacific_atlantic_water_flow/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Graph_Theory_I_Day_4_Matrix_Related_Problems, Level_2_Day_10_Graph/BFS/DFS, Udemy_Graph | 5 | 89.66
3356-
| 0416 |[Partition Equal Subset Sum](src.save/main/java/g0401_0500/s0416_partition_equal_subset_sum/Solution.java)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Level_2_Day_13_Dynamic_Programming | 1 | 99.87
3357-
| 0415 |[Add Strings](src.save/main/java/g0401_0500/s0415_add_strings/Solution.java)| Easy | String, Math, Simulation, Data_Structure_II_Day_6_String | 3 | 75.64
3358-
| 0414 |[Third Maximum Number](src.save/main/java/g0401_0500/s0414_third_maximum_number/Solution.java)| Easy | Array, Sorting | 1 | 96.71
3356+
| 0416 |[Partition Equal Subset Sum](src.save/main/java/g0401_0500/s0416_partition_equal_subset_sum/Solution.java)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Level_2_Day_13_Dynamic_Programming | 2 | 99.96
3357+
| 0415 |[Add Strings](src.save/main/java/g0401_0500/s0415_add_strings/Solution.java)| Easy | String, Math, Simulation, Data_Structure_II_Day_6_String | 3 | 82.41
3358+
| 0414 |[Third Maximum Number](src.save/main/java/g0401_0500/s0414_third_maximum_number/Solution.java)| Easy | Array, Sorting | 1 | 97.59
33593359
| 0413 |[Arithmetic Slices](src.save/main/java/g0401_0500/s0413_arithmetic_slices/Solution.java)| Medium | Array, Dynamic_Programming, Algorithm_II_Day_14_Dynamic_Programming, Dynamic_Programming_I_Day_10 | 0 | 100.00
3360-
| 0412 |[Fizz Buzz](src.save/main/java/g0401_0500/s0412_fizz_buzz/Solution.java)| Easy | Top_Interview_Questions, String, Math, Simulation, Udemy_Integers | 3 | 32.80
3361-
| 0410 |[Split Array Largest Sum](src.save/main/java/g0401_0500/s0410_split_array_largest_sum/Solution.java)| Hard | Array, Dynamic_Programming, Greedy, Binary_Search | 1 | 84.88
3362-
| 0409 |[Longest Palindrome](src.save/main/java/g0401_0500/s0409_longest_palindrome/Solution.java)| Easy | String, Hash_Table, Greedy, Data_Structure_II_Day_6_String, Level_1_Day_5_Greedy | 1 | 100.00
3363-
| 0407 |[Trapping Rain Water II](src.save/main/java/g0401_0500/s0407_trapping_rain_water_ii/Solution.java)| Hard | Array, Breadth_First_Search, Matrix, Heap_Priority_Queue | 10 | 99.01
3364-
| 0406 |[Queue Reconstruction by Height](src.save/main/java/g0401_0500/s0406_queue_reconstruction_by_height/Solution.java)| Medium | Array, Sorting, Greedy, Segment_Tree, Binary_Indexed_Tree | 9 | 74.45
3365-
| 0405 |[Convert a Number to Hexadecimal](src.save/main/java/g0401_0500/s0405_convert_a_number_to_hexadecimal/Solution.java)| Easy | Math, Bit_Manipulation | 0 | 100.00
3360+
| 0412 |[Fizz Buzz](src.save/main/java/g0401_0500/s0412_fizz_buzz/Solution.java)| Easy | Top_Interview_Questions, String, Math, Simulation, Udemy_Integers | 1 | 100.00
3361+
| 0410 |[Split Array Largest Sum](src.save/main/java/g0401_0500/s0410_split_array_largest_sum/Solution.java)| Hard | Array, Dynamic_Programming, Greedy, Binary_Search | 1 | 86.51
3362+
| 0409 |[Longest Palindrome](src.save/main/java/g0401_0500/s0409_longest_palindrome/Solution.java)| Easy | String, Hash_Table, Greedy, Data_Structure_II_Day_6_String, Level_1_Day_5_Greedy | 2 | 92.90
3363+
| 0407 |[Trapping Rain Water II](src.save/main/java/g0401_0500/s0407_trapping_rain_water_ii/Solution.java)| Hard | Array, Breadth_First_Search, Matrix, Heap_Priority_Queue | 15 | 96.81
3364+
| 0406 |[Queue Reconstruction by Height](src.save/main/java/g0401_0500/s0406_queue_reconstruction_by_height/Solution.java)| Medium | Array, Sorting, Greedy, Segment_Tree, Binary_Indexed_Tree | 5 | 99.82
3365+
| 0405 |[Convert a Number to Hexadecimal](src.save/main/java/g0401_0500/s0405_convert_a_number_to_hexadecimal/Solution.java)| Easy | Math, Bit_Manipulation | 1 | 71.02
33663366
| 0404 |[Sum of Left Leaves](src.save/main/java/g0401_0500/s0404_sum_of_left_leaves/Solution.java)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Programming_Skills_I_Day_10_Linked_List_and_Tree | 1 | 29.26
33673367
| 0403 |[Frog Jump](src.save/main/java/g0401_0500/s0403_frog_jump/Solution.java)| Hard | Array, Dynamic_Programming | 13 | 99.06
33683368
| 0402 |[Remove K Digits](src.save/main/java/g0401_0500/s0402_remove_k_digits/Solution.java)| Medium | String, Greedy, Stack, Monotonic_Stack | 4 | 99.66

‎src.save/main/java/g0401_0500/s0405_convert_a_number_to_hexadecimal/Solution.java‎

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

3-
// #Easy #Math #Bit_Manipulation #2022_03_16_Time_0_ms_(100.00%)_Space_41.4_MB_(41.83%)
3+
// #Easy #Math #Bit_Manipulation #2022_07_16_Time_1_ms_(71.02%)_Space_42.2_MB_(15.68%)
44

55
public class Solution {
66
public String toHex(int num) {

‎src.save/main/java/g0401_0500/s0406_queue_reconstruction_by_height/Solution.java‎

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

33
// #Medium #Array #Sorting #Greedy #Segment_Tree #Binary_Indexed_Tree
4-
// #2022_03_16_Time_9_ms_(74.45%)_Space_54.6_MB_(43.92%)
4+
// #2022_07_16_Time_5_ms_(99.82%)_Space_43_MB_(93.43%)
55

66
import java.util.ArrayList;
77
import java.util.Arrays;

‎src.save/main/java/g0401_0500/s0407_trapping_rain_water_ii/Solution.java‎

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

33
// #Hard #Array #Breadth_First_Search #Matrix #Heap_Priority_Queue
4-
// #2022_03_16_Time_10_ms_(99.01%)_Space_50.1_MB_(78.01%)
4+
// #2022_07_16_Time_15_ms_(96.81%)_Space_60.8_MB_(6.23%)
55

66
import java.util.Objects;
77
import java.util.PriorityQueue;

‎src.save/main/java/g0401_0500/s0409_longest_palindrome/Solution.java‎

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

33
// #Easy #String #Hash_Table #Greedy #Data_Structure_II_Day_6_String #Level_1_Day_5_Greedy
4-
// #2022_03_16_Time_1_ms_(100.00%)_Space_40.1_MB_(75.61%)
4+
// #2022_07_16_Time_2_ms_(92.90%)_Space_40.5_MB_(95.32%)
55

66
import java.util.BitSet;
77

‎src.save/main/java/g0401_0500/s0410_split_array_largest_sum/Solution.java‎

Lines changed: 1 addition & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,18 +1,16 @@
11
package g0401_0500.s0410_split_array_largest_sum;
22

33
// #Hard #Array #Dynamic_Programming #Greedy #Binary_Search
4-
// #2022_03_16_Time_1_ms_(84.88%)_Space_41.4_MB_(59.15%)
4+
// #2022_07_16_Time_1_ms_(86.51%)_Space_41.4_MB_(68.72%)
55

66
public class Solution {
77
public int splitArray(int[] nums, int m) {
88
int maxVal = 0;
99
int minVal = nums[0];
10-
1110
for (int num : nums) {
1211
maxVal += num;
1312
minVal = Math.max(minVal, num);
1413
}
15-
1614
while (minVal < maxVal) {
1715
int midVal = minVal + (maxVal - minVal) / 2;
1816
// if we can split, try to reduce the midVal so decrease maxVal
@@ -23,7 +21,6 @@ public int splitArray(int[] nums, int m) {
2321
minVal = midVal + 1;
2422
}
2523
}
26-
2724
return minVal;
2825
}
2926

‎src.save/main/java/g0401_0500/s0412_fizz_buzz/Solution.java‎

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

33
// #Easy #Top_Interview_Questions #String #Math #Simulation #Udemy_Integers
4-
// #2022_03_18_Time_3_ms_(32.80%)_Space_49_MB_(8.43%)
4+
// #2022_07_16_Time_1_ms_(100.00%)_Space_48.4_MB_(48.76%)
55

66
import java.util.ArrayList;
77
import java.util.List;

‎src.save/main/java/g0401_0500/s0413_arithmetic_slices/Solution.java‎

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

33
// #Medium #Array #Dynamic_Programming #Algorithm_II_Day_14_Dynamic_Programming
4-
// #Dynamic_Programming_I_Day_10 #2022_03_18_Time_0_ms_(100.00%)_Space_41.5_MB_(70.83%)
4+
// #Dynamic_Programming_I_Day_10 #2022_07_16_Time_0_ms_(100.00%)_Space_42.6_MB_(14.82%)
55

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

‎src.save/main/java/g0401_0500/s0414_third_maximum_number/Solution.java‎

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

3-
// #Easy #Array #Sorting #2022_03_18_Time_1_ms_(96.71%)_Space_42_MB_(75.84%)
3+
// #Easy #Array #Sorting #2022_07_16_Time_1_ms_(97.59%)_Space_41.9_MB_(92.80%)
44

55
public class Solution {
66
public int thirdMax(int[] nums) {

‎src.save/main/java/g0401_0500/s0415_add_strings/Solution.java‎

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

33
// #Easy #String #Math #Simulation #Data_Structure_II_Day_6_String
4-
// #2022_03_18_Time_3_ms_(75.64%)_Space_43_MB_(59.01%)
4+
// #2022_07_16_Time_3_ms_(82.41%)_Space_43.1_MB_(66.56%)
55

66
public class Solution {
77
public String addStrings(String num1, String num2) {

0 commit comments

Comments
 (0)