Challenges
Problem Statement
A happy string is a string in which each character is lexicographically greater than its next character. You are given a positive integer N as an input. You need to print the smallest lexicographical string possible of length N.
NOTE: All characters in a happy string are in lowercase.
Input
A single integer N.
Output
Print the lexicographically smallest string of length N.
Constraints
1 ≤ N ≤ 26
Sample Input
2
Sample Output
ba
Dcoded By: Mrudul Sankhere
Solved By: 2235
Maximum Marks: 4