Nirvana | 2017 batch

  1. Split a large number into two unequal or equal (k and n-k)parts and check if they are divisible by two numbers given by the user. Example: 12002100 here 1200 is divisible by 12 and 2100 is divisible by 7.
  2. There are two strings and we have to find how many ways are there so that characters can be altered to make strings equal. Example; Ramesh and Rajesh- we have two ways adding j after m in string1 and adding m before j in string2; adding j before m in string 1 and adding m after j in string 2.
  3. Print input string in concatenated zigzag format.
    Input: COMPANYISHIRING
    Zigzag: (for 4 rows)
C      Y      I
O  N   I   R  N
M  A   S   I  G
P      H

Output: CYIONIRNMASIGPH
Number of rows are entered by user. String is also entered by user.

1 Like