You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+1-1
Original file line number
Diff line number
Diff line change
@@ -11,7 +11,7 @@
11
11
| 12 | Integer to Roman | Given an integer, convert it to a roman numeral. |[Solution](integer_to_roman.js)|
12
12
| 13 | Roman to Integer | Given a roman numeral, convert it to an integer. |[Solution](roman_to_integer.js)|
13
13
| 14 | Longest Common Prefix | Find the longest common prefix string amongst an array of strings. |[Solution](longest_common_prefix.js)|
14
-
| 20 | Valid Parenthesis| Given a string, determine if the input string is valid. |[Solution](valid_parenthesis.js)|
14
+
| 20 | Valid Parentheses| Given a string, determine if the input string is valid. |[Solution](valid_parentheses.js)|
15
15
| 65 | Valid Number | Validate if a given string can be interpreted as a decimal number. |[Solution](valid_number.js)|
16
16
| 94 | Binary Tree Inorder Traversal | Given the root of a binary tree, return the inorder traversal of its nodes' values. |[Solution](binary_tree_inorder_traversal.js)|
17
17
| 204 | Count Primes | Count the number of prime numbers less than a non-negative number, n. |[Solution](count_primes.js)|
0 commit comments