Short Problem Definition: Find the number of ways that a given integer, XÂ , can be expressed as the sum of the NthÂ powers of unique, natural numbers. For example, if X = 13Â and N = 2, we have to find all combinations of unique squares adding up to 13. The only solution is 2^2 + 3^2. Link The Power Sum Complexity: time complexity is O(N!) space complexity is O(1) Execution: This solution does not...

## HackerRank âThe Time In Wordsâ Solution

Short Problem Definition:

Given the time in numerals we may convert it into words.

Link

The Time In Words

Complexity:

time complexity is O(?)

space complexity is O(?)

Execution:

I might have hinted at my opinion in the past: Why do âchallengesâ like this even exist? It requires 0 brain power, but you will spend an hour figuring out the fine details of English and fixing bugs.

Solution:

## HackerRank âTime Conversionâ Solution

Short Problem Definition: You are given time in AM/PM format. Convert this into a 24 hour format. Link Time Â Conversion Complexity: time complexity is O(?) space complexity is O(?) Execution: Transforming date formats without the use of the proper libraries is a disaster waiting to happen. Date formats are ever changing and a waste of engineering effort. Just use whatever package comes with your...

## HackerRank âTwo Stringsâ Solution

Short Problem Definition:

You are given two strings, A and B. Find if there is a substring that appears in both A and B.

Link

Two Strings

Complexity:

time complexity is O(N+M);

space complexity is O(1)

Execution:

At first sight this seems like a longest common substring problem. It is actually much easier. You just need to find out if there are two equal letters in both strings A and B.

Solution:

## HackerRank âUtopian Treeâ Solution

Short Problem Definition: The Utopian Tree goes through 2 cycles of growth every year. The first growth cycle occurs during the spring, when it doubles in height. The second growth cycle occurs during the summer, when its height increases by 1 meter. Â Now, a new Utopian Tree sapling is planted at the onset of spring. Its height is 1 meter. Can you find the height of the tree after N growth cycles...

## HackerRank âWaiterâ Solution

Short Problem Definition: You are a waiter at a party. There are NN stacked plates. Each plate has a number written on it. You start picking up the plates from the top one by one and check whether the number written on the plate is divisible by a primeâŚ. Link Waiter Complexity: time complexity isÂ O(N*Q) space complexity is O(N) Execution: First of all, generate primes using Sieve, or copy-paste a...

## HackerRank âWeighted Uniform Stringsâ Solution

Short Problem Definition: A weighted string is a string of lowercase English letters where each letter has a weight. Character weights are 1 to 26 from a to zâŚ Link Weighted Uniform String Complexity: time complexity is O(N) space complexity is O(N) Execution: Parsing the string for every query is suboptimal, so I first preprocess the string. Now we know that uniform...

## HackerRank âStaircaseâ Solution

Short Problem Definition: Your teacher has given you the task to draw the structure of a staircase. Being an expert programmer, you decided to make a program for the same. You are given the height of the staircase. Link Staircase Complexity: time complexity is O(N^2) space complexity is O(1) Execution: Either fill each level with N-i empty spaces or adjust to the right. Solution: 1 2 3 4 5 6 7 8...

## HackerRank âString Constructionâ Solution

Short Problem Definition: Amanda has a string of lowercase letters that she wants to copy to a new string. She can perform the following operations with the given costs. She can perform them any number of times to construct a new string p: Append a character to the end of string p at a cost of 1 dollar. Choose any substring of p and append it to the end of at...

## HackerRank âStrong Passwordâ Solution

Short Problem Definition: Louise joined a social networking site to stay in touch with her friends. The signup page required her to input a name and a password. However, the password must be strong. The website considers a password to be strong if it satisfies the following criteria: Its length is at least 6. It contains at least one digit. It contains at least one...