Skip to content

Commit 2542732

Browse files
javadevjavadev
authored
Updated exec time 131-140.
1 parent c2209cd commit 2542732

File tree

11 files changed

+23
-23
lines changed

11 files changed

+23
-23
lines changed

‎README.md‎

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

159159
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
160160
|-|-|-|-|-|-
161-
| 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 | 2 | 58.97
161+
| 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
162162
| 0169 |[Majority Element](src.save/main/java/g0101_0200/s0169_majority_element/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer | 2 | 83.81
163163
| 0015 |[3Sum](src.save/main/java/g0001_0100/s0015_3sum/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers | 28 | 71.04
164164

@@ -410,7 +410,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
410410
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
411411
|-|-|-|-|-|-
412412
| 0190 |[Reverse Bits](src.save/main/java/g0101_0200/s0190_reverse_bits/Solution.java)| Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer | 1 | 89.07
413-
| 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 | 2 | 58.97
413+
| 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
414414

415415
### Algorithm II
416416

@@ -523,7 +523,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
523523
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
524524
|-|-|-|-|-|-
525525
| 0091 |[Decode Ways](src.save/main/java/g0001_0100/s0091_decode_ways/Solution.java)| Medium | Top_Interview_Questions, String, Dynamic_Programming | 2 | 66.37
526-
| 0139 |[Word Break](src.save/main/java/g0101_0200/s0139_word_break/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization | 2 | 96.55
526+
| 0139 |[Word Break](src.save/main/java/g0101_0200/s0139_word_break/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization | 2 | 97.08
527527

528528
#### Day 16 Dynamic Programming
529529

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

858858
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
859859
|-|-|-|-|-|-
860-
| 0139 |[Word Break](src.save/main/java/g0101_0200/s0139_word_break/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization | 2 | 96.55
860+
| 0139 |[Word Break](src.save/main/java/g0101_0200/s0139_word_break/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization | 2 | 97.08
861861
| 0042 |[Trapping Rain Water](src.save/main/java/g0001_0100/s0042_trapping_rain_water/Solution.java)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack | 1 | 98.06
862862

863863
#### Day 10
@@ -3174,16 +3174,16 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
31743174
| 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
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
3177-
| 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 | 95.98
3178-
| 0139 |[Word Break](src.save/main/java/g0101_0200/s0139_word_break/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Algorithm_II_Day_15_Dynamic_Programming, Dynamic_Programming_I_Day_9 | 2 | 96.55
3177+
| 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
3178+
| 0139 |[Word Break](src.save/main/java/g0101_0200/s0139_word_break/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Algorithm_II_Day_15_Dynamic_Programming, Dynamic_Programming_I_Day_9 | 2 | 97.08
31793179
| 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, Programming_Skills_II_Day_14 | 0 | 100.00
3180-
| 0137 |[Single Number II](src.save/main/java/g0101_0200/s0137_single_number_ii/Solution.java)| Medium | Array, Bit_Manipulation | 1 | 91.46
3181-
| 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, Data_Structure_II_Day_1_Array, Algorithm_I_Day_14_Bit_Manipulation | 2 | 58.97
3182-
| 0135 |[Candy](src.save/main/java/g0101_0200/s0135_candy/Solution.java)| Hard | Array, Greedy | 3 | 76.49
3183-
| 0134 |[Gas Station](src.save/main/java/g0101_0200/s0134_gas_station/Solution.java)| Medium | Top_Interview_Questions, Array, Greedy | 3 | 61.54
3184-
| 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
3185-
| 0132 |[Palindrome Partitioning II](src.save/main/java/g0101_0200/s0132_palindrome_partitioning_ii/Solution.java)| Hard | String, Dynamic_Programming | 2 | 99.72
3186-
| 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
3180+
| 0137 |[Single Number II](src.save/main/java/g0101_0200/s0137_single_number_ii/Solution.java)| Medium | Array, Bit_Manipulation | 0 | 100.00
3181+
| 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, Data_Structure_II_Day_1_Array, Algorithm_I_Day_14_Bit_Manipulation | 1 | 99.97
3182+
| 0135 |[Candy](src.save/main/java/g0101_0200/s0135_candy/Solution.java)| Hard | Array, Greedy | 2 | 99.95
3183+
| 0134 |[Gas Station](src.save/main/java/g0101_0200/s0134_gas_station/Solution.java)| Medium | Top_Interview_Questions, Array, Greedy | 2 | 94.26
3184+
| 0133 |[Clone Graph](src.save/main/java/g0101_0200/s0133_clone_graph/Solution.java)| Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Graph | 45 | 29.80
3185+
| 0132 |[Palindrome Partitioning II](src.save/main/java/g0101_0200/s0132_palindrome_partitioning_ii/Solution.java)| Hard | String, Dynamic_Programming | 2 | 99.89
3186+
| 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 | 16 | 65.63
31873187
| 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
31893189
| 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

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

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
4-
// #Backtracking #2022_02_22_Time_19_ms_(53.74%)_Space_194.8_MB_(9.14%)
4+
// #Backtracking #2022_06_24_Time_16_ms_(65.63%)_Space_194.3_MB_(37.65%)
55

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

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

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

3-
// #Hard #String #Dynamic_Programming #2022_02_22_Time_2_ms_(99.72%)_Space_41.7_MB_(75.39%)
3+
// #Hard #String #Dynamic_Programming #2022_06_24_Time_2_ms_(99.89%)_Space_42.1_MB_(81.48%)
44

55
import java.util.Arrays;
66

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

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

33
// #Medium #Hash_Table #Depth_First_Search #Breadth_First_Search #Graph
4-
// #2022_02_22_Time_55_ms_(16.92%)_Space_43.2_MB_(24.32%)
4+
// #2022_06_24_Time_45_ms_(29.80%)_Space_42.7_MB_(77.96%)
55

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

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

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

33
// #Medium #Top_Interview_Questions #Array #Greedy
4-
// #2022_02_22_Time_3_ms_(61.54%)_Space_81.3_MB_(7.19%)
4+
// #2022_06_24_Time_2_ms_(94.26%)_Space_62.5_MB_(87.11%)
55

66
public class Solution {
77
public int canCompleteCircuit(int[] gas, int[] cost) {

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

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

3-
// #Hard #Array #Greedy #2022_02_22_Time_3_ms_(76.49%)_Space_51.4_MB_(28.53%)
3+
// #Hard #Array #Greedy #2022_06_24_Time_2_ms_(99.95%)_Space_42.8_MB_(94.28%)
44

55
import java.util.Arrays;
66

‎src.save/main/java/g0101_0200/s0136_single_number/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 #Bit_Manipulation
44
// #Data_Structure_II_Day_1_Array #Algorithm_I_Day_14_Bit_Manipulation
5-
// #2022_02_22_Time_2_ms_(58.97%)_Space_50.1_MB_(53.89%)
5+
// #2022_06_24_Time_1_ms_(99.97%)_Space_50.9_MB_(35.58%)
66

77
public class Solution {
88
public int singleNumber(int[] nums) {

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

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

3-
// #Medium #Array #Bit_Manipulation #2022_02_22_Time_1_ms_(91.46%)_Space_43.6_MB_(37.14%)
3+
// #Medium #Array #Bit_Manipulation #2022_06_24_Time_0_ms_(100.00%)_Space_42.1_MB_(84.59%)
44

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

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

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Linked_List
4-
// #Programming_Skills_II_Day_14 #2022_02_22_Time_0_ms_(100.00%)_Space_41.7_MB_(78.31%)
4+
// #Programming_Skills_II_Day_14 #2022_06_24_Time_0_ms_(100.00%)_Space_45.5_MB_(56.49%)
55

66
import com_github_leetcode.random.Node;
77

‎src.save/main/java/g0101_0200/s0139_word_break/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 #Top_Interview_Questions #String #Hash_Table
44
// #Dynamic_Programming #Trie #Memoization #Algorithm_II_Day_15_Dynamic_Programming
5-
// #Dynamic_Programming_I_Day_9 #2022_02_22_Time_2_ms_(96.55%)_Space_42.2_MB_(63.03%)
5+
// #Dynamic_Programming_I_Day_9 #2022_06_24_Time_2_ms_(97.08%)_Space_42.1_MB_(90.92%)
66

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

0 commit comments

Comments
 (0)