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.
Welcome to my blog The Poor Coder. Here you can find hackerrank Solutions and various programming tutorials on NodeJs, VueJs, Python, Javascript, HTML and more.
Beeze Aal

## HackerEarth - The colorful street Solution

There is a street by the name of a colorful street in Pretty Town. The residents of the house have decided that they will paint their houses in either Pink, Orange, or Yellow color and not other. They have also decided that no two adjacent houses will have the same
Beeze Aal

## HackerEarth - Josh and Hotel Solution

Josh owns a hotel, there are X rooms in the hotel and every room can be allocated to maximum 1 person at a time. If a customer arrives and there are no rooms available, the customer will leave the hotel without staying, thus causing loss to his hotel. Input consists
Beeze Aal

## HackerEarth - Chandu and his game Solution

After setting up the area and his toys. Chandu is up for playing his very first game. His first game is played on a N X N board with some initial stones placed on each cell. He can move each stone in all four direction i.e up,down, left
Beeze Aal

## Hackerrank - Minimum Time Required Solution

You are planning production for an order. You have a number of machines that each have a fixed number of days to produce an item. Given that all the machines operate simultaneously, determine the minimum number of days to produce the required order. For example, you have to produce Â items.
Beeze Aal

## HackerEarth - Shil, and Palindrome Solution

Shil is your new boss and he likes palindromes very much. Palindrome is a string that can be read the same way in either direction, from the left to the right and from the right to the left. (ex. madam , aabaa, racecar) Given a string S , beautiful Palindrome is a
Beeze Aal

## HackerEarth - Gotta catch 'em all! Solution

Little Arihant has always wanted to be the best Pokemon trainer in this world. And he thinks he has achieved his goal, so he wants to quickly go and meet Professor Oak and verify this fact. But like all Pokemon trainers, he has a weird habit, too. He catches Pokemons
Beeze Aal

## HackerEarth - Repeated K Times Solution

Given a List of N number a1,a2,a3........an, You have to find the smallest number from the List that is repeated in the List exactly K number of times. Input Format First Line of Input Contain Single Value N, Size of List Second Line of Input Contain N
Beeze Aal

## HackerEarth - Golden rectangles Solution

You have N rectangles. A rectangle is golden if the ratio of its sides is in between [1.6,1.7], both inclusive. Your task is to find the number of golden rectangles. Input format First line: Integer N denoting the number of rectanglesEach of the N following lines: Two
Beeze Aal

## HackerEarth - Maximum Sum Solution

You are given an array of integers A, you need to find the maximum sum that can be obtained by picking some non-empty subset of the array. If there are many such non-empty subsets, choose the one with the maximum number of elements. Print the maximum sum and the number
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

## HackerEarth - Special Sum Solution

Special Sum of number N is defined as follows: def foo(n): { }