Skip to content

Commit 436a24c

Browse files
javadevjavadev
authored
Updated exec time 434-446.
1 parent 4682984 commit 436a24c

File tree

12 files changed

+48
-46
lines changed

12 files changed

+48
-46
lines changed

‎README.md‎

Lines changed: 19 additions & 19 deletions
Original file line numberDiff line numberDiff line change
@@ -80,7 +80,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
8080
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
8181
|-|-|-|-|-|-
8282
| 0240 |[Search a 2D Matrix II](src.save/main/java/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer | 7 | 86.73
83-
| 0435 |[Non-overlapping Intervals](src.save/main/java/g0401_0500/s0435_non_overlapping_intervals/Solution.java)| Medium | Array, Dynamic_Programming, Sorting, Greedy | 109 | 26.80
83+
| 0435 |[Non-overlapping Intervals](src.save/main/java/g0401_0500/s0435_non_overlapping_intervals/Solution.java)| Medium | Array, Dynamic_Programming, Sorting, Greedy | 96 | 47.37
8484

8585
#### Day 5 Array
8686

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

346346
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
347347
|-|-|-|-|-|-
348-
| 0438 |[Find All Anagrams in a String](src.save/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
348+
| 0438 |[Find All Anagrams in a String](src.save/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java)| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window | 6 | 99.03
349349
| 0713 |[Subarray Product Less Than K](src.save/main/java/g0701_0800/s0713_subarray_product_less_than_k/Solution.java)| Medium | Array, Sliding_Window | 8 | 39.00
350350
| 0209 |[Minimum Size Subarray Sum](src.save/main/java/g0201_0300/s0209_minimum_size_subarray_sum/Solution.java)| Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 1 | 100.00
351351

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

505505
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
506506
|-|-|-|-|-|-
507-
| 0441 |[Arranging Coins](src.save/main/java/g0401_0500/s0441_arranging_coins/Solution.java)| Easy | Math, Binary_Search | 2 | 87.99
507+
| 0441 |[Arranging Coins](src.save/main/java/g0401_0500/s0441_arranging_coins/Solution.java)| Easy | Math, Binary_Search | 2 | 95.97
508508
| 1539 |[Kth Missing Positive Number](src.save/main/java/g1501_1600/s1539_kth_missing_positive_number/Solution.java)| Easy | Array, Binary_Search | 0 | 100.00
509509

510510
#### Day 7
@@ -625,7 +625,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
625625
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
626626
|-|-|-|-|-|-
627627
| 0826 |[Most Profit Assigning Work](src.save/main/java/g0801_0900/s0826_most_profit_assigning_work/Solution.java)| Medium | Array, Sorting, Greedy, Binary_Search, Two_Pointers | 21 | 83.83
628-
| 0436 |[Find Right Interval](src.save/main/java/g0401_0500/s0436_find_right_interval/Solution.java)| Medium | Array, Sorting, Binary_Search | 17 | 87.90
628+
| 0436 |[Find Right Interval](src.save/main/java/g0401_0500/s0436_find_right_interval/Solution.java)| Medium | Array, Sorting, Binary_Search | 20 | 81.51
629629

630630
#### Day 12
631631

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

10231023
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
10241024
|-|-|-|-|-|-
1025-
| 0438 |[Find All Anagrams in a String](src.save/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
1025+
| 0438 |[Find All Anagrams in a String](src.save/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java)| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window | 6 | 99.03
10261026
| 0713 |[Subarray Product Less Than K](src.save/main/java/g0701_0800/s0713_subarray_product_less_than_k/Solution.java)| Medium | Array, Sliding_Window | 8 | 39.00
10271027

10281028
#### Day 13
@@ -1044,7 +1044,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
10441044
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
10451045
|-|-|-|-|-|-
10461046
| 0002 |[Add Two Numbers](src.save/main/java/g0001_0100/s0002_add_two_numbers/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion | 2 | 98.23
1047-
| 0445 |[Add Two Numbers II](src.save/main/java/g0401_0500/s0445_add_two_numbers_ii/Solution.java)| Medium | Math, Stack, Linked_List | 3 | 81.96
1047+
| 0445 |[Add Two Numbers II](src.save/main/java/g0401_0500/s0445_add_two_numbers_ii/Solution.java)| Medium | Math, Stack, Linked_List | 3 | 90.38
10481048

10491049
#### Day 16
10501050

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

13551355
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
13561356
|-|-|-|-|-|-
1357-
| 0438 |[Find All Anagrams in a String](src.save/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
1357+
| 0438 |[Find All Anagrams in a String](src.save/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java)| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window | 6 | 99.03
13581358
| 0424 |[Longest Repeating Character Replacement](src.save/main/java/g0401_0500/s0424_longest_repeating_character_replacement/Solution.java)| Medium | String, Hash_Table, Sliding_Window | 5 | 95.15
13591359

13601360
#### Day 13 Hashmap
@@ -1428,7 +1428,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
14281428
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
14291429
|-|-|-|-|-|-
14301430
| 0543 |[Diameter of Binary Tree](src.save/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree | 1 | 55.16
1431-
| 0437 |[Path Sum III](src.save/main/java/g0401_0500/s0437_path_sum_iii/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree | 4 | 87.75
1431+
| 0437 |[Path Sum III](src.save/main/java/g0401_0500/s0437_path_sum_iii/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree | 18 | 45.66
14321432

14331433
#### Day 8 Binary Search
14341434

@@ -1581,7 +1581,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
15811581
| 0238 |[Product of Array Except Self](src.save/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Prefix_Sum | 1 | 100.00
15821582
| 1291 |[Sequential Digits](src.save/main/java/g1201_1300/s1291_sequential_digits/Solution.java)| Medium | Enumeration | 0 | 100.00
15831583
| 0448 |[Find All Numbers Disappeared in an Array](src.save/main/java/g0401_0500/s0448_find_all_numbers_disappeared_in_an_array/Solution.java)| Easy | Array, Hash_Table | 3 | 100.00
1584-
| 0442 |[Find All Duplicates in an Array](src.save/main/java/g0401_0500/s0442_find_all_duplicates_in_an_array/Solution.java)| Medium | Array, Hash_Table | 5 | 94.88
1584+
| 0442 |[Find All Duplicates in an Array](src.save/main/java/g0401_0500/s0442_find_all_duplicates_in_an_array/Solution.java)| Medium | Array, Hash_Table | 5 | 98.83
15851585
| 0041 |[First Missing Positive](src.save/main/java/g0001_0100/s0041_first_missing_positive/Solution.java)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table | 5 | 50.34
15861586
| 0697 |[Degree of an Array](src.save/main/java/g0601_0700/s0697_degree_of_an_array/Solution.java)| Easy | Array, Hash_Table | 14 | 93.19
15871587
| 0532 |[K-diff Pairs in an Array](src.save/main/java/g0501_0600/s0532_k_diff_pairs_in_an_array/Solution.java)| Medium | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 14 | 49.69
@@ -1632,7 +1632,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
16321632
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
16331633
|-|-|-|-|-|-
16341634
| 0114 |[Flatten Binary Tree to Linked List](src.save/main/java/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List | 1 | 75.27
1635-
| 0445 |[Add Two Numbers II](src.save/main/java/g0401_0500/s0445_add_two_numbers_ii/Solution.java)| Medium | Math, Stack, Linked_List | 3 | 81.96
1635+
| 0445 |[Add Two Numbers II](src.save/main/java/g0401_0500/s0445_add_two_numbers_ii/Solution.java)| Medium | Math, Stack, Linked_List | 3 | 90.38
16361636
| 0328 |[Odd Even Linked List](src.save/main/java/g0301_0400/s0328_odd_even_linked_list/Solution.java)| Medium | Top_Interview_Questions, Linked_List | 0 | 100.00
16371637
| 0061 |[Rotate List](src.save/main/java/g0001_0100/s0061_rotate_list/Solution.java)| Medium | Two_Pointers, Linked_List | 0 | 100.00
16381638
| 0024 |[Swap Nodes in Pairs](src.save/main/java/g0001_0100/s0024_swap_nodes_in_pairs/Solution.java)| Medium | Top_100_Liked_Questions, Linked_List, Recursion | 0 | 100.00
@@ -3331,16 +3331,16 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
33313331
| 0449 |[Serialize and Deserialize BST](src.save/main/java/g0401_0500/s0449_serialize_and_deserialize_bst/Codec.java)| Medium | String, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design, Binary_Search_Tree | 1 | 99.70
33323332
| 0448 |[Find All Numbers Disappeared in an Array](src.save/main/java/g0401_0500/s0448_find_all_numbers_disappeared_in_an_array/Solution.java)| Easy | Array, Hash_Table, Udemy_Arrays | 3 | 100.00
33333333
| 0447 |[Number of Boomerangs](src.save/main/java/g0401_0500/s0447_number_of_boomerangs/Solution.java)| Medium | Array, Hash_Table, Math | 156 | 80.44
3334-
| 0446 |[Arithmetic Slices II - Subsequence](src.save/main/java/g0401_0500/s0446_arithmetic_slices_ii_subsequence/Solution.java)| Hard | Array, Dynamic_Programming | 67 | 95.78
3335-
| 0445 |[Add Two Numbers II](src.save/main/java/g0401_0500/s0445_add_two_numbers_ii/Solution.java)| Medium | Math, Stack, Linked_List, Programming_Skills_II_Day_15, Udemy_Linked_List | 3 | 81.96
3336-
| 0443 |[String Compression](src.save/main/java/g0401_0500/s0443_string_compression/Solution.java)| Medium | String, Two_Pointers | 2 | 60.36
3337-
| 0442 |[Find All Duplicates in an Array](src.save/main/java/g0401_0500/s0442_find_all_duplicates_in_an_array/Solution.java)| Medium | Array, Hash_Table, Udemy_Arrays | 5 | 94.88
3338-
| 0441 |[Arranging Coins](src.save/main/java/g0401_0500/s0441_arranging_coins/Solution.java)| Easy | Math, Binary_Search, Binary_Search_I_Day_6 | 2 | 87.99
3334+
| 0446 |[Arithmetic Slices II - Subsequence](src.save/main/java/g0401_0500/s0446_arithmetic_slices_ii_subsequence/Solution.java)| Hard | Array, Dynamic_Programming | 68 | 99.15
3335+
| 0445 |[Add Two Numbers II](src.save/main/java/g0401_0500/s0445_add_two_numbers_ii/Solution.java)| Medium | Math, Stack, Linked_List, Programming_Skills_II_Day_15, Udemy_Linked_List | 3 | 90.38
3336+
| 0443 |[String Compression](src.save/main/java/g0401_0500/s0443_string_compression/Solution.java)| Medium | String, Two_Pointers | 2 | 65.35
3337+
| 0442 |[Find All Duplicates in an Array](src.save/main/java/g0401_0500/s0442_find_all_duplicates_in_an_array/Solution.java)| Medium | Array, Hash_Table, Udemy_Arrays | 5 | 98.83
3338+
| 0441 |[Arranging Coins](src.save/main/java/g0401_0500/s0441_arranging_coins/Solution.java)| Easy | Math, Binary_Search, Binary_Search_I_Day_6 | 2 | 95.97
33393339
| 0440 |[K-th Smallest in Lexicographical Order](src.save/main/java/g0401_0500/s0440_k_th_smallest_in_lexicographical_order/Solution.java)| Hard | Trie | 0 | 100.00
3340-
| 0438 |[Find All Anagrams in a String](src.save/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java)| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Algorithm_II_Day_5_Sliding_Window, Programming_Skills_II_Day_12, Level_1_Day_12_Sliding_Window/Two_Pointer | 8 | 87.18
3341-
| 0437 |[Path Sum III](src.save/main/java/g0401_0500/s0437_path_sum_iii/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Level_2_Day_7_Tree | 4 | 87.75
3342-
| 0436 |[Find Right Interval](src.save/main/java/g0401_0500/s0436_find_right_interval/Solution.java)| Medium | Array, Sorting, Binary_Search, Binary_Search_II_Day_11 | 17 | 87.90
3343-
| 0435 |[Non-overlapping Intervals](src.save/main/java/g0401_0500/s0435_non_overlapping_intervals/Solution.java)| Medium | Array, Dynamic_Programming, Sorting, Greedy, Data_Structure_II_Day_4_Array | 109 | 26.80
3340+
| 0438 |[Find All Anagrams in a String](src.save/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java)| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Algorithm_II_Day_5_Sliding_Window, Programming_Skills_II_Day_12, Level_1_Day_12_Sliding_Window/Two_Pointer | 6 | 99.03
3341+
| 0437 |[Path Sum III](src.save/main/java/g0401_0500/s0437_path_sum_iii/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Level_2_Day_7_Tree | 18 | 45.66
3342+
| 0436 |[Find Right Interval](src.save/main/java/g0401_0500/s0436_find_right_interval/Solution.java)| Medium | Array, Sorting, Binary_Search, Binary_Search_II_Day_11 | 20 | 81.51
3343+
| 0435 |[Non-overlapping Intervals](src.save/main/java/g0401_0500/s0435_non_overlapping_intervals/Solution.java)| Medium | Array, Dynamic_Programming, Sorting, Greedy, Data_Structure_II_Day_4_Array | 96 | 47.37
33443344
| 0434 |[Number of Segments in a String](src.save/main/java/g0401_0500/s0434_number_of_segments_in_a_string/Solution.java)| Easy | String | 0 | 100.00
33453345
| 0433 |[Minimum Genetic Mutation](src.save/main/java/g0401_0500/s0433_minimum_genetic_mutation/Solution.java)| Medium | String, Hash_Table, Breadth_First_Search, Graph_Theory_I_Day_12_Breadth_First_Search | 1 | 90.95
33463346
| 0432 |[All O\`one Data Structure](src.save/main/java/g0401_0500/s0432_all_oone_data_structure/AllOne.java)| Hard | Hash_Table, Design, Linked_List, Doubly_Linked_List | 101 | 52.51

‎src.save/main/java/g0401_0500/s0434_number_of_segments_in_a_string/Solution.java‎

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

3-
// #Easy #String #2022_03_18_Time_0_ms_(100.00%)_Space_42.2_MB_(19.22%)
3+
// #Easy #String #2022_07_16_Time_0_ms_(100.00%)_Space_42.5_MB_(5.49%)
44

55
public class Solution {
66
public int countSegments(String s) {

‎src.save/main/java/g0401_0500/s0435_non_overlapping_intervals/Solution.java‎

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

33
// #Medium #Array #Dynamic_Programming #Sorting #Greedy #Data_Structure_II_Day_4_Array
4-
// #2022_03_18_Time_109_ms_(26.80%)_Space_100.2_MB_(64.71%)
4+
// #2022_07_16_Time_96_ms_(47.37%)_Space_106.6_MB_(6.15%)
55

66
import java.util.Arrays;
77

‎src.save/main/java/g0401_0500/s0436_find_right_interval/Solution.java‎

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

33
// #Medium #Array #Sorting #Binary_Search #Binary_Search_II_Day_11
4-
// #2022_03_18_Time_17_ms_(87.90%)_Space_57.9_MB_(8.42%)
4+
// #2022_07_16_Time_20_ms_(81.51%)_Space_59.1_MB_(5.83%)
55

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

‎src.save/main/java/g0401_0500/s0437_path_sum_iii/Solution.java‎

Lines changed: 19 additions & 17 deletions
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,9 @@
11
package g0401_0500.s0437_path_sum_iii;
22

33
// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree
4-
// #2022_03_18_Time_4_ms_(87.75%)_Space_44.5_MB_(27.82%)
4+
// #2022_07_16_Time_18_ms_(45.66%)_Space_42_MB_(88.96%)
55

66
import com_github_leetcode.TreeNode;
7-
import java.util.HashMap;
8-
import java.util.Map;
97

108
/*
119
* Definition for a binary tree node.
@@ -23,24 +21,28 @@
2321
* }
2422
*/
2523
public class Solution {
26-
private int count(TreeNode root, int targetSum, Map<Integer, Integer> hashMap, int currentSum) {
24+
private int count = 0;
25+
26+
public int pathSum(TreeNode root, int targetSum) {
2727
if (root == null) {
2828
return 0;
2929
}
30-
int count = 0;
31-
if (hashMap.containsKey(currentSum + root.val - targetSum)) {
32-
count = count + hashMap.get(currentSum + root.val - targetSum);
33-
}
34-
hashMap.put(currentSum + root.val, hashMap.getOrDefault(currentSum + root.val, 0) + 1);
35-
int l1 = count(root.left, targetSum, hashMap, currentSum + root.val);
36-
int l2 = count(root.right, targetSum, hashMap, currentSum + root.val);
37-
hashMap.put(currentSum + root.val, hashMap.getOrDefault(currentSum + root.val, 0) - 1);
38-
return l1 + l2 + count;
30+
helper(root, targetSum, 0);
31+
pathSum(root.left, targetSum);
32+
pathSum(root.right, targetSum);
33+
return count;
3934
}
4035

41-
public int pathSum(TreeNode root, int targetSum) {
42-
Map<Integer, Integer> map = new HashMap<>();
43-
map.put(0, 1);
44-
return count(root, targetSum, map, 0);
36+
public void helper(TreeNode node, int targetSum, long currSum) {
37+
currSum += node.val;
38+
if (targetSum == currSum) {
39+
count++;
40+
}
41+
if (node.left != null) {
42+
helper(node.left, targetSum, currSum);
43+
}
44+
if (node.right != null) {
45+
helper(node.right, targetSum, currSum);
46+
}
4547
}
4648
}

‎src.save/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/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 #String #Hash_Table #Sliding_Window
44
// #Algorithm_II_Day_5_Sliding_Window #Programming_Skills_II_Day_12
5-
// #Level_1_Day_12_Sliding_Window/Two_Pointer #2022_03_18_Time_8_ms_(87.18%)_Space_48_MB_(43.23%)
5+
// #Level_1_Day_12_Sliding_Window/Two_Pointer #2022_07_16_Time_6_ms_(99.03%)_Space_47.9_MB_(50.50%)
66

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

‎src.save/main/java/g0401_0500/s0440_k_th_smallest_in_lexicographical_order/Solution.java‎

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

3-
// #Hard #Trie #2022_03_18_Time_0_ms_(100.00%)_Space_40.9_MB_(43.33%)
3+
// #Hard #Trie #2022_07_16_Time_0_ms_(100.00%)_Space_40.7_MB_(63.75%)
44

55
public class Solution {
66
public int findKthNumber(int n, int k) {

‎src.save/main/java/g0401_0500/s0441_arranging_coins/Solution.java‎

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

33
// #Easy #Math #Binary_Search #Binary_Search_I_Day_6
4-
// #2022_03_18_Time_2_ms_(87.99%)_Space_41.6_MB_(30.85%)
4+
// #2022_07_16_Time_2_ms_(95.97%)_Space_41.8_MB_(28.06%)
55

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

‎src.save/main/java/g0401_0500/s0442_find_all_duplicates_in_an_array/Solution.java‎

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

3-
// #Medium #Array #Hash_Table #Udemy_Arrays #2022_03_18_Time_5_ms_(94.88%)_Space_70.2_MB_(16.76%)
3+
// #Medium #Array #Hash_Table #Udemy_Arrays #2022_07_16_Time_5_ms_(98.83%)_Space_68.3_MB_(25.16%)
44

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

‎src.save/main/java/g0401_0500/s0443_string_compression/Solution.java‎

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

3-
// #Medium #String #Two_Pointers #2022_03_18_Time_2_ms_(60.36%)_Space_45_MB_(7.26%)
3+
// #Medium #String #Two_Pointers #2022_07_16_Time_2_ms_(65.35%)_Space_44.8_MB_(14.78%)
44

55
public class Solution {
66
/* This is breaking the rules, it's not in-place. */

0 commit comments

Comments
 (0)