Uber Coding Round Problem

Revision en1, by harshit2001411, 2021-07-30 07:20:17

Hi, There was this one tedious problem in the Uber coding round.

Q) Given a binary string S, convert it to a base 6 equivalent number string.

S.length() >= 1 && S.length() <= 100.

My question is whether there is any faster way to do such conversions instead of the old-fashioned way of converting to base 10 and then to base 6?

PS: the round got cancelled because of the server crash.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English harshit2001411 2021-07-30 07:20:17 429 Initial revision (published)