Skip to content

Commit e7fbf08

Browse files
javadevjavadev
authored
Updated exec time 141-150.
1 parent 2542732 commit e7fbf08

File tree

11 files changed

+24
-24
lines changed

11 files changed

+24
-24
lines changed

‎README.md‎

Lines changed: 14 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -118,9 +118,9 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
118118

119119
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
120120
|-|-|-|-|-|-
121-
| 0144 |[Binary Tree Preorder Traversal](src.save/main/java/g0101_0200/s0144_binary_tree_preorder_traversal/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree, Stack | 1 | 42.23
121+
| 0144 |[Binary Tree Preorder Traversal](src.save/main/java/g0101_0200/s0144_binary_tree_preorder_traversal/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree, Stack | 1 | 48.38
122122
| 0094 |[Binary Tree Inorder Traversal](src.save/main/java/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack | 0 | 100.00
123-
| 0145 |[Binary Tree Postorder Traversal](src.save/main/java/g0101_0200/s0145_binary_tree_postorder_traversal/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree, Stack | 1 | 42.74
123+
| 0145 |[Binary Tree Postorder Traversal](src.save/main/java/g0101_0200/s0145_binary_tree_postorder_traversal/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree, Stack | 1 | 49.11
124124

125125
#### Day 11 Tree
126126

@@ -247,7 +247,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
247247
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
248248
|-|-|-|-|-|-
249249
| 0025 |[Reverse Nodes in k-Group](src.save/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.java)| Hard | Top_100_Liked_Questions, Linked_List, Recursion | 0 | 100.00
250-
| 0143 |[Reorder List](src.save/main/java/g0101_0200/s0143_reorder_list/Solution.java)| Medium | Two_Pointers, Stack, Linked_List, Recursion | 2 | 72.16
250+
| 0143 |[Reorder List](src.save/main/java/g0101_0200/s0143_reorder_list/Solution.java)| Medium | Two_Pointers, Stack, Linked_List, Recursion | 2 | 72.59
251251

252252
#### Day 14 Stack Queue
253253

@@ -564,7 +564,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
564564
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
565565
|-|-|-|-|-|-
566566
| 0202 |[Happy Number](src.save/main/java/g0201_0300/s0202_happy_number/Solution.java)| Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers | 1 | 93.34
567-
| 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 | 4 | 98.44
567+
| 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 | 11 | 99.21
568568

569569
### Binary Search I
570570

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

10631063
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
10641064
|-|-|-|-|-|-
1065-
| 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 | 12 | 29.56
1065+
| 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 | 9 | 51.23
10661066
| 0066 |[Plus One](src.save/main/java/g0001_0100/s0066_plus_one/Solution.java)| Easy | Top_Interview_Questions, Array, Math | 0 | 100.00
10671067

10681068
#### Day 4
@@ -1139,7 +1139,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
11391139

11401140
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
11411141
|-|-|-|-|-|-
1142-
| 0143 |[Reorder List](src.save/main/java/g0101_0200/s0143_reorder_list/Solution.java)| Medium | Two_Pointers, Stack, Linked_List, Recursion | 2 | 72.16
1142+
| 0143 |[Reorder List](src.save/main/java/g0101_0200/s0143_reorder_list/Solution.java)| Medium | Two_Pointers, Stack, Linked_List, Recursion | 2 | 72.59
11431143
| 0138 |[Copy List with Random Pointer](src.save/main/java/g0101_0200/s0138_copy_list_with_random_pointer/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List | 0 | 100.00
11441144

11451145
#### Day 15
@@ -3164,14 +3164,14 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
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
31663166
| 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
3167-
| 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 | 12 | 29.56
3168-
| 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 | 4 | 98.44
3169-
| 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 | 8 | 78.95
3170-
| 0147 |[Insertion Sort List](src.save/main/java/g0101_0200/s0147_insertion_sort_list/Solution.java)| Medium | Sorting, Linked_List | 3 | 92.25
3171-
| 0146 |[LRU Cache](src.save/main/java/g0101_0200/s0146_lru_cache/LRUCache.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List | 82 | 59.12
3172-
| 0145 |[Binary Tree Postorder Traversal](src.save/main/java/g0101_0200/s0145_binary_tree_postorder_traversal/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree, Stack, Data_Structure_I_Day_10_Tree | 1 | 42.74
3173-
| 0144 |[Binary Tree Preorder Traversal](src.save/main/java/g0101_0200/s0144_binary_tree_preorder_traversal/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree, Stack, Data_Structure_I_Day_10_Tree | 1 | 42.23
3174-
| 0143 |[Reorder List](src.save/main/java/g0101_0200/s0143_reorder_list/Solution.java)| Medium | Two_Pointers, Stack, Linked_List, Recursion, Data_Structure_II_Day_13_Linked_List, Programming_Skills_II_Day_14 | 2 | 72.16
3167+
| 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
3168+
| 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
3169+
| 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
3170+
| 0147 |[Insertion Sort List](src.save/main/java/g0101_0200/s0147_insertion_sort_list/Solution.java)| Medium | Sorting, Linked_List | 4 | 90.34
3171+
| 0146 |[LRU Cache](src.save/main/java/g0101_0200/s0146_lru_cache/LRUCache.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List | 87 | 50.80
3172+
| 0145 |[Binary Tree Postorder Traversal](src.save/main/java/g0101_0200/s0145_binary_tree_postorder_traversal/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree, Stack, Data_Structure_I_Day_10_Tree | 1 | 49.11
3173+
| 0144 |[Binary Tree Preorder Traversal](src.save/main/java/g0101_0200/s0144_binary_tree_preorder_traversal/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree, Stack, Data_Structure_I_Day_10_Tree | 1 | 48.38
3174+
| 0143 |[Reorder List](src.save/main/java/g0101_0200/s0143_reorder_list/Solution.java)| Medium | Two_Pointers, Stack, Linked_List, Recursion, Data_Structure_II_Day_13_Linked_List, Programming_Skills_II_Day_14 | 2 | 72.59
31753175
| 0142 |[Linked List Cycle II](src.save/main/java/g0101_0200/s0142_linked_list_cycle_ii/Solution.java)| Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_II_Day_10_Linked_List, Level_1_Day_4_Linked_List | 0 | 100.00
31763176
| 0141 |[Linked List Cycle](src.save/main/java/g0101_0200/s0141_linked_list_cycle/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_I_Day_7_Linked_List | 0 | 100.00
31773177
| 0140 |[Word Break II](src.save/main/java/g0101_0200/s0140_word_break_ii/Solution.java)| Hard | Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Backtracking, Trie, Memoization | 1 | 99.05

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

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

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Two_Pointers #Linked_List
4-
// #Data_Structure_I_Day_7_Linked_List #2022_02_23_Time_0_ms_(100.00%)_Space_46.5_MB_(9.38%)
4+
// #Data_Structure_I_Day_7_Linked_List #2022_06_24_Time_0_ms_(100.00%)_Space_45.5_MB_(68.52%)
55

66
import com_github_leetcode.ListNode;
77

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

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

33
// #Medium #Top_100_Liked_Questions #Hash_Table #Two_Pointers #Linked_List
44
// #Data_Structure_II_Day_10_Linked_List #Level_1_Day_4_Linked_List
5-
// #2022_02_23_Time_0_ms_(100.00%)_Space_45_MB_(12.41%)
5+
// #2022_06_24_Time_0_ms_(100.00%)_Space_42.3_MB_(98.70%)
66

77
import com_github_leetcode.ListNode;
88

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

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

33
// #Medium #Two_Pointers #Stack #Linked_List #Recursion #Data_Structure_II_Day_13_Linked_List
4-
// #Programming_Skills_II_Day_14 #2022_02_23_Time_2_ms_(72.16%)_Space_55.3_MB_(5.51%)
4+
// #Programming_Skills_II_Day_14 #2022_06_24_Time_2_ms_(72.59%)_Space_55.1_MB_(5.83%)
55

66
import com_github_leetcode.ListNode;
77

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

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

33
// #Easy #Depth_First_Search #Tree #Binary_Tree #Stack #Data_Structure_I_Day_10_Tree
4-
// #2022_02_23_Time_1_ms_(42.23%)_Space_42.4_MB_(12.48%)
4+
// #2022_06_24_Time_1_ms_(48.38%)_Space_42_MB_(68.46%)
55

66
import com_github_leetcode.TreeNode;
77
import java.util.ArrayList;

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

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

33
// #Easy #Depth_First_Search #Tree #Binary_Tree #Stack #Data_Structure_I_Day_10_Tree
4-
// #2022_02_23_Time_1_ms_(42.74%)_Space_42.2_MB_(23.81%)
4+
// #2022_06_24_Time_1_ms_(49.11%)_Space_42_MB_(62.15%)
55

66
import com_github_leetcode.TreeNode;
77
import java.util.ArrayList;

‎src.save/main/java/g0101_0200/s0146_lru_cache/LRUCache.java‎

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Design #Linked_List
4-
// #Doubly_Linked_List #2022_02_23_Time_82_ms_(59.12%)_Space_124.8_MB_(63.96%)
4+
// #Doubly_Linked_List #2022_06_24_Time_87_ms_(50.80%)_Space_125.2_MB_(58.73%)
55

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

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

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

3-
// #Medium #Sorting #Linked_List #2022_02_23_Time_3_ms_(92.25%)_Space_45.8_MB_(5.45%)
3+
// #Medium #Sorting #Linked_List #2022_06_24_Time_4_ms_(90.34%)_Space_45.1_MB_(20.93%)
44

55
import com_github_leetcode.ListNode;
66
import java.util.Arrays;

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

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Linked_List
4-
// #Divide_and_Conquer #Merge_Sort #2022_02_23_Time_8_ms_(78.95%)_Space_57.2_MB_(18.69%)
4+
// #Divide_and_Conquer #Merge_Sort #2022_06_24_Time_12_ms_(85.82%)_Space_76_MB_(43.84%)
55

66
import com_github_leetcode.ListNode;
77

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

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

33
// #Hard #Top_Interview_Questions #Array #Hash_Table #Math #Geometry #Algorithm_II_Day_21_Others
4-
// #2022_02_23_Time_4_ms_(98.44%)_Space_41.3_MB_(61.51%)
4+
// #2022_06_24_Time_11_ms_(99.21%)_Space_41.5_MB_(95.53%)
55

66
public class Solution {
77
public int maxPoints(int[][] points) {

0 commit comments

Comments
 (0)