A decimal number can be converted to its Hexspeak representation by first converting it to an uppercase hexadecimal string, then replacing all occurrences of the digit '0' with the letter 'O', and the digit '1' with the letter 'I'. Such a representation is valid if and only if it consists only of the letters in the set {'A', 'B', 'C', 'D', 'E', 'F', 'I', 'O'}.
Given a string num representing a decimal integer n, return the Hexspeak representation of n if it is valid, otherwise return "ERROR".
Example 1:
Input: num = "257" Output: "IOI" Explanation: 257 is 101 in hexadecimal.
Example 2:
Input: num = "3" Output: "ERROR"
Constraints:
1 <= num.length <= 12num does not contain leading zeros.[1, 1012].Convert the number to a hexadecimal string, then traverse the string, convert the number 0 to the letter O, and the number 1 to the letter I. Finally, check whether the converted string is valid.
The time complexity is O(log n), where n is the size of the decimal number represented by num.
Java
C++
Go
I HATE This Coding Question, but FAANG Loves it! | Majority Element - Leetcode 169 • Greg Hogg • 2,093,898 views views
Watch 9 more video solutions →Practice Hexspeak with our built-in code editor and test cases.
Practice on FleetCode