Skip to content

Commit 4f680d8

Browse files
Update README.md
1 parent 7b363f8 commit 4f680d8

File tree

1 file changed

+3
-3
lines changed

1 file changed

+3
-3
lines changed

README.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -30,7 +30,7 @@
3030
| 349 | Intersection of Two Arrays | Given two integer arrays, return an array of their intersection. | [Solution](intersection_of_arrays.js) |
3131
| 389 | Find the Difference | You are given two strings s and t. String t is generated by random shuffling string s and then add one more letter at a random position. Return the letter that was added to t. | [Solution](find_the_difference.js) |
3232
| 448 | Find All Numbers Disappeared in an Array | Given an array of integers, return an array of all the integers that do not appear in nums. | [Solution](number_disappeared_in_array.js) |
33-
| 584 | Find Customer Referee | Find the names of the customer that are not referred by the customer with id = 2. | [Solution](find_customer_referee.sql)
33+
| 584 | Find Customer Referee | Find the names of the customer that are not referred by the customer with id = 2. | [Solution](find_customer_referee.sql) |
3434
| 595 | Big Countries | A country is big if it has an area of bigger than 3 million square km or a population of more than 25 million. Write a SQL solution to output big countries' name, population and area. | [Solution](big_countries.sql) |
3535
| 620 | Not Boring Movies | Write a SQL query to output movies with an odd numbered ID and a description that is not 'boring'.| [Solution](not_boring_movies.sql) |
3636
| 665 | Non-decreasing Array | Given an array, check if it could become non-decreasing by modifying at most 1 element. | [Solution](non_decreasing_array.js) |
@@ -59,12 +59,12 @@
5959
| 1672 | Richest Customer Wealth | You are given an m x n integer grid accounts where accounts[i][j] is the amount of money the ith customer has in the jth bank. Return the wealth that the richest customer has. A customer's wealth is the amount of money they have in all their bank accounts. The richest customer is the customer that has the maximum wealth. | [Solution](richest_customer_wealth.js) | |
6060
| 1683 | Invalid Tweets | Write a solution to find the IDs of the invalid tweets. The tweet is invalid if the number of characters used in the content of the tweet is strictly greater than 15. | [Solution](invalid_tweets.sql) |
6161
| 1757 | Recyclable and Low Fat Products | Write a solution to find the ids of products that are both low fat and recyclable. | [Solution](recyclable_low_fat.sql) |
62-
| 1920 | Build Array from Permutation | Given a zero-based permutation nums (0-indexed), build an array ans of the same length where ans[i] = nums[nums[i]] for each 0 <= i < nums.length and return it. | [Solution](array_from_permutation.js)
62+
| 1920 | Build Array from Permutation | Given a zero-based permutation nums (0-indexed), build an array ans of the same length where ans[i] = nums[nums[i]] for each 0 <= i < nums.length and return it. | [Solution](array_from_permutation.js) |
6363
| 1929 | Concatenation of Array | Given an integer array nums of length n, you want to create an array ans of length 2n where ans[i] == nums[i] and ans[i + n] == nums[i] for 0 <= i < n (0-indexed). Specifically, ans is the concatenation of two nums arrays. Return the array ans. | [Solution](concatenation_of_array.js) |
6464
| 2011 | Final Value of Variable After Performing Operations | Given an array of strings operations containing a list of operations, return the final value of X after performing all the operations. | [Solution](final_value.js) |
6565
| 2114 | Maximum Number of Words Found in Sentences | Return the maximum number of words that appear in a single sentence. | [Solution](maximum_words.js) |
6666
| 2235 | Add Two Integers | Given two integers num1 and num2, return the sum of the two integers. | [Solution](add_two_integers.js) |
67-
| 2413 | Smallest Even Multiple | Given a positive integer n, return the smallest positive integer that is a multiple of both 2 and n. | [Solution](smallest_even_multiple.js)
67+
| 2413 | Smallest Even Multiple | Given a positive integer n, return the smallest positive integer that is a multiple of both 2 and n. | [Solution](smallest_even_multiple.js) |
6868
| 2469 | Convert the Temperature | You should convert Celsius into Kelvin and Fahrenheit and return it as an array ans = [kelvin, fahrenheit]. | [Solution](convert_temperature.js) |
6969
| 2703 | Return Length of Arguments Passed | Write a function argumentsLength that returns the count of arguments passed to it. | [Solution](length_of_arguments.js) |
7070
| 2723 | Add Two Promises | Given two promises, return a new promise. The returned promise should resolve with the sum of the two numbers. | [Solution](add_two_promises.js) |

0 commit comments

Comments
 (0)