Skip to content

Commit 3169ec9

Browse files
javadevjavadev
authored
Updated exec time 181-190.
1 parent 77091a2 commit 3169ec9

File tree

10 files changed

+23
-23
lines changed

10 files changed

+23
-23
lines changed

‎README.md‎

Lines changed: 14 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -218,7 +218,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
218218

219219
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
220220
|-|-|-|-|-|-
221-
| 0187 |[Repeated DNA Sequences](src/main/java/g0101_0200/s0187_repeated_dna_sequences/Solution.java)| Medium | String, Hash_Table, Bit_Manipulation, Sliding_Window, Hash_Function, Rolling_Hash | 32 | 67.58
221+
| 0187 |[Repeated DNA Sequences](src/main/java/g0101_0200/s0187_repeated_dna_sequences/Solution.java)| Medium | String, Hash_Table, Bit_Manipulation, Sliding_Window, Hash_Function, Rolling_Hash | 29 | 77.11
222222
| 0005 |[Longest Palindromic Substring](src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming | 10 | 98.57
223223

224224
#### Day 10 Linked List
@@ -324,7 +324,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
324324
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
325325
|-|-|-|-|-|-
326326
| 0977 |[Squares of a Sorted Array](src/main/java/g0901_1000/s0977_squares_of_a_sorted_array/Solution.java)| Easy | Array, Sorting, Two_Pointers | 1 | 100.00
327-
| 0189 |[Rotate Array](src/main/java/g0101_0200/s0189_rotate_array/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers | 1 | 83.21
327+
| 0189 |[Rotate Array](src/main/java/g0101_0200/s0189_rotate_array/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers | 0 | 100.00
328328

329329
#### Day 3 Two Pointers
330330

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

410410
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
411411
|-|-|-|-|-|-
412-
| 0190 |[Reverse Bits](src/main/java/g0101_0200/s0190_reverse_bits/Solution.java)| Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer | 1 | 89.07
412+
| 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
413413
| 0136 |[Single Number](src/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
@@ -1298,7 +1298,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
12981298
| 0595 |[Big Countries](src/main/java/g0501_0600/s0595_big_countries/script.sql)| Easy | Database | 241 | 92.61
12991299
| 1757 |[Recyclable and Low Fat Products](src/main/java/g1701_1800/s1757_recyclable_and_low_fat_products/script.sql)| Easy | Database | 475 | 71.54
13001300
| 0584 |[Find Customer Referee](src/main/java/g0501_0600/s0584_find_customer_referee/script.sql)| Easy | Database | 505 | 43.87
1301-
| 0183 |[Customers Who Never Order](src/main/java/g0101_0200/s0183_customers_who_never_order/script.sql)| Easy | Database | 581 | 23.03
1301+
| 0183 |[Customers Who Never Order](src/main/java/g0101_0200/s0183_customers_who_never_order/script.sql)| Easy | Database | 376 | 98.73
13021302

13031303
#### Day 2 Select and Order
13041304

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

13701370
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
13711371
|-|-|-|-|-|-
1372-
| 0182 |[Duplicate Emails](src/main/java/g0101_0200/s0182_duplicate_emails/script.sql)| Easy | Database | 345 | 59.47
1372+
| 0182 |[Duplicate Emails](src/main/java/g0101_0200/s0182_duplicate_emails/script.sql)| Easy | Database | 303 | 92.08
13731373
| 1050 |[Actors and Directors Who Cooperated At Least Three Times](src/main/java/g1001_1100/s1050_actors_and_directors_who_cooperated_at_least_three_times/script.sql)| Easy | LeetCode_Curated_SQL_70, Database | 344 | 76.48
13741374
| 1587 |[Bank Account Summary II](src/main/java/g1501_1600/s1587_bank_account_summary_ii/script.sql)| Easy | Database | 630 | 60.32
13751375
| 1084 |[Sales Analysis III](src/main/java/g1001_1100/s1084_sales_analysis_iii/script.sql)| Easy | LeetCode_Curated_SQL_70, Database | 1066 | 69.71
@@ -3136,15 +3136,15 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
31363136
| 0193 |[Valid Phone Numbers](src/main/java/g0101_0200/s0193_valid_phone_numbers/script.sh)| Easy | Shell | 129 | 42.86
31373137
| 0192 |[Word Frequency](src/main/java/g0101_0200/s0192_word_frequency/script.sh)| Medium | Shell | 152 | 38.56
31383138
| 0191 |[Number of 1 Bits](src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java)| Easy | Top_Interview_Questions, Bit_Manipulation, Algorithm_I_Day_13_Bit_Manipulation, Programming_Skills_I_Day_2_Operator | 0 | 100.00
3139-
| 0190 |[Reverse Bits](src/main/java/g0101_0200/s0190_reverse_bits/Solution.java)| Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer, Algorithm_I_Day_14_Bit_Manipulation | 1 | 89.07
3140-
| 0189 |[Rotate Array](src/main/java/g0101_0200/s0189_rotate_array/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Algorithm_I_Day_2_Two_Pointers | 1 | 83.21
3141-
| 0188 |[Best Time to Buy and Sell Stock IV](src/main/java/g0101_0200/s0188_best_time_to_buy_and_sell_stock_iv/Solution.java)| Hard | Array, Dynamic_Programming | 2 | 92.32
3142-
| 0187 |[Repeated DNA Sequences](src/main/java/g0101_0200/s0187_repeated_dna_sequences/Solution.java)| Medium | String, Hash_Table, Bit_Manipulation, Sliding_Window, Hash_Function, Rolling_Hash, Data_Structure_II_Day_9_String | 32 | 67.58
3143-
| 0185 |[Department Top Three Salaries](src/main/java/g0101_0200/s0185_department_top_three_salaries/script.sql)| Hard | Database | 763 | 63.69
3144-
| 0184 |[Department Highest Salary](src/main/java/g0101_0200/s0184_department_highest_salary/script.sql)| Medium | Database | 576 | 64.14
3145-
| 0183 |[Customers Who Never Order](src/main/java/g0101_0200/s0183_customers_who_never_order/script.sql)| Easy | Database, SQL_I_Day_1_Select | 581 | 23.03
3146-
| 0182 |[Duplicate Emails](src/main/java/g0101_0200/s0182_duplicate_emails/script.sql)| Easy | Database, SQL_I_Day_10_Where | 345 | 59.47
3147-
| 0181 |[Employees Earning More Than Their Managers](src/main/java/g0101_0200/s0181_employees_earning_more_than_their_managers/script.sql)| Easy | Database | 385 | 52.30
3139+
| 0190 |[Reverse Bits](src/main/java/g0101_0200/s0190_reverse_bits/Solution.java)| Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer, Algorithm_I_Day_14_Bit_Manipulation | 1 | 98.66
3140+
| 0189 |[Rotate Array](src/main/java/g0101_0200/s0189_rotate_array/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Algorithm_I_Day_2_Two_Pointers | 0 | 100.00
3141+
| 0188 |[Best Time to Buy and Sell Stock IV](src/main/java/g0101_0200/s0188_best_time_to_buy_and_sell_stock_iv/Solution.java)| Hard | Array, Dynamic_Programming | 1 | 100.00
3142+
| 0187 |[Repeated DNA Sequences](src/main/java/g0101_0200/s0187_repeated_dna_sequences/Solution.java)| Medium | String, Hash_Table, Bit_Manipulation, Sliding_Window, Hash_Function, Rolling_Hash, Data_Structure_II_Day_9_String | 29 | 77.11
3143+
| 0185 |[Department Top Three Salaries](src/main/java/g0101_0200/s0185_department_top_three_salaries/script.sql)| Hard | Database | 643 | 95.52
3144+
| 0184 |[Department Highest Salary](src/main/java/g0101_0200/s0184_department_highest_salary/script.sql)| Medium | Database | 590 | 73.49
3145+
| 0183 |[Customers Who Never Order](src/main/java/g0101_0200/s0183_customers_who_never_order/script.sql)| Easy | Database, SQL_I_Day_1_Select | 376 | 98.73
3146+
| 0182 |[Duplicate Emails](src/main/java/g0101_0200/s0182_duplicate_emails/script.sql)| Easy | Database, SQL_I_Day_10_Where | 303 | 92.08
3147+
| 0181 |[Employees Earning More Than Their Managers](src/main/java/g0101_0200/s0181_employees_earning_more_than_their_managers/script.sql)| Easy | Database | 315 | 94.44
31483148
| 0180 |[Consecutive Numbers](src/main/java/g0101_0200/s0180_consecutive_numbers/script.sql)| Medium | Database | 550 | 48.44
31493149
| 0179 |[Largest Number](src/main/java/g0101_0200/s0179_largest_number/Solution.java)| Medium | Top_Interview_Questions, String, Sorting, Greedy | 10 | 54.50
31503150
| 0178 |[Rank Scores](src/main/java/g0101_0200/s0178_rank_scores/script.sql)| Medium | Database | 290 | 66.73

‎src/main/java/g0101_0200/s0181_employees_earning_more_than_their_managers/script.sql‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
11
# Write your MySQL query statement below
2-
# #Easy #Database #2022_03_04_Time_385_ms_(52.30%)_Space_0B_(100.00%)
2+
# #Easy #Database #2022_06_27_Time_315_ms_(94.44%)_Space_0B_(100.00%)
33
select a.Name as Employee from Employee a left join Employee b on a.ManagerId=b.Id
44
where a.Salary > b.Salary and a.ManagerId is not null

‎src/main/java/g0101_0200/s0182_duplicate_emails/script.sql‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,3 @@
11
# Write your MySQL query statement below
2-
# #Easy #Database #SQL_I_Day_10_Where #2022_03_04_Time_345_ms_(59.47%)_Space_0B_(100.00%)
2+
# #Easy #Database #SQL_I_Day_10_Where #2022_06_27_Time_303_ms_(92.08%)_Space_0B_(100.00%)
33
SELECT Email FROM Person GROUP BY Email HAVING COUNT(Email) > 1;

‎src/main/java/g0101_0200/s0183_customers_who_never_order/script.sql‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
# Write your MySQL query statement below
2-
# #Easy #Database #SQL_I_Day_1_Select #2022_03_04_Time_581_ms_(23.03%)_Space_0B_(100.00%)
2+
# #Easy #Database #SQL_I_Day_1_Select #2022_06_27_Time_376_ms_(98.73%)_Space_0B_(100.00%)
33
SELECT c.Name as Customers
44
FROM Customers as c
55
LEFT JOIN Orders as o

‎src/main/java/g0101_0200/s0184_department_highest_salary/script.sql‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
# Write your MySQL query statement below
2-
# #Medium #Database #2022_03_04_Time_576_ms_(64.14%)_Space_0B_(100.00%)
2+
# #Medium #Database #2022_06_27_Time_590_ms_(73.49%)_Space_0B_(100.00%)
33
SELECT
44
d.Name AS Department,
55
Sel.Name AS Employee,

‎src/main/java/g0101_0200/s0185_department_top_three_salaries/script.sql‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
# Write your MySQL query statement below
2-
# #Hard #Database #2022_03_04_Time_763_ms_(63.69%)_Space_0B_(100.00%)
2+
# #Hard #Database #2022_06_27_Time_643_ms_(95.52%)_Space_0B_(100.00%)
33
SELECT D.name AS Department,
44
A.name AS Employee,
55
A.salary AS Salary

‎src/main/java/g0101_0200/s0187_repeated_dna_sequences/Solution.java‎

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

33
// #Medium #String #Hash_Table #Bit_Manipulation #Sliding_Window #Hash_Function #Rolling_Hash
4-
// #Data_Structure_II_Day_9_String #2022_03_04_Time_32_ms_(67.58%)_Space_73.2_MB_(6.07%)
4+
// #Data_Structure_II_Day_9_String #2022_06_27_Time_29_ms_(77.11%)_Space_74.1_MB_(6.94%)
55

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

‎src/main/java/g0101_0200/s0188_best_time_to_buy_and_sell_stock_iv/Solution.java‎

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

3-
// #Hard #Array #Dynamic_Programming #2022_03_04_Time_2_ms_(92.32%)_Space_40.7_MB_(69.51%)
3+
// #Hard #Array #Dynamic_Programming #2022_06_27_Time_1_ms_(100.00%)_Space_42.7_MB_(47.38%)
44

55
public class Solution {
66
public int maxProfit(int k, int[] prices) {

‎src/main/java/g0101_0200/s0189_rotate_array/Solution.java‎

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Two_Pointers
4-
// #Algorithm_I_Day_2_Two_Pointers #2022_03_04_Time_1_ms_(83.21%)_Space_64.2_MB_(43.99%)
4+
// #Algorithm_I_Day_2_Two_Pointers #2022_06_27_Time_0_ms_(100.00%)_Space_58_MB_(96.22%)
55

66
public class Solution {
77
private void reverse(int[] nums, int l, int r) {

‎src/main/java/g0101_0200/s0190_reverse_bits/Solution.java‎

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

33
// #Easy #Top_Interview_Questions #Bit_Manipulation #Divide_and_Conquer
4-
// #Algorithm_I_Day_14_Bit_Manipulation #2022_03_04_Time_1_ms_(89.07%)_Space_42.1_MB_(38.84%)
4+
// #Algorithm_I_Day_14_Bit_Manipulation #2022_06_27_Time_1_ms_(98.66%)_Space_41.9_MB_(81.78%)
55

66
public class Solution {
77
// you need treat n as an unsigned value

0 commit comments

Comments
 (0)