Problem of The Day 2 January — Nikhil and Commands

Nikhil and Commands

Nikhil learnt two new commands pwd and cd on the first day of Operating Systems lab.

Problem of The Day 5 January — Append and Delete

Append and Delete

You have a string,s, of lowercase English alphabetic letters. You can perform two types of operations on s:

1. Append a lowercase English alphabetic letter to the end…

Problem of The Day 3 January — Candy Piles

Alice is celebrating the New Year with n piles of candies! Each pile i contains ci candies, and she defines her happiness factor as the minimum number of candies in any pile. As this is a special day, Alice wants to try to maximize her happiness factor by…

Problem of The Day 4 January — Lucky Numbers

Lucky Numbers

Leonardo thinks 4 and 7 are lucky digits! He defines a number as lucky if it can be represented as the sum of one or more of these lucky digits. For example, he considers the following numbers to be…

Problem of The Day 8 January — Monk And Champions League

Monk And Champions League

Monk’s favourite game is Football and his favourite club is “Manchester United”. Manchester United has qualified for the Champions League Final which is to be held…

Problem of The Day 1 January — Vibhu and his Mathematics

Vibhu and his Mathematics

In code world all genders are considered equal ( It means their is nothing like male or female). Now their are N distinct persons living in this hypothetical…

Problem of The Day 7 January — Palindrome Count

Palindrome Count

Given a string S, count the number of non empty sub strings that are palindromes.
A sub string is any continuous sequence of characters in the string.
A string is said to be palindrome, if the…

Problem of The Day 6 January — UpUp

You are given a string S. S consists of several words separated by one or more spaces. Word consists of Latin letters as well as other symbols (but not spaces).
In each word which starts from lowercase Latin letter replace starting letter with uppercase Latin letter.