Skip to content

Commit 7d1cb0f

Browse files
javadevjavadev
authored
Updated exec time 119-130.
1 parent 7dc9490 commit 7d1cb0f

File tree

11 files changed

+25
-25
lines changed

11 files changed

+25
-25
lines changed

‎README.md‎

Lines changed: 15 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -68,7 +68,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
6868
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
6969
|-|-|-|-|-|-
7070
| 0350 |[Intersection of Two Arrays II](src.save/main/java/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.java)| Easy | Top_Interview_Questions, Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 3 | 81.79
71-
| 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 | 2 | 85.25
71+
| 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
7272

7373
#### Day 4 Array
7474

@@ -471,7 +471,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
471471
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
472472
|-|-|-|-|-|-
473473
| 1091 |[Shortest Path in Binary Matrix](src.save/main/java/g1001_1100/s1091_shortest_path_in_binary_matrix/Solution.java)| Medium | Array, Breadth_First_Search, Matrix | 22 | 69.99
474-
| 0130 |[Surrounded Regions](src.save/main/java/g0101_0200/s0130_surrounded_regions/Solution.java)| Medium | Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 2 | 80.58
474+
| 0130 |[Surrounded Regions](src.save/main/java/g0101_0200/s0130_surrounded_regions/Solution.java)| Medium | Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 2 | 84.66
475475
| 0797 |[All Paths From Source to Target](src.save/main/java/g0701_0800/s0797_all_paths_from_source_to_target/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Backtracking | 2 | 90.53
476476

477477
#### Day 9 Recursion Backtracking
@@ -843,8 +843,8 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
843843
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
844844
|-|-|-|-|-|-
845845
| 1014 |[Best Sightseeing Pair](src.save/main/java/g1001_1100/s1014_best_sightseeing_pair/Solution.java)| Medium | Array, Dynamic_Programming | 2 | 99.86
846-
| 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 | 2 | 85.25
847-
| 0122 |[Best Time to Buy and Sell Stock II](src.save/main/java/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii/Solution.java)| Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy | 2 | 34.31
846+
| 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
847+
| 0122 |[Best Time to Buy and Sell Stock II](src.save/main/java/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii/Solution.java)| Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy | 1 | 96.82
848848

849849
#### Day 8
850850

@@ -1272,7 +1272,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
12721272
|-|-|-|-|-|-
12731273
| 0433 |[Minimum Genetic Mutation](src.save/main/java/g0401_0500/s0433_minimum_genetic_mutation/Solution.java)| Medium | String, Hash_Table, Breadth_First_Search | 0 | 100.00
12741274
| 0752 |[Open the Lock](src.save/main/java/g0701_0800/s0752_open_the_lock/Solution.java)| Medium | Array, String, Hash_Table, Breadth_First_Search | 72 | 91.06
1275-
| 0127 |[Word Ladder](src.save/main/java/g0101_0200/s0127_word_ladder/Solution.java)| Hard | Top_Interview_Questions, String, Hash_Table, Breadth_First_Search | 32 | 94.39
1275+
| 0127 |[Word Ladder](src.save/main/java/g0101_0200/s0127_word_ladder/Solution.java)| Hard | Top_Interview_Questions, String, Hash_Table, Breadth_First_Search | 37 | 94.58
12761276

12771277
#### Day 13 Graph Theory
12781278

@@ -1408,7 +1408,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
14081408

14091409
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
14101410
|-|-|-|-|-|-
1411-
| 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 | 2 | 85.25
1411+
| 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
14121412
| 0409 |[Longest Palindrome](src.save/main/java/g0401_0500/s0409_longest_palindrome/Solution.java)| Easy | String, Hash_Table, Greedy | 1 | 100.00
14131413

14141414
#### Day 6 Tree
@@ -1486,7 +1486,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
14861486
| # | Title | Difficulty | Tag | Time, ms | Time, %
14871487
|------|----------------|-------------|-------------|----------|---------
14881488
| 2312 |[Selling Pieces of Wood](src/main/java/g2301_2400/s2312_selling_pieces_of_wood/Solution.java)| Hard | Backtracking | 78 | 63.64
1489-
| 2311 |[Longest Binary Subsequence Less Than or Equal to K](src/main/java/g2301_2400/s2311_longest_binary_subsequence_less_than_or_equal_to_k/Solution.java)| Medium | Math | 1 | 100.00
1489+
| 2311 |[Longest Binary Subsequence Less Than or Equal to K](src/main/java/g2301_2400/s2311_longest_binary_subsequence_less_than_or_equal_to_k/Solution.java)| Medium | String, Dynamic_Programming, Greedy, Memoization | 1 | 100.00
14901490
| 2310 |[Sum of Numbers With Units Digit K](src/main/java/g2301_2400/s2310_sum_of_numbers_with_units_digit_k/Solution.java)| Medium | Math | 1 | 66.67
14911491
| 2309 |[Greatest English Letter in Upper and Lower Case](src/main/java/g2301_2400/s2309_greatest_english_letter_in_upper_and_lower_case/Solution.java)| Easy | Array | 5 | 75.00
14921492
| 2306 |[Naming a Company](src/main/java/g2301_2400/s2306_naming_a_company/Solution.java)| Hard | Array, String, Hash_Table, Bit_Manipulation, Enumeration | 486 | 74.14
@@ -3184,16 +3184,16 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
31843184
| 0133 |[Clone Graph](src.save/main/java/g0101_0200/s0133_clone_graph/Solution.java)| Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Graph | 55 | 16.92
31853185
| 0132 |[Palindrome Partitioning II](src.save/main/java/g0101_0200/s0132_palindrome_partitioning_ii/Solution.java)| Hard | String, Dynamic_Programming | 2 | 99.72
31863186
| 0131 |[Palindrome Partitioning](src.save/main/java/g0101_0200/s0131_palindrome_partitioning/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking | 19 | 53.74
3187-
| 0130 |[Surrounded Regions](src.save/main/java/g0101_0200/s0130_surrounded_regions/Solution.java)| Medium | Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_8_Breadth_First_Search_Depth_First_Search | 2 | 80.58
3187+
| 0130 |[Surrounded Regions](src.save/main/java/g0101_0200/s0130_surrounded_regions/Solution.java)| Medium | Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_8_Breadth_First_Search_Depth_First_Search | 2 | 84.66
31883188
| 0129 |[Sum Root to Leaf Numbers](src.save/main/java/g0101_0200/s0129_sum_root_to_leaf_numbers/Solution.java)| Medium | Depth_First_Search, Tree, Binary_Tree | 0 | 100.00
3189-
| 0128 |[Longest Consecutive Sequence](src.save/main/java/g0101_0200/s0128_longest_consecutive_sequence/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Union_Find | 17 | 84.46
3190-
| 0127 |[Word Ladder](src.save/main/java/g0101_0200/s0127_word_ladder/Solution.java)| Hard | Top_Interview_Questions, String, Hash_Table, Breadth_First_Search, Graph_Theory_I_Day_12_Breadth_First_Search | 32 | 94.39
3189+
| 0128 |[Longest Consecutive Sequence](src.save/main/java/g0101_0200/s0128_longest_consecutive_sequence/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Union_Find | 18 | 91.05
3190+
| 0127 |[Word Ladder](src.save/main/java/g0101_0200/s0127_word_ladder/Solution.java)| Hard | Top_Interview_Questions, String, Hash_Table, Breadth_First_Search, Graph_Theory_I_Day_12_Breadth_First_Search | 37 | 94.58
31913191
| 0126 |[Word Ladder II](src.save/main/java/g0101_0200/s0126_word_ladder_ii/Solution.java)| Hard | String, Hash_Table, Breadth_First_Search, Backtracking | 4 | 99.18
3192-
| 0125 |[Valid Palindrome](src.save/main/java/g0101_0200/s0125_valid_palindrome/Solution.java)| Easy | Top_Interview_Questions, String, Two_Pointers | 3 | 88.82
3193-
| 0124 |[Binary Tree Maximum Path Sum](src.save/main/java/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.java)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree | 1 | 76.01
3194-
| 0123 |[Best Time to Buy and Sell Stock III](src.save/main/java/g0101_0200/s0123_best_time_to_buy_and_sell_stock_iii/Solution.java)| Hard | Array, Dynamic_Programming | 1 | 100.00
3195-
| 0122 |[Best Time to Buy and Sell Stock II](src.save/main/java/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii/Solution.java)| Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Dynamic_Programming_I_Day_7 | 2 | 34.31
3196-
| 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, Data_Structure_I_Day_3_Array, Dynamic_Programming_I_Day_7, Level_1_Day_5_Greedy | 2 | 85.25
3192+
| 0125 |[Valid Palindrome](src.save/main/java/g0101_0200/s0125_valid_palindrome/Solution.java)| Easy | Top_Interview_Questions, String, Two_Pointers | 3 | 98.64
3193+
| 0124 |[Binary Tree Maximum Path Sum](src.save/main/java/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.java)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree | 1 | 99.46
3194+
| 0123 |[Best Time to Buy and Sell Stock III](src.save/main/java/g0101_0200/s0123_best_time_to_buy_and_sell_stock_iii/Solution.java)| Hard | Array, Dynamic_Programming | 4 | 87.18
3195+
| 0122 |[Best Time to Buy and Sell Stock II](src.save/main/java/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii/Solution.java)| Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Dynamic_Programming_I_Day_7 | 1 | 96.82
3196+
| 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, Data_Structure_I_Day_3_Array, Dynamic_Programming_I_Day_7, Level_1_Day_5_Greedy | 1 | 100.00
31973197
| 0120 |[Triangle](src.save/main/java/g0101_0200/s0120_triangle/Solution.java)| Medium | Array, Dynamic_Programming, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_13 | 2 | 94.63
31983198
| 0119 |[Pascal's Triangle II](src.save/main/java/g0101_0200/s0119_pascals_triangle_ii/Solution.java)| Easy | Array, Dynamic_Programming, Data_Structure_II_Day_3_Array, Dynamic_Programming_I_Day_12 | 0 | 100.00
31993199
| 0118 |[Pascal's Triangle](src.save/main/java/g0101_0200/s0118_pascals_triangle/Solution.java)| Easy | Top_Interview_Questions, Array, Dynamic_Programming, Data_Structure_I_Day_4_Array, Dynamic_Programming_I_Day_12 | 1 | 67.08

‎src.save/main/java/g0101_0200/s0119_pascals_triangle_ii/Solution.java‎

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

33
// #Easy #Array #Dynamic_Programming #Data_Structure_II_Day_3_Array #Dynamic_Programming_I_Day_12
4-
// #2022_02_22_Time_0_ms_(100.00%)_Space_41.9_MB_(14.49%)
4+
// #2022_06_23_Time_0_ms_(100.00%)_Space_41.5_MB_(70.65%)
55

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

‎src.save/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
44
// #Data_Structure_I_Day_3_Array #Dynamic_Programming_I_Day_7 #Level_1_Day_5_Greedy
5-
// #2022_02_22_Time_2_ms_(85.25%)_Space_83.8_MB_(55.29%)
5+
// #2022_06_23_Time_1_ms_(100.00%)_Space_58.9_MB_(93.57%)
66

77
public class Solution {
88
public int maxProfit(int[] prices) {

‎src.save/main/java/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii/Solution.java‎

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

33
// #Medium #Top_Interview_Questions #Array #Dynamic_Programming #Greedy #Dynamic_Programming_I_Day_7
4-
// #2022_02_22_Time_2_ms_(34.31%)_Space_44.1_MB_(27.48%)
4+
// #2022_06_23_Time_1_ms_(96.82%)_Space_44.7_MB_(25.11%)
55

66
public class Solution {
77
public int maxProfit(int[] prices) {

‎src.save/main/java/g0101_0200/s0123_best_time_to_buy_and_sell_stock_iii/Solution.java‎

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

3-
// #Hard #Array #Dynamic_Programming #2022_02_22_Time_1_ms_(100.00%)_Space_58.7_MB_(75.57%)
3+
// #Hard #Array #Dynamic_Programming #2022_06_23_Time_4_ms_(87.18%)_Space_78.4_MB_(61.70%)
44

55
public class Solution {
66
public int maxProfit(int[] prices) {

‎src.save/main/java/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.java‎

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

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Depth_First_Search
4-
// #Tree #Binary_Tree #2022_02_22_Time_1_ms_(76.01%)_Space_47.6_MB_(29.62%)
4+
// #Tree #Binary_Tree #2022_06_23_Time_1_ms_(99.46%)_Space_47.2_MB_(77.68%)
55

66
import com_github_leetcode.TreeNode;
77

‎src.save/main/java/g0101_0200/s0125_valid_palindrome/Solution.java‎

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

33
// #Easy #Top_Interview_Questions #String #Two_Pointers
4-
// #2022_02_22_Time_3_ms_(88.82%)_Space_43.4_MB_(41.11%)
4+
// #2022_06_23_Time_3_ms_(98.64%)_Space_43.2_MB_(81.23%)
55

66
public class Solution {
77
public boolean isPalindrome(String s) {

‎src.save/main/java/g0101_0200/s0127_word_ladder/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Hard #Top_Interview_Questions #String #Hash_Table #Breadth_First_Search
44
// #Graph_Theory_I_Day_12_Breadth_First_Search
5-
// #2022_02_22_Time_32_ms_(94.39%)_Space_53.6_MB_(60.33%)
5+
// #2022_06_23_Time_37_ms_(94.58%)_Space_54.1_MB_(66.08%)
66

77
import java.util.HashSet;
88
import java.util.List;

‎src.save/main/java/g0101_0200/s0128_longest_consecutive_sequence/Solution.java‎

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Union_Find
4-
// #2022_02_22_Time_17_ms_(84.46%)_Space_61.3_MB_(42.78%)
4+
// #2022_06_23_Time_18_ms_(91.05%)_Space_64.8_MB_(63.58%)
55

66
import java.util.Arrays;
77

‎src.save/main/java/g0101_0200/s0129_sum_root_to_leaf_numbers/Solution.java‎

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

33
// #Medium #Depth_First_Search #Tree #Binary_Tree
4-
// #2022_02_22_Time_0_ms_(100.00%)_Space_39.9_MB_(36.66%)
4+
// #2022_06_23_Time_0_ms_(100.00%)_Space_41.8_MB_(46.81%)
55

66
import com_github_leetcode.TreeNode;
77

0 commit comments

Comments
 (0)