Skip to content

Commit 70c10fc

Browse files
javadevjavadev
authored
Updated exec time 162-169.
1 parent 2f5abd3 commit 70c10fc

File tree

8 files changed

+15
-25
lines changed

8 files changed

+15
-25
lines changed

‎README.md‎

Lines changed: 8 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -159,7 +159,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
159159
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
160160
|-|-|-|-|-|-
161161
| 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
162-
| 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
162+
| 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 | 1 | 100.00
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

165165
#### Day 2 Array
@@ -331,7 +331,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
331331
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
332332
|-|-|-|-|-|-
333333
| 0283 |[Move Zeroes](src.save/main/java/g0201_0300/s0283_move_zeroes/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers | 2 | 74.00
334-
| 0167 |[Two Sum II - Input Array Is Sorted](src.save/main/java/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.java)| Medium | Array, Binary_Search, Two_Pointers | 2 | 49.88
334+
| 0167 |[Two Sum II - Input Array Is Sorted](src.save/main/java/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.java)| Medium | Array, Binary_Search, Two_Pointers | 1 | 99.21
335335

336336
#### Day 4 Two Pointers
337337

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

615615
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
616616
|-|-|-|-|-|-
617-
| 0167 |[Two Sum II - Input Array Is Sorted](src.save/main/java/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.java)| Medium | Array, Binary_Search, Two_Pointers | 2 | 49.88
617+
| 0167 |[Two Sum II - Input Array Is Sorted](src.save/main/java/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.java)| Medium | Array, Binary_Search, Two_Pointers | 1 | 99.21
618618
| 1608 |[Special Array With X Elements Greater Than or Equal X](src.save/main/java/g1601_1700/s1608_special_array_with_x_elements_greater_than_or_equal_x/Solution.java)| Easy | Array, Sorting, Binary_Search | 2 | 61.14
619619

620620
#### Day 8
@@ -3151,12 +3151,12 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
31513151
| 0173 |[Binary Search Tree Iterator](src.save/main/java/g0101_0200/s0173_binary_search_tree_iterator/BSTIterator.java)| Medium | Tree, Binary_Tree, Stack, Design, Binary_Search_Tree, Iterator, Data_Structure_II_Day_17_Tree, Programming_Skills_II_Day_16 | 18 | 78.45
31523152
| 0172 |[Factorial Trailing Zeroes](src.save/main/java/g0101_0200/s0172_factorial_trailing_zeroes/Solution.java)| Medium | Top_Interview_Questions, Math | 1 | 81.96
31533153
| 0171 |[Excel Sheet Column Number](src.save/main/java/g0101_0200/s0171_excel_sheet_column_number/Solution.java)| Easy | Top_Interview_Questions, String, Math | 3 | 24.67
3154-
| 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, Data_Structure_II_Day_1_Array | 2 | 83.81
3154+
| 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, Data_Structure_II_Day_1_Array | 1 | 100.00
31553155
| 0168 |[Excel Sheet Column Title](src.save/main/java/g0101_0200/s0168_excel_sheet_column_title/Solution.java)| Easy | String, Math | 0 | 100.00
3156-
| 0167 |[Two Sum II - Input Array Is Sorted](src.save/main/java/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.java)| Medium | Array, Binary_Search, Two_Pointers, Algorithm_I_Day_3_Two_Pointers, Binary_Search_I_Day_7 | 2 | 49.88
3157-
| 0166 |[Fraction to Recurring Decimal](src.save/main/java/g0101_0200/s0166_fraction_to_recurring_decimal/Solution.java)| Medium | Top_Interview_Questions, String, Hash_Table, Math | 4 | 33.10
3158-
| 0165 |[Compare Version Numbers](src.save/main/java/g0101_0200/s0165_compare_version_numbers/Solution.java)| Medium | String, Two_Pointers | 1 | 90.80
3159-
| 0164 |[Maximum Gap](src.save/main/java/g0101_0200/s0164_maximum_gap/Solution.java)| Hard | Array, Sorting, Bucket_Sort, Radix_Sort | 36 | 66.54
3156+
| 0167 |[Two Sum II - Input Array Is Sorted](src.save/main/java/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.java)| Medium | Array, Binary_Search, Two_Pointers, Algorithm_I_Day_3_Two_Pointers, Binary_Search_I_Day_7 | 1 | 99.21
3157+
| 0166 |[Fraction to Recurring Decimal](src.save/main/java/g0101_0200/s0166_fraction_to_recurring_decimal/Solution.java)| Medium | Top_Interview_Questions, String, Hash_Table, Math | 3 | 55.19
3158+
| 0165 |[Compare Version Numbers](src.save/main/java/g0101_0200/s0165_compare_version_numbers/Solution.java)| Medium | String, Two_Pointers | 1 | 88.88
3159+
| 0164 |[Maximum Gap](src.save/main/java/g0101_0200/s0164_maximum_gap/Solution.java)| Hard | Array, Sorting, Bucket_Sort, Radix_Sort | 48 | 53.59
31603160
| 0162 |[Find Peak Element](src.save/main/java/g0101_0200/s0162_find_peak_element/Solution.java)| Medium | Top_Interview_Questions, Array, Binary_Search, Algorithm_II_Day_2_Binary_Search, Binary_Search_II_Day_12 | 0 | 100.00
31613161
| 0160 |[Intersection of Two Linked Lists](src.save/main/java/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_II_Day_11_Linked_List | 1 | 99.68
31623162
| 0155 |[Min Stack](src.save/main/java/g0101_0200/s0155_min_stack/MinStack.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Data_Structure_II_Day_14_Stack_Queue, Programming_Skills_II_Day_18 | 3 | 100.00

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

Lines changed: 1 addition & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,25 +1,22 @@
11
package g0101_0200.s0162_find_peak_element;
22

33
// #Medium #Top_Interview_Questions #Array #Binary_Search #Algorithm_II_Day_2_Binary_Search
4-
// #Binary_Search_II_Day_12 #2022_03_04_Time_0_ms_(100.00%)_Space_43.1_MB_(21.18%)
4+
// #Binary_Search_II_Day_12 #2022_06_25_Time_0_ms_(100.00%)_Space_43.5_MB_(12.83%)
55

66
public class Solution {
77
public int findPeakElement(int[] nums) {
88
int start = 0;
99
int end = nums.length - 1;
10-
1110
while (start < end) {
1211
// This is done because start and end might be big numbers, so it might exceed the
1312
// integer limit.
1413
int mid = start + ((end - start) / 2);
15-
1614
if (nums[mid + 1] > nums[mid]) {
1715
start = mid + 1;
1816
} else {
1917
end = mid;
2018
}
2119
}
22-
2320
return start;
2421
}
2522
}

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

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

33
// #Hard #Array #Sorting #Bucket_Sort #Radix_Sort
4-
// #2022_03_04_Time_36_ms_(66.54%)_Space_55.6_MB_(79.55%)
4+
// #2022_06_25_Time_48_ms_(53.59%)_Space_84.1_MB_(20.66%)
55

66
import java.util.Arrays;
77

@@ -10,17 +10,13 @@ public int maximumGap(int[] nums) {
1010
if (nums.length < 2) {
1111
return 0;
1212
}
13-
1413
int ret = Integer.MIN_VALUE;
15-
1614
Arrays.sort(nums);
17-
1815
for (int i = 0; i < nums.length - 1; i++) {
1916
if ((nums[i + 1] - nums[i]) > ret) {
2017
ret = (nums[i + 1] - nums[i]);
2118
}
2219
}
23-
2420
return ret;
2521
}
2622
}

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

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

3-
// #Medium #String #Two_Pointers #2022_03_04_Time_1_ms_(90.80%)_Space_42.2_MB_(39.21%)
3+
// #Medium #String #Two_Pointers #2022_06_25_Time_1_ms_(88.88%)_Space_41.8_MB_(66.14%)
44

55
public class Solution {
66
public int compareVersion(String version1, String version2) {

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

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

33
// #Medium #Top_Interview_Questions #String #Hash_Table #Math
4-
// #2022_03_04_Time_4_ms_(33.10%)_Space_41.6_MB_(26.44%)
4+
// #2022_06_25_Time_3_ms_(55.19%)_Space_41.8_MB_(35.85%)
55

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

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

Lines changed: 1 addition & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,14 +1,13 @@
11
package g0101_0200.s0167_two_sum_ii_input_array_is_sorted;
22

33
// #Medium #Array #Binary_Search #Two_Pointers #Algorithm_I_Day_3_Two_Pointers
4-
// #Binary_Search_I_Day_7 #2022_03_04_Time_2_ms_(49.88%)_Space_49.8_MB_(25.20%)
4+
// #Binary_Search_I_Day_7 #2022_06_25_Time_1_ms_(99.21%)_Space_50.3_MB_(31.33%)
55

66
public class Solution {
77
public int[] twoSum(int[] numbers, int target) {
88
int[] res = new int[2];
99
int i = 0;
1010
int j = numbers.length - 1;
11-
1211
while (i < j) {
1312
int sum = numbers[i] + numbers[j];
1413
if (sum == target) {

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

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

3-
// #Easy #String #Math #2022_03_04_Time_0_ms_(100.00%)_Space_40.7_MB_(51.16%)
3+
// #Easy #String #Math #2022_06_25_Time_0_ms_(100.00%)_Space_41.3_MB_(58.37%)
44

55
public class Solution {
66
public String convertToTitle(int n) {

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

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

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Sorting #Counting
44
// #Divide_and_Conquer #Data_Structure_II_Day_1_Array
5-
// #2022_03_04_Time_2_ms_(83.81%)_Space_56.6_MB_(22.94%)
5+
// #2022_06_25_Time_1_ms_(100.00%)_Space_45.5_MB_(97.51%)
66

77
public class Solution {
88
public int majorityElement(int[] arr) {
@@ -20,15 +20,13 @@ public int majorityElement(int[] arr) {
2020
}
2121
}
2222
}
23-
2423
// For Confirmation
2524
count = 0;
2625
for (int j : arr) {
2726
if (j == majority) {
2827
count++;
2928
}
3029
}
31-
3230
if (count >= (arr.length / 2) + 1) {
3331
return majority;
3432
} else {

0 commit comments

Comments
 (0)