Write a function that converts an integer into a string such that the number is represented in Roman Numerals in the most efficient way.
For example, the number 4 could be written as IIII but it's more efficient to use IVsince that's a shorter string.
Assume no number is greater than 4,000.
Any number that reads the same way forwards as it does backwards is a palindrome. For instance, 12321 would be considered a palindrome, whereas 123 would not be.
Write a function that takes in an integer and returns the next palindrome. For instance:
findNextPalindrome(100)
// should return 101
This gist contains a short assignment I'd like everyone to complete before our formal lesson. The prework involves reading some of the React Router documentation, and will allow us to keep the lesson more hands on.