8000 [L-0] fix broken links · bloomer1/Leetcode@bcf4b32 · GitHub
[go: up one dir, main page]

Skip to content

Commit bcf4b32

Browse files
[L-0] fix broken links
1 parent 74cd656 commit bcf4b32

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -403,11 +403,11 @@ Your ideas/fixes/algorithms are more than welcome!
403403
|-----|----------------|---------------|---------------|---------------|-------------|--------------|-----
404404
|197|[Rising Temperature](https://leetcode.com/problems/rising-temperature/)|[Solution](../master/database/RisingTemperature.sql)| O(n^2)|O(n) | Easy|
405405
|196|[Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails/)|[Solution](../master/database/DeleteDuplicateEmails.sql)| O(n^2)|O(n) | Easy|
406-
|184|[Department Highest Salary](https://leetcode.com/problems/department-highest-salary)|[Solution](../master/database/_184.sql.sql)| O(n^2)|O(n) | Medium|
406+
|184|[Department Highest Salary](https://leetcode.com/problems/department-highest-salary)|[Solution](../master/database/_184.sql)| O(n^2)|O(n) | Medium|
407407
|183|[Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order/)|[Solution](../master/database/CustomersWhoNeverOrder.sql)| O(n^2)|O(n) | Easy|
408408
|182|[Duplicate Emails](https://leetcode.com/problems/duplicate-emails/)|[Solution](../master/database/DuplicateEmails.sql)| O(n^2)|O(n) | Easy|
409409
|181|[Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers/)|[Solution](../master/database/EmployeesEarningMoreThanTheirManagers.sql)| O(n^2)|O(n) | Easy|
410-
|180|[Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers)|[Solution](../master/atabase/_180.sql)| O(n)|O(n) | Medium|
410+
|180|[Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers)|[Solution](../master/database/_180.sql)| O(n)|O(n) | Medium|
411411
|178|[Rank Scores](https://leetcode.com/problems/rank-scores/)|[Solution](../master/database/RankScores.sql)| ? | ? | Medium|
412412
|177|[Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary/)|[Solution](../master/database/_177.sql)| O(n) | O(1) | Medium|
413413
|176|[Second Highest Salary](https://leetcode.com/problems/second-highest-salary/)|[Solution](../master/database/SecondHighestSalary.sql)| O(n)|O(1) | Easy|

0 commit comments

Comments
 (0)
0