There are infinite sets of str

Interview Question

0

of 0 votes

8
Answers
There are infinite sets of strings given to you as follows:
a,b,c .. z,
aa,ab,ac ..az,
ba,bb,bc...bz,
ca,cb,cc ..cz,
....aaaa....bbbb........

Given a number return the String at that position. For example given 1 should return a, given 27 should return aa and so on.
- Anonymous May 21, 2010 | Report Duplicate | Flag | PURGE
Algorithm

Email me when people comment.

An error occurred in subscribing you.

More Questions from This Interview

Email me when people comment.

An error occurred in subscribing you.

Comment hidden because of low score. Click to expand.

of 0 vote

void printstring(int num)
{
if(!num)
return ;
int rem=0;
rem=num%26;
num=num/26;
printstring(num);
printf("%c",96+rem);

}

- Anonymous May 21, 2010 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 votes

Another moron who doesn't test his code.

- Anonymous May 21, 2010 | Flag

Comment hidden because of low score. Click to expand.

of 0 vote

The solution for this problem involves us thinking in terms of Base 26 notation like Hexadecimal (which is 16). I am trying to remember the way we convert Base 16 to Base 10. We could apply the similar logic.

After writing I kind of remember trying to get the modulo of the number any may be first solution leads to that.

- prolific.coder May 21, 2010 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

void base26(int n)
{
if(n<base) {
putchar('a'+n%26-1);
return;
}
base26(n/26);
putchar('a'+n%26-1);
}

- buried.shopno May 22, 2010 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 votes

I find no difference bet ur code n anonymous'.Still his code is more readable

- Hawk May 22, 2010 | Flag

Comment hidden because of low score. Click to expand.

of 0 votes

Who is this moron - who comments but does not provide any answers.

1. one issue i can see is negative number check .

- bigdog May 22, 2010 | Flag

Comment hidden because of low score. Click to expand.

of 0 votes

#Since you asked so nicely...
#

def convert(n):
  assert isinstance(n, int) and n >= 0
  d = 1
  while d <= n:
    n -= d
    d *= 26
  chars = []
  while True:
    d //= 26
    if d == 0:
      break
    x, n = divmod(n, d)
    chars.append(x)
  return ''.join(chr(ord('a') + x) for x in chars)
#

CareerCup

Interview Question

Books

Videos

Resume Review

Mock Interviews