You've successfully subscribed to The Poor Coder | Hackerrank Solutions
Great! Next, complete checkout for full access to The Poor Coder | Hackerrank Solutions
Welcome back! You've successfully signed in.
Success! Your account is fully activated, you now have access to all content.
Beeze Aal

Beeze Aal

I am a poor coder.

Beeze Aal

Hackerrank - The Coin Change Problem Solution

You are working at the cash counter at a fun-fair, and you have different types of coins available to you in infinite quantities. The value of each coin is already given. Can you determine the number of ways of making change for a particular number of units using the given
Beeze Aal

Hackerrank - Candies Solution

Alice is a kindergarten teacher. She wants to give some candies to the children in her class.  All the children sit in a line and each of them has a rating score according to his or her performance in the class.  Alice wants to give at least 1 candy to
Beeze Aal

Hackerrank - Largest Permutation Solution

You are given an unordered array of unique integers incrementing from . You can swap any two elements a limited number of times. Determine the largest lexicographical value array that can be created by executing no more than the limited number of swaps. For example, if  and the maximum swaps , the
Beeze Aal

Hackerrank - Fibonacci Modified Solution

We define a modified Fibonacci sequence using the following definition: Given terms  and  where , term  is computed using the following relation:For example, if  and , ,,,and so on.Given three integers, , , and , compute and print the  term of a modified Fibonacci sequence. Function Description Complete the fibonacciModified function in the
Beeze Aal

Hackerrank - Bonetrousle Solution

Here's a humerus joke: Why did Papyrus the skeleton go to the store by himself? Because he had no body to go with him!Did you like it? Don't worry, I've got a ton more. A skele-ton. Once upon a time, Papyrus the skeleton went to buy some pasta from
Beeze Aal

Hackerrank - Common Child Solution

A string is said to be a child of a another string if it can be formed by deleting 0 or more characters from the other string. Given two strings of equal length, what's the longest string that can be constructed such that it is a child of both? For
Beeze Aal

Hackerrank - Sparse Arrays Solution

There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. For example, given input  and , we find  instances of ',  of '' and  of ''. For each query, we add an
Beeze Aal

Hackerrank - Gaming Array Solution

Andy wants to play a game with his little brother, Bob. The game starts with an array of distinct integers and the rules are as follows: Bob always plays first and the two players move in alternating turns.In a single move, a player chooses the maximum element currently present
Beeze Aal

Hackerrank - Validating and Parsing Email Addresses Solution

A valid email address meets the following criteria: It's composed of a username, domain name, and extension assembled in this format: [email protected] username starts with an English alphabetical character, and any subsequent characters consist of one or more of the following: alphanumeric characters, -,., and _.The domain and
Beeze Aal

Hackerrank - Nikita and the Game Solution

Nikita just came up with a new array game. The rules are as follows: Initially, Nikita has an array of integers.In each move, Nikita must partition the array into  non-empty contiguous parts such that the sum of the elements in the left partition is equal to the sum of
Beeze Aal

Hackerrank - Stock Maximize Solution

Your algorithms have become so good at predicting the market that you now know what the share price of Wooden Orange Toothpicks Inc. (WOT) will be for the next number of days. Each day, you can either buy one share of WOT, sell any number of shares of WOT that
Beeze Aal

Hackerrank - The Captain's Room Solution

Mr. Anant Asankhya is the manager at the INFINITE hotel. The hotel has an infinite amount of rooms. One fine day, a finite number of tourists come to stay at the hotel. The tourists consist of: → A Captain. → An unknown group of families consisting of  members per group where  ≠ . The