Challenges

SwapMaster solves Symmetric Swap
The SwapMaster is known to be the greatest and fastest swapper of all ...
Max. Marks: 4
Solved By : 1957
String Matching
Cody has a sequence of characters N. He likes a sequence if it contain...
Max. Marks: 3
Solved By : 914
Leap Year
Steve is playing a quiz game with his brother John. As Steve just lear...
Max. Marks: 6
Solved By : 1565
Project Teams
There are N students in a class and Teacher want to divide these stude...
Max. Marks: 5
Solved By : 2709
Circle of Numbers
All numbers in NumberLand are standing in a circle for a dancing cerem...
Max. Marks: 6
Solved By : 1923
Happy String
A happy string is a string in which each character is lexicographicall...
Max. Marks: 4
Solved By : 1373
Degree Celsius
Tom is a scientist. He uses huge machines for complex calculations. Th...
Max. Marks: 4
Solved By : 3208
Three's Company
This problem requires you to create a output string from input string ...
Max. Marks: 4
Solved By : 2252
Array Sum
You are given an integer array and you have to find the sum of the ele...
Max. Marks: 4
Solved By : 2154
Change in Case
You will be given a single string and two positive integers denoting i...
Max. Marks: 6
Solved By : 1188
Happy String
Please select a challenge
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: 1373

Maximum Marks: 4