Skip to content

Commit b7a0bf0

Browse files
Update README.md
1 parent f119120 commit b7a0bf0

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@
1111
| 12 | Integer to Roman | Given an integer, convert it to a roman numeral. | [Solution](integer_to_roman.js) |
1212
| 13 | Roman to Integer | Given a roman numeral, convert it to an integer. | [Solution](roman_to_integer.js) |
1313
| 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) |
1515
| 65 | Valid Number | Validate if a given string can be interpreted as a decimal number. | [Solution](valid_number.js) |
1616
| 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) |
1717
| 204 | Count Primes | Count the number of prime numbers less than a non-negative number, n. | [Solution](count_primes.js) |

0 commit comments

Comments
 (0)