Skip to content

Commit f5913ff

Browse files
javadevjavadev
authored
Updated exec time 201-210.
1 parent 014dc9c commit f5913ff

File tree

11 files changed

+26
-34
lines changed

11 files changed

+26
-34
lines changed

‎README.md

Lines changed: 16 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -98,7 +98,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
9898
|-|-|-|-|-|-
9999
| 0141 |[Linked List Cycle](src/main/java/g0101_0200/s0141_linked_list_cycle/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List | 0 | 100.00
100100
| 0021 |[Merge Two Sorted Lists](src/main/java/g0001_0100/s0021_merge_two_sorted_lists/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion | 1 | 69.17
101-
| 0203 |[Remove Linked List Elements](src/main/java/g0201_0300/s0203_remove_linked_list_elements/Solution.java)| Easy | Linked_List, Recursion | 1 | 90.35
101+
| 0203 |[Remove Linked List Elements](src/main/java/g0201_0300/s0203_remove_linked_list_elements/Solution.java)| Easy | Linked_List, Recursion | 1 | 98.82
102102

103103
#### Day 8 Linked List
104104

@@ -450,7 +450,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
450450
|-|-|-|-|-|-
451451
| 0438 |[Find All Anagrams in a String](src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java)| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window | 8 | 87.18
452452
| 0713 |[Subarray Product Less Than K](src/main/java/g0701_0800/s0713_subarray_product_less_than_k/Solution.java)| Medium | Array, Sliding_Window | 8 | 39.00
453-
| 0209 |[Minimum Size Subarray Sum](src/main/java/g0201_0300/s0209_minimum_size_subarray_sum/Solution.java)| Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 1 | 99.98
453+
| 0209 |[Minimum Size Subarray Sum](src/main/java/g0201_0300/s0209_minimum_size_subarray_sum/Solution.java)| Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 1 | 100.00
454454

455455
#### Day 6 Breadth First Search Depth First Search
456456

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

552552
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
553553
|-|-|-|-|-|-
554-
| 0201 |[Bitwise AND of Numbers Range](src/main/java/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.java)| Medium | Bit_Manipulation | 10 | 40.99
554+
| 0201 |[Bitwise AND of Numbers Range](src/main/java/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.java)| Medium | Bit_Manipulation | 8 | 74.15
555555

556556
#### Day 20 Others
557557

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

564564
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
565565
|-|-|-|-|-|-
566-
| 0202 |[Happy Number](src/main/java/g0201_0300/s0202_happy_number/Solution.java)| Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers | 1 | 93.34
566+
| 0202 |[Happy Number](src/main/java/g0201_0300/s0202_happy_number/Solution.java)| Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers | 1 | 98.59
567567
| 0149 |[Max Points on a Line](src/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
@@ -657,7 +657,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
657657

658658
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
659659
|-|-|-|-|-|-
660-
| 0209 |[Minimum Size Subarray Sum](src/main/java/g0201_0300/s0209_minimum_size_subarray_sum/Solution.java)| Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 1 | 99.98
660+
| 0209 |[Minimum Size Subarray Sum](src/main/java/g0201_0300/s0209_minimum_size_subarray_sum/Solution.java)| Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 1 | 100.00
661661
| 0611 |[Valid Triangle Number](src/main/java/g0601_0700/s0611_valid_triangle_number/Solution.java)| Medium | Array, Sorting, Greedy, Binary_Search, Two_Pointers | 10 | 100.00
662662

663663
#### Day 2
@@ -975,7 +975,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
975975
|-|-|-|-|-|-
976976
| 1822 |[Sign of the Product of an Array](src/main/java/g1801_1900/s1822_sign_of_the_product_of_an_array/Solution.java)| Easy | Array, Math | 1 | 58.05
977977
| 1502 |[Can Make Arithmetic Progression From Sequence](src/main/java/g1501_1600/s1502_can_make_arithmetic_progression_from_sequence/Solution.java)| Easy | Array, Sorting | 4 | 14.13
978-
| 0202 |[Happy Number](src/main/java/g0201_0300/s0202_happy_number/Solution.java)| Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers | 1 | 93.34
978+
| 0202 |[Happy Number](src/main/java/g0201_0300/s0202_happy_number/Solution.java)| Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers | 1 | 98.59
979979
| 1790 |[Check if One String Swap Can Make Strings Equal](src/main/java/g1701_1800/s1790_check_if_one_string_swap_can_make_strings_equal/Solution.java)| Easy | String, Hash_Table, Counting | 0 | 100.00
980980

981981
#### Day 5 Function
@@ -1387,7 +1387,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
13871387

13881388
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
13891389
|-|-|-|-|-|-
1390-
| 0205 |[Isomorphic Strings](src/main/java/g0201_0300/s0205_isomorphic_strings/Solution.java)| Easy | String, Hash_Table | 1 | 100.00
1390+
| 0205 |[Isomorphic Strings](src/main/java/g0201_0300/s0205_isomorphic_strings/Solution.java)| Easy | String, Hash_Table | 2 | 99.97
13911391
| 0392 |[Is Subsequence](src/main/java/g0301_0400/s0392_is_subsequence/Solution.java)| Easy | String, Dynamic_Programming, Two_Pointers | 0 | 100.00
13921392

13931393
#### Day 3 Linked List
@@ -3116,16 +3116,16 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
31163116
| 0213 |[House Robber II](src/main/java/g0201_0300/s0213_house_robber_ii/Solution.java)| Medium | Array, Dynamic_Programming, Algorithm_II_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_3 | 1 | 31.05
31173117
| 0212 |[Word Search II](src/main/java/g0201_0300/s0212_word_search_ii/Solution.java)| Hard | Top_Interview_Questions, Array, String, Matrix, Backtracking, Trie | 20 | 96.11
31183118
| 0211 |[Design Add and Search Words Data Structure](src/main/java/g0201_0300/s0211_design_add_and_search_words_data_structure/WordDictionary.java)| Medium | String, Depth_First_Search, Design, Trie | 403 | 18.89
3119-
| 0210 |[Course Schedule II](src/main/java/g0201_0300/s0210_course_schedule_ii/Solution.java)| Medium | Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 7 | 74.90
3120-
| 0209 |[Minimum Size Subarray Sum](src/main/java/g0201_0300/s0209_minimum_size_subarray_sum/Solution.java)| Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window, Algorithm_II_Day_5_Sliding_Window, Binary_Search_II_Day_1 | 1 | 99.98
3121-
| 0208 |[Implement Trie (Prefix Tree)](src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie | 63 | 55.40
3122-
| 0207 |[Course Schedule](src/main/java/g0201_0300/s0207_course_schedule/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 2 | 99.76
3119+
| 0210 |[Course Schedule II](src/main/java/g0201_0300/s0210_course_schedule_ii/Solution.java)| Medium | Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 13 | 35.17
3120+
| 0209 |[Minimum Size Subarray Sum](src/main/java/g0201_0300/s0209_minimum_size_subarray_sum/Solution.java)| Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window, Algorithm_II_Day_5_Sliding_Window, Binary_Search_II_Day_1 | 1 | 100.00
3121+
| 0208 |[Implement Trie (Prefix Tree)](src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie | 34 | 99.90
3122+
| 0207 |[Course Schedule](src/main/java/g0201_0300/s0207_course_schedule/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 3 | 97.58
31233123
| 0206 |[Reverse Linked List](src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Data_Structure_I_Day_8_Linked_List, Algorithm_I_Day_10_Recursion_Backtracking, Level_1_Day_3_Linked_List | 0 | 100.00
3124-
| 0205 |[Isomorphic Strings](src/main/java/g0201_0300/s0205_isomorphic_strings/Solution.java)| Easy | String, Hash_Table, Level_1_Day_2_String | 1 | 100.00
3125-
| 0204 |[Count Primes](src/main/java/g0201_0300/s0204_count_primes/Solution.java)| Medium | Top_Interview_Questions, Array, Math, Enumeration, Number_Theory | 146 | 72.74
3126-
| 0203 |[Remove Linked List Elements](src/main/java/g0201_0300/s0203_remove_linked_list_elements/Solution.java)| Easy | Linked_List, Recursion, Data_Structure_I_Day_7_Linked_List | 1 | 90.35
3127-
| 0202 |[Happy Number](src/main/java/g0201_0300/s0202_happy_number/Solution.java)| Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers, Algorithm_II_Day_21_Others, Programming_Skills_I_Day_4_Loop | 1 | 93.34
3128-
| 0201 |[Bitwise AND of Numbers Range](src/main/java/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.java)| Medium | Bit_Manipulation, Algorithm_II_Day_19_Bit_Manipulation | 10 | 40.99
3124+
| 0205 |[Isomorphic Strings](src/main/java/g0201_0300/s0205_isomorphic_strings/Solution.java)| Easy | String, Hash_Table, Level_1_Day_2_String | 2 | 99.97
3125+
| 0204 |[Count Primes](src/main/java/g0201_0300/s0204_count_primes/Solution.java)| Medium | Top_Interview_Questions, Array, Math, Enumeration, Number_Theory | 115 | 92.82
3126+
| 0203 |[Remove Linked List Elements](src/main/java/g0201_0300/s0203_remove_linked_list_elements/Solution.java)| Easy | Linked_List, Recursion, Data_Structure_I_Day_7_Linked_List | 1 | 98.82
3127+
| 0202 |[Happy Number](src/main/java/g0201_0300/s0202_happy_number/Solution.java)| Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers, Algorithm_II_Day_21_Others, Programming_Skills_I_Day_4_Loop | 1 | 98.59
3128+
| 0201 |[Bitwise AND of Numbers Range](src/main/java/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.java)| Medium | Bit_Manipulation, Algorithm_II_Day_19_Bit_Manipulation | 8 | 74.15
31293129
| 0200 |[Number of Islands](src/main/java/g0101_0200/s0200_number_of_islands/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_1_Matrix_Related_Problems, Level_1_Day_9_Graph/BFS/DFS | 3 | 97.76
31303130
| 0199 |[Binary Tree Right Side View](src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_II_Day_16_Tree | 1 | 94.57
31313131
| 0198 |[House Robber](src/main/java/g0101_0200/s0198_house_robber/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_3 | 0 | 100.00

‎src/main/java/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.java

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

33
// #Medium #Bit_Manipulation #Algorithm_II_Day_19_Bit_Manipulation
4-
// #2022_03_04_Time_10_ms_(40.99%)_Space_44.3_MB_(27.69%)
4+
// #2022_06_28_Time_8_ms_(74.15%)_Space_44.4_MB_(39.54%)
55

66
public class Solution {
77
private static final int[] MASKS =

‎src/main/java/g0201_0300/s0202_happy_number/Solution.java

Lines changed: 1 addition & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0201_0300.s0202_happy_number;
22

33
// #Easy #Top_Interview_Questions #Hash_Table #Math #Two_Pointers #Algorithm_II_Day_21_Others
4-
// #Programming_Skills_I_Day_4_Loop #2022_03_04_Time_1_ms_(93.34%)_Space_41.4_MB_(26.37%)
4+
// #Programming_Skills_I_Day_4_Loop #2022_06_28_Time_1_ms_(98.59%)_Space_41_MB_(64.25%)
55

66
public class Solution {
77
public boolean isHappy(int n) {
@@ -25,7 +25,6 @@ public boolean isHappy(int n) {
2525
happy = true;
2626
}
2727
}
28-
2928
return happy;
3029
}
3130
}

‎src/main/java/g0201_0300/s0203_remove_linked_list_elements/Solution.java

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

33
// #Easy #Linked_List #Recursion #Data_Structure_I_Day_7_Linked_List
4-
// #2022_03_04_Time_1_ms_(90.35%)_Space_49.2_MB_(24.46%)
4+
// #2022_06_28_Time_1_ms_(98.82%)_Space_49.4_MB_(27.43%)
55

66
import com_github_leetcode.ListNode;
77

‎src/main/java/g0201_0300/s0204_count_primes/Solution.java

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

33
// #Medium #Top_Interview_Questions #Array #Math #Enumeration #Number_Theory
4-
// #2022_03_04_Time_146_ms_(72.74%)_Space_68.8_MB_(22.63%)
4+
// #2022_06_28_Time_115_ms_(92.82%)_Space_46.8_MB_(85.39%)
55

66
public class Solution {
77
public int countPrimes(int n) {

‎src/main/java/g0201_0300/s0205_isomorphic_strings/Solution.java

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

33
// #Easy #String #Hash_Table #Level_1_Day_2_String
4-
// #2022_03_04_Time_1_ms_(100.00%)_Space_42.2_MB_(50.57%)
4+
// #2022_06_28_Time_2_ms_(99.97%)_Space_43.3_MB_(32.68%)
55

66
public class Solution {
77
public boolean isIsomorphic(String s, String t) {

‎src/main/java/g0201_0300/s0206_reverse_linked_list/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 #Linked_List #Recursion
44
// #Data_Structure_I_Day_8_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking
5-
// #Level_1_Day_3_Linked_List #2022_03_04_Time_0_ms_(100.00%)_Space_43.6_MB_(5.05%)
5+
// #Level_1_Day_3_Linked_List #2022_06_28_Time_0_ms_(100.00%)_Space_43.9_MB_(7.98%)
66

77
import com_github_leetcode.ListNode;
88

‎src/main/java/g0201_0300/s0207_course_schedule/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 #Depth_First_Search
44
// #Breadth_First_Search #Graph #Topological_Sort
5-
// #2022_03_04_Time_2_ms_(99.76%)_Space_42.2_MB_(88.54%)
5+
// #2022_06_28_Time_3_ms_(97.58%)_Space_48.2_MB_(49.51%)
66

77
import java.util.ArrayList;
88

‎src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java

Lines changed: 1 addition & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0201_0300.s0208_implement_trie_prefix_tree;
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie
4-
// #2022_03_04_Time_63_ms_(55.40%)_Space_67.2_MB_(42.09%)
4+
// #2022_06_28_Time_34_ms_(99.90%)_Space_51_MB_(94.92%)
55

66
@SuppressWarnings("java:S1104")
77
public class Trie {
@@ -54,7 +54,6 @@ public boolean search(String word, TrieNode root, int idx) {
5454
startWith = false;
5555
return false;
5656
}
57-
5857
return search(word, root.children[index], idx + 1);
5958
}
6059

‎src/main/java/g0201_0300/s0209_minimum_size_subarray_sum/Solution.java

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

33
// #Medium #Array #Binary_Search #Prefix_Sum #Sliding_Window #Algorithm_II_Day_5_Sliding_Window
4-
// #Binary_Search_II_Day_1 #2022_03_04_Time_1_ms_(99.98%)_Space_44.6_MB_(39.93%)
4+
// #Binary_Search_II_Day_1 #2022_06_28_Time_1_ms_(100.00%)_Space_50.1_MB_(11.60%)
55

66
public class Solution {
77
public int minSubArrayLen(int target, int[] nums) {

‎src/main/java/g0201_0300/s0210_course_schedule_ii/Solution.java

Lines changed: 1 addition & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0201_0300.s0210_course_schedule_ii;
22

33
// #Medium #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search #Graph
4-
// #Topological_Sort #2022_03_04_Time_7_ms_(74.90%)_Space_50.1_MB_(23.04%)
4+
// #Topological_Sort #2022_06_28_Time_13_ms_(35.17%)_Space_50.7_MB_(22.84%)
55

66
import java.util.ArrayList;
77
import java.util.HashMap;
@@ -14,19 +14,16 @@ public int[] findOrder(int numCourses, int[][] prerequisites) {
1414
for (int i = 0; i < numCourses; i++) {
1515
graph.put(i, new ArrayList<>());
1616
}
17-
1817
for (int[] classes : prerequisites) {
1918
graph.get(classes[0]).add(classes[1]);
2019
}
21-
2220
List<Integer> output = new ArrayList<>();
2321
Map<Integer, Boolean> visited = new HashMap<>();
2422
for (int c : graph.keySet()) {
2523
if (dfs(c, graph, visited, output)) {
2624
return new int[0];
2725
}
2826
}
29-
3027
int[] res = new int[output.size()];
3128
for (int i = 0; i < output.size(); i++) {
3229
res[i] = output.get(i);
@@ -42,15 +39,12 @@ private boolean dfs(
4239
if (visited.containsKey(course)) {
4340
return visited.get(course);
4441
}
45-
4642
visited.put(course, true);
47-
4843
for (int c : graph.get(course)) {
4944
if (dfs(c, graph, visited, output)) {
5045
return true;
5146
}
5247
}
53-
5448
visited.put(course, false);
5549
output.add(course);
5650
return false;

0 commit comments

Comments
 (0)