Easy 0 solved 0% acceptance

Base Converter

Convert a number written in one base (2 to 36) to another base.

What you'll learn

  • Read digits in any base into a number
  • Write a number in any base with remainders
  • Map digit values to characters and back

Problem

In base b a number is written with the digits 0 to b − 1, where the letters A to Z stand for the digit values 10 to 35. So FF in base 16 is 255, which is 377 in base 8 and 11111111 in base 2. Convert digits, written in from_base, to the same number written in to_base.

Implement base_converter(digits, from_base, to_base).

Input

digits: The number in from_base: a non-empty string of digits and uppercase letters, each smaller than from_base. It may have leading zeros.

from_base: The base of the input.

to_base: The base of the result.

Output

Return the number in to_base using 0-9 and uppercase A-Z, with no leading zeros. Zero is returned as "0".

Constraints

2 ≤ from_base, to_base ≤ 36

The value of the number is at most 10^18.

Examples

Example 1
Input:
digits = "FF"
from_base = 16
to_base = 8

Expected output:
expected = "377"
Input:
std::string digits = "FF";
long long from_base = 16;
long long to_base = 8;

Expected output:
std::string expected = "377";
Input:
string digits = "FF";
long from_base = 16;
long to_base = 8;

Expected output:
string expected = "377";

Explanation

FF is 15 × 16 + 15 = 255, and 255 = 3 × 64 + 7 × 8 + 7, so the answer is "377".

Example 2
Input:
digits = "1010"
from_base = 2
to_base = 36

Expected output:
expected = "A"
Input:
std::string digits = "1010";
long long from_base = 2;
long long to_base = 36;

Expected output:
std::string expected = "A";
Input:
string digits = "1010";
long from_base = 2;
long to_base = 36;

Expected output:
string expected = "A";

Explanation

1010 in binary is 10, which is the single digit "A" in base 36.

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

Go through the input left to right, multiplying the running value by from_base and adding each digit.

Hint 2

To write the result, take remainders of division by to_base; they come out last digit first.

Hint 3

Treat zero as a special case so the output is "0" rather than empty.

Expected complexity

O(L) time, O(L) extra space, where L is the number of digits

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.