Convert the given roman numeral into an integer value.

Given an array of integers, nums, return all the triplets in the given array nums[i], nums[j], nums[k] such that i != j, i != k, and j != k

Given a 32-bit signed integer x, reverse the digits in x and return the result. If after reversing the result goes outside the signed 32-bit

Given an integer x, return true if x is a palindrome integer. An integer is a palindrome when it reads the same backward as forward.

This is a solution to leetcode 8 problem. Implement myAtoi(string s) function, which converts a string to a 32-bit signed integer.

Given a string s, find the length of the longest substring without repeating characters. s consists of English letters, digits, symbols and