Smallest Palindromic Integer – Greater than X
The program must accept N unique digits and an integer X as the input. The program must print the smallest palindromic integer, which is…
Integers – Parity Sort
The program must accept N integers as the input. The program must sort the integers based on the parity (Even parity followed by Odd…
Split Integer – Range Sum
The program must accept an integer N as the input. The program must print YES if it is possible to split the integer N…
Integer – Place Values
The program must accept an integer N as the input. The program must print each place value in the integer N as the output. Boundary…
Toggle – Digits and Words
The program must accept a string S which contains digits as integer values and words. The program must toggle the digits to words and words to…
Serial Killer – N Houses
There are N houses in a row. A serial killer plans to kill people in these houses. If he targets Xth house, he will…
Expand String based on Frequency
In a string compression technique, a string can be compressed based on the following condition.– If a character occurs…
Boxes and Balls
There are N boxes and N balls on a table. Each box can hold a maximum of one ball only if the size of the ball is less…
Piggy Bank & Toy
A boy wants to save money to buy a toy. He puts money in his piggy bank every day. Every day, he puts 1 rupee more than the previous day.…
Count – Most Repeated Character
The program must accept a string S containing only alphanumeric characters as the input. The program must print the number of occurrences of…