Skip to content

Commit 0d138a3

Browse files
javadevjavadev
authored
Updated exec time 459-470.
1 parent ca9adae commit 0d138a3

File tree

11 files changed

+29
-22
lines changed

11 files changed

+29
-22
lines changed

‎README.md‎

Lines changed: 12 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -953,7 +953,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
953953
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
954954
|-|-|-|-|-|-
955955
| 0110 |[Balanced Binary Tree](src/main/java/g0101_0200/s0110_balanced_binary_tree/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree | 1 | 98.82
956-
| 0459 |[Repeated Substring Pattern](src/main/java/g0401_0500/s0459_repeated_substring_pattern/Solution.java)| Easy | String, String_Matching | 9 | 90.15
956+
| 0459 |[Repeated Substring Pattern](src/main/java/g0401_0500/s0459_repeated_substring_pattern/Solution.java)| Easy | String, String_Matching | 8 | 96.64
957957

958958
#### Day 3
959959

@@ -1727,7 +1727,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
17271727
| 0191 |[Number of 1 Bits](src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java)| Easy | Top_Interview_Questions, Bit_Manipulation | 1 | 84.87
17281728
| 0389 |[Find the Difference](src/main/java/g0301_0400/s0389_find_the_difference/Solution.java)| Easy | String, Hash_Table, Sorting, Bit_Manipulation | 1 | 100.00
17291729
| 0190 |[Reverse Bits](src/main/java/g0101_0200/s0190_reverse_bits/Solution.java)| Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer | 1 | 98.66
1730-
| 0461 |[Hamming Distance](src/main/java/g0401_0500/s0461_hamming_distance/Solution.java)| Easy | Bit_Manipulation | 1 | 39.19
1730+
| 0461 |[Hamming Distance](src/main/java/g0401_0500/s0461_hamming_distance/Solution.java)| Easy | Bit_Manipulation | 0 | 100.00
17311731
| 1009 |[Complement of Base 10 Integer](src/main/java/g1001_1100/s1009_complement_of_base_10_integer/Solution.java)| Easy | Bit_Manipulation | 1 | 41.56
17321732
| 0338 |[Counting Bits](src/main/java/g0301_0400/s0338_counting_bits/Solution.java)| Easy | Top_100_Liked_Questions, Dynamic_Programming, Bit_Manipulation | 2 | 86.73
17331733
| 0371 |[Sum of Two Integers](src/main/java/g0301_0400/s0371_sum_of_two_integers/Solution.java)| Medium | Top_Interview_Questions, Math, Bit_Manipulation | 0 | 100.00
@@ -1849,7 +1849,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
18491849
| # | Title | Difficulty | Tag | Time, ms | Time, %
18501850
|------|----------------|-------------|-------------|----------|---------
18511851
| 2344 |[Minimum Deletions to Make Array Divisible](src/main/java/g2301_2400/s2344_minimum_deletions_to_make_array_divisible/Solution.java)| Hard || 13 | 88.89
1852-
| 2343 |[Query Kth Smallest Trimmed Number](src/main/java/g2301_2400/s2343_query_kth_smallest_trimmed_number/Solution.java)| Medium || 61 | 75.00
1852+
| 2343 |[Query Kth Smallest Trimmed Number](src/main/java/g2301_2400/s2343_query_kth_smallest_trimmed_number/Solution.java)| Medium || 52 | 75.00
18531853
| 2342 |[Max Sum of a Pair With Equal Sum of Digits](src/main/java/g2301_2400/s2342_max_sum_of_a_pair_with_equal_sum_of_digits/Solution.java)| Medium || 99 | 100.00
18541854
| 2341 |[Maximum Number of Pairs in Array](src/main/java/g2301_2400/s2341_maximum_number_of_pairs_in_array/Solution.java)| Easy || 2 | 80.00
18551855
| 2338 |[Count the Number of Ideal Arrays](src/main/java/g2301_2400/s2338_count_the_number_of_ideal_arrays/Solution.java)| Hard | Math, Dynamic_Programming, Combinatorics, Number_Theory | 21 | 99.04
@@ -3313,16 +3313,16 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
33133313
| 0474 |[Ones and Zeroes](src/main/java/g0401_0500/s0474_ones_and_zeroes/Solution.java)| Medium | Array, String, Dynamic_Programming | 41 | 68.79
33143314
| 0473 |[Matchsticks to Square](src/main/java/g0401_0500/s0473_matchsticks_to_square/Solution.java)| Medium | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 161 | 55.12
33153315
| 0472 |[Concatenated Words](src/main/java/g0401_0500/s0472_concatenated_words/Solution.java)| Hard | Array, String, Dynamic_Programming, Depth_First_Search, Trie | 84 | 79.03
3316-
| 0470 |[Implement Rand10() Using Rand7()](src/main/java/g0401_0500/s0470_implement_rand10_using_rand7/Solution.java)| Medium | Math, Randomized, Probability_and_Statistics, Rejection_Sampling | 10 | 51.04
3317-
| 0468 |[Validate IP Address](src/main/java/g0401_0500/s0468_validate_ip_address/Solution.java)| Medium | String | 1 | 98.15
3318-
| 0467 |[Unique Substrings in Wraparound String](src/main/java/g0401_0500/s0467_unique_substrings_in_wraparound_string/Solution.java)| Medium | String, Dynamic_Programming | 5 | 88.61
3316+
| 0470 |[Implement Rand10() Using Rand7()](src/main/java/g0401_0500/s0470_implement_rand10_using_rand7/Solution.java)| Medium | Math, Randomized, Probability_and_Statistics, Rejection_Sampling | 8 | 82.15
3317+
| 0468 |[Validate IP Address](src/main/java/g0401_0500/s0468_validate_ip_address/Solution.java)| Medium | String | 2 | 73.87
3318+
| 0467 |[Unique Substrings in Wraparound String](src/main/java/g0401_0500/s0467_unique_substrings_in_wraparound_string/Solution.java)| Medium | String, Dynamic_Programming | 4 | 98.79
33193319
| 0466 |[Count The Repetitions](src/main/java/g0401_0500/s0466_count_the_repetitions/Solution.java)| Hard | String, Dynamic_Programming | 1 | 100.00
3320-
| 0464 |[Can I Win](src/main/java/g0401_0500/s0464_can_i_win/Solution.java)| Medium | Dynamic_Programming, Math, Bit_Manipulation, Bitmask, Memoization, Game_Theory | 159 | 84.80
3321-
| 0463 |[Island Perimeter](src/main/java/g0401_0500/s0463_island_perimeter/Solution.java)| Easy | Array, Depth_First_Search, Breadth_First_Search, Matrix | 9 | 74.15
3322-
| 0462 |[Minimum Moves to Equal Array Elements II](src/main/java/g0401_0500/s0462_minimum_moves_to_equal_array_elements_ii/Solution.java)| Medium | Array, Math, Sorting | 3 | 94.38
3323-
| 0461 |[Hamming Distance](src/main/java/g0401_0500/s0461_hamming_distance/Solution.java)| Easy | Bit_Manipulation, Udemy_Bit_Manipulation | 1 | 39.19
3324-
| 0460 |[LFU Cache](src/main/java/g0401_0500/s0460_lfu_cache/LFUCache.java)| Hard | Hash_Table, Design, Linked_List, Doubly_Linked_List | 45 | 99.66
3325-
| 0459 |[Repeated Substring Pattern](src/main/java/g0401_0500/s0459_repeated_substring_pattern/Solution.java)| Easy | String, String_Matching, Programming_Skills_II_Day_2 | 9 | 90.15
3320+
| 0464 |[Can I Win](src/main/java/g0401_0500/s0464_can_i_win/Solution.java)| Medium | Dynamic_Programming, Math, Bit_Manipulation, Bitmask, Memoization, Game_Theory | 138 | 90.47
3321+
| 0463 |[Island Perimeter](src/main/java/g0401_0500/s0463_island_perimeter/Solution.java)| Easy | Array, Depth_First_Search, Breadth_First_Search, Matrix | 9 | 81.80
3322+
| 0462 |[Minimum Moves to Equal Array Elements II](src/main/java/g0401_0500/s0462_minimum_moves_to_equal_array_elements_ii/Solution.java)| Medium | Array, Math, Sorting | 7 | 31.31
3323+
| 0461 |[Hamming Distance](src/main/java/g0401_0500/s0461_hamming_distance/Solution.java)| Easy | Bit_Manipulation, Udemy_Bit_Manipulation | 0 | 100.00
3324+
| 0460 |[LFU Cache](src/main/java/g0401_0500/s0460_lfu_cache/LFUCache.java)| Hard | Hash_Table, Design, Linked_List, Doubly_Linked_List | 86 | 81.25
3325+
| 0459 |[Repeated Substring Pattern](src/main/java/g0401_0500/s0459_repeated_substring_pattern/Solution.java)| Easy | String, String_Matching, Programming_Skills_II_Day_2 | 8 | 96.64
33263326
| 0458 |[Poor Pigs](src/main/java/g0401_0500/s0458_poor_pigs/Solution.java)| Hard | Dynamic_Programming, Math, Combinatorics | 0 | 100.00
33273327
| 0457 |[Circular Array Loop](src/main/java/g0401_0500/s0457_circular_array_loop/Solution.java)| Medium | Array, Hash_Table, Two_Pointers | 1 | 83.72
33283328
| 0456 |[132 Pattern](src/main/java/g0401_0500/s0456_132_pattern/Solution.java)| Medium | Array, Binary_Search, Stack, Ordered_Set, Monotonic_Stack, Udemy_Arrays | 16 | 82.41

‎src/main/java/g0401_0500/s0459_repeated_substring_pattern/Solution.java‎

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

33
// #Easy #String #String_Matching #Programming_Skills_II_Day_2
4-
// #2022_03_18_Time_9_ms_(90.15%)_Space_50.5_MB_(46.55%)
4+
// #2022_07_19_Time_8_ms_(96.64%)_Space_51.2_MB_(47.98%)
55

66
public class Solution {
77
public boolean repeatedSubstringPattern(String s) {

‎src/main/java/g0401_0500/s0460_lfu_cache/LFUCache.java‎

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

33
// #Hard #Hash_Table #Design #Linked_List #Doubly_Linked_List
4-
// #2022_03_18_Time_45_ms_(99.66%)_Space_117.9_MB_(98.21%)
4+
// #2022_07_19_Time_86_ms_(81.25%)_Space_132.8_MB_(87.71%)
55

66
import java.util.HashMap;
77
import java.util.Map;
@@ -108,3 +108,10 @@ private void findNewEndOfBlock(Node node) {
108108
}
109109
}
110110
}
111+
112+
/*
113+
* Your LFUCache object will be instantiated and called as such:
114+
* LFUCache obj = new LFUCache(capacity);
115+
* int param_1 = obj.get(key);
116+
* obj.put(key,value);
117+
*/

‎src/main/java/g0401_0500/s0461_hamming_distance/Solution.java‎

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

33
// #Easy #Bit_Manipulation #Udemy_Bit_Manipulation
4-
// #2022_03_18_Time_1_ms_(39.19%)_Space_41.1_MB_(30.83%)
4+
// #2022_07_19_Time_0_ms_(100.00%)_Space_40.9_MB_(60.77%)
55

66
public class Solution {
77
public int hammingDistance(int x, int y) {

‎src/main/java/g0401_0500/s0462_minimum_moves_to_equal_array_elements_ii/Solution.java‎

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

3-
// #Medium #Array #Math #Sorting #2022_03_18_Time_3_ms_(94.38%)_Space_43.3_MB_(66.95%)
3+
// #Medium #Array #Math #Sorting #2022_07_19_Time_7_ms_(31.31%)_Space_46.7_MB_(6.63%)
44

55
import java.util.Arrays;
66

‎src/main/java/g0401_0500/s0463_island_perimeter/Solution.java‎

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

33
// #Easy #Array #Depth_First_Search #Breadth_First_Search #Matrix
4-
// #2022_03_18_Time_9_ms_(74.15%)_Space_62.2_MB_(45.55%)
4+
// #2022_07_19_Time_9_ms_(81.80%)_Space_62.9_MB_(23.26%)
55

66
public class Solution {
77
public int islandPerimeter(int[][] grid) {

‎src/main/java/g0401_0500/s0464_can_i_win/Solution.java‎

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

33
// #Medium #Dynamic_Programming #Math #Bit_Manipulation #Bitmask #Memoization #Game_Theory
4-
// #2022_03_18_Time_159_ms_(84.80%)_Space_76.6_MB_(80.60%)
4+
// #2022_07_19_Time_138_ms_(90.47%)_Space_76.4_MB_(82.84%)
55

66
public class Solution {
77
public boolean canIWin(int maxChoosableInteger, int desiredTotal) {

‎src/main/java/g0401_0500/s0466_count_the_repetitions/Solution.java‎

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

3-
// #Hard #String #Dynamic_Programming #2022_03_18_Time_1_ms_(100.00%)_Space_42_MB_(50.63%)
3+
// #Hard #String #Dynamic_Programming #2022_07_19_Time_1_ms_(100.00%)_Space_42.4_MB_(23.19%)
44

55
public class Solution {
66
public int getMaxRepetitions(String s1, int n1, String s2, int n2) {

‎src/main/java/g0401_0500/s0467_unique_substrings_in_wraparound_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.s0467_unique_substrings_in_wraparound_string;
22

3-
// #Medium #String #Dynamic_Programming #2022_03_18_Time_5_ms_(88.61%)_Space_43.3_MB_(34.18%)
3+
// #Medium #String #Dynamic_Programming #2022_07_19_Time_4_ms_(98.79%)_Space_44_MB_(5.26%)
44

55
public class Solution {
66
public int findSubstringInWraproundString(String p) {

‎src/main/java/g0401_0500/s0468_validate_ip_address/Solution.java‎

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

3-
// #Medium #String #2022_03_18_Time_1_ms_(98.15%)_Space_40.2_MB_(75.49%)
3+
// #Medium #String #2022_07_19_Time_2_ms_(73.87%)_Space_42.4_MB_(42.34%)
44

55
public class Solution {
66
private static final String NEITHER = "Neither";

0 commit comments

Comments
 (0)