Skip to content

Commit 6a52c7e

Browse files
javadevjavadev
authored
Updated exec time 151-160.
1 parent e7fbf08 commit 6a52c7e

File tree

8 files changed

+15
-16
lines changed

8 files changed

+15
-16
lines changed

‎README.md‎

Lines changed: 8 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -232,7 +232,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
232232

233233
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
234234
|-|-|-|-|-|-
235-
| 0160 |[Intersection of Two Linked Lists](src.save/main/java/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List | 2 | 61.05
235+
| 0160 |[Intersection of Two Linked Lists](src.save/main/java/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List | 1 | 99.68
236236
| 0082 |[Remove Duplicates from Sorted List II](src.save/main/java/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/Solution.java)| Medium | Two_Pointers, Linked_List | 0 | 100.00
237237

238238
#### Day 12 Linked List
@@ -253,7 +253,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
253253

254254
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
255255
|-|-|-|-|-|-
256-
| 0155 |[Min Stack](src.save/main/java/g0101_0200/s0155_min_stack/MinStack.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design | 5 | 81.77
256+
| 0155 |[Min Stack](src.save/main/java/g0101_0200/s0155_min_stack/MinStack.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design | 3 | 100.00
257257
| 1249 |[Minimum Remove to Make Valid Parentheses](src.save/main/java/g1201_1300/s1249_minimum_remove_to_make_valid_parentheses/Solution.java)| Medium | String, Stack | 13 | 94.62
258258
| 1823 |[Find the Winner of the Circular Game](src.save/main/java/g1801_1900/s1823_find_the_winner_of_the_circular_game/Solution.java)| Medium | Array, Math, Simulation, Recursion, Queue | 3 | 64.85
259259

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

742742
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
743743
|-|-|-|-|-|-
744-
| 0154 |[Find Minimum in Rotated Sorted Array II](src.save/main/java/g0101_0200/s0154_find_minimum_in_rotated_sorted_array_ii/Solution.java)| Hard | Array, Binary_Search | 0 | 100.00
744+
| 0154 |[Find Minimum in Rotated Sorted Array II](src.save/main/java/g0101_0200/s0154_find_minimum_in_rotated_sorted_array_ii/Solution.java)| Hard | Array, Binary_Search | 1 | 77.09
745745
| 0528 |[Random Pick with Weight](src.save/main/java/g0501_0600/s0528_random_pick_with_weight/Solution.java)| Medium | Math, Binary_Search, Prefix_Sum, Randomized | 29 | 83.26
746746

747747
#### Day 14
@@ -1167,7 +1167,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
11671167

11681168
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
11691169
|-|-|-|-|-|-
1170-
| 0155 |[Min Stack](src.save/main/java/g0101_0200/s0155_min_stack/MinStack.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design | 5 | 81.77
1170+
| 0155 |[Min Stack](src.save/main/java/g0101_0200/s0155_min_stack/MinStack.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design | 3 | 100.00
11711171
| 0341 |[Flatten Nested List Iterator](src.save/main/java/g0301_0400/s0341_flatten_nested_list_iterator/NestedIterator.java)| Medium | Top_Interview_Questions, Depth_First_Search, Tree, Stack, Design, Queue, Iterator | 3 | 86.51
11721172

11731173
#### Day 19
@@ -3158,12 +3158,12 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
31583158
| 0165 |[Compare Version Numbers](src.save/main/java/g0101_0200/s0165_compare_version_numbers/Solution.java)| Medium | String, Two_Pointers | 1 | 90.80
31593159
| 0164 |[Maximum Gap](src.save/main/java/g0101_0200/s0164_maximum_gap/Solution.java)| Hard | Array, Sorting, Bucket_Sort, Radix_Sort | 36 | 66.54
31603160
| 0162 |[Find Peak Element](src.save/main/java/g0101_0200/s0162_find_peak_element/Solution.java)| Medium | Top_Interview_Questions, Array, Binary_Search, Algorithm_II_Day_2_Binary_Search, Binary_Search_II_Day_12 | 0 | 100.00
3161-
| 0160 |[Intersection of Two Linked Lists](src.save/main/java/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_II_Day_11_Linked_List | 2 | 61.05
3162-
| 0155 |[Min Stack](src.save/main/java/g0101_0200/s0155_min_stack/MinStack.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Data_Structure_II_Day_14_Stack_Queue, Programming_Skills_II_Day_18 | 5 | 81.77
3163-
| 0154 |[Find Minimum in Rotated Sorted Array II](src.save/main/java/g0101_0200/s0154_find_minimum_in_rotated_sorted_array_ii/Solution.java)| Hard | Array, Binary_Search, Binary_Search_II_Day_13 | 0 | 100.00
3161+
| 0160 |[Intersection of Two Linked Lists](src.save/main/java/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_II_Day_11_Linked_List | 1 | 99.68
3162+
| 0155 |[Min Stack](src.save/main/java/g0101_0200/s0155_min_stack/MinStack.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Data_Structure_II_Day_14_Stack_Queue, Programming_Skills_II_Day_18 | 3 | 100.00
3163+
| 0154 |[Find Minimum in Rotated Sorted Array II](src.save/main/java/g0101_0200/s0154_find_minimum_in_rotated_sorted_array_ii/Solution.java)| Hard | Array, Binary_Search, Binary_Search_II_Day_13 | 1 | 77.09
31643164
| 0153 |[Find Minimum in Rotated Sorted Array](src.save/main/java/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.java)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Algorithm_II_Day_2_Binary_Search, Binary_Search_I_Day_12 | 0 | 100.00
31653165
| 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, Dynamic_Programming_I_Day_6 | 0 | 100.00
3166-
| 0151 |[Reverse Words in a String](src.save/main/java/g0101_0200/s0151_reverse_words_in_a_string/Solution.java)| Medium | String, Two_Pointers | 3 | 96.37
3166+
| 0151 |[Reverse Words in a String](src.save/main/java/g0101_0200/s0151_reverse_words_in_a_string/Solution.java)| Medium | String, Two_Pointers | 2 | 99.94
31673167
| 0150 |[Evaluate Reverse Polish Notation](src.save/main/java/g0101_0200/s0150_evaluate_reverse_polish_notation/Solution.java)| Medium | Top_Interview_Questions, Array, Math, Stack, Programming_Skills_II_Day_3 | 9 | 51.23
31683168
| 0149 |[Max Points on a Line](src.save/main/java/g0101_0200/s0149_max_points_on_a_line/Solution.java)| Hard | Top_Interview_Questions, Array, Hash_Table, Math, Geometry, Algorithm_II_Day_21_Others | 11 | 99.21
31693169
| 0148 |[Sort List](src.save/main/java/g0101_0200/s0148_sort_list/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort | 12 | 85.82

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

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

3-
// #Medium #String #Two_Pointers #2022_02_23_Time_3_ms_(96.37%)_Space_43.4_MB_(35.43%)
3+
// #Medium #String #Two_Pointers #2022_06_25_Time_2_ms_(99.94%)_Space_42.4_MB_(88.57%)
44

55
public class Solution {
66
public String reverseWords(String s) {
@@ -19,7 +19,6 @@ public String reverseWords(String s) {
1919
if (sb.length() > 0) {
2020
sb.deleteCharAt(0);
2121
}
22-
2322
return sb.toString();
2423
}
2524
}

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

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
4-
// #Dynamic_Programming_I_Day_6 #2022_02_23_Time_0_ms_(100.00%)_Space_42.5_MB_(38.69%)
4+
// #Dynamic_Programming_I_Day_6 #2022_06_25_Time_0_ms_(100.00%)_Space_42.7_MB_(82.46%)
55

66
public class Solution {
77
public int maxProduct(int[] arr) {

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

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

33
// #Medium #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_II_Day_2_Binary_Search
4-
// #Binary_Search_I_Day_12 #2022_02_23_Time_0_ms_(100.00%)_Space_41.9_MB_(37.13%)
4+
// #Binary_Search_I_Day_12 #2022_06_25_Time_0_ms_(100.00%)_Space_43.3_MB_(6.36%)
55

66
public class Solution {
77
private int findMinUtil(int[] nums, int l, int r) {

‎src.save/main/java/g0101_0200/s0154_find_minimum_in_rotated_sorted_array_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.s0154_find_minimum_in_rotated_sorted_array_ii;
22

33
// #Hard #Array #Binary_Search #Binary_Search_II_Day_13
4-
// #2022_02_23_Time_0_ms_(100.00%)_Space_41.8_MB_(40.58%)
4+
// #2022_06_25_Time_1_ms_(77.09%)_Space_44.6_MB_(7.09%)
55

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

‎src.save/main/java/g0101_0200/s0155_min_stack/MinStack.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 #Stack #Design
44
// #Data_Structure_II_Day_14_Stack_Queue #Programming_Skills_II_Day_18
5-
// #2022_02_23_Time_5_ms_(81.77%)_Space_48.5_MB_(20.01%)
5+
// #2022_06_25_Time_3_ms_(100.00%)_Space_44.3_MB_(85.39%)
66

77
public class MinStack {
88
private Node currentNode;

‎src.save/main/java/g0101_0200/s0155_min_stack/Node.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 #Stack #Design
44
// #Data_Structure_II_Day_14_Stack_Queue #Programming_Skills_II_Day_18
5-
// #2022_02_23_Time_5_ms_(81.77%)_Space_48.5_MB_(20.01%)
5+
// #2022_06_25_Time_3_ms_(100.00%)_Space_44.3_MB_(85.39%)
66

77
public class Node {
88
int min;

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

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

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Two_Pointers #Linked_List
4-
// #Data_Structure_II_Day_11_Linked_List #2022_02_23_Time_2_ms_(61.05%)_Space_55.1_MB_(26.21%)
4+
// #Data_Structure_II_Day_11_Linked_List #2022_06_25_Time_1_ms_(99.68%)_Space_55.1_MB_(63.42%)
55

66
import com_github_leetcode.ListNode;
77

0 commit comments

Comments
 (0)