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.
Home
Author
Terms
Privacy
About
Tumblr
Pinterest
Enable dark mode
Mathematics
Beeze Aal
02.Jul.2020
Hackerrank - Bus Station Solution
There are groups of friends, and each group is numbered from 1 to . The th group contains people. They live near a bus stop, and only a single bus operates on this route. An empty bus arrives at the bus stop and all the groups want to travel by the
Beeze Aal
02.Jul.2020
Hackerrank - K Candy Store Solution
Jim enters a candy shop which has N different types of candies, each candy is of the same price. Jim has enough money to buy K candies. In how many different ways can he purchase K candies if there are infinite candies of each kind? Input Format The first line
Beeze Aal
02.Jul.2020
Hackerrank - Diwali Lights Solution
On the eve of Diwali, Hari is decorating his house with a serial light bulb set. The serial light bulb set has N bulbs placed sequentially on a string which is programmed to change patterns every second. If at least one bulb in the set is on at any given
Beeze Aal
02.Jul.2020
Hackerrank - Is Fibo Solution
You are given an integer, . Write a program to determine if is an element of the Fibonacci sequence. The first few elements of the Fibonacci sequence are . A Fibonacci sequence is one where every element is a sum of the previous two elements in the sequence. The first two elements
Beeze Aal
01.Jul.2020
Hackerrank - Special Multiple Solution
You are given an integer N. Can you find the least positive integer X made up of only 9's and 0's, such that, X is a multiple of N? Update X is made up of one or more occurences of 9 and zero or more occurences of 0. Input Format
Beeze Aal
01.Jul.2020
Hackerrank - Best Divisor Solution
Kristen loves playing with and comparing numbers. She thinks that if she takes two different positive numbers, the one whose digits sum to a larger number is better than the other. If the sum of digits is equal for both numbers, then she thinks the smaller number is better. For
Beeze Aal
01.Jul.2020
Hackerrank - Reverse Game Solution
Akash and Akhil are playing a game. They have balls numbered from to . Akhil asks Akash to reverse the position of the balls, i.e., to change the order from say, 0,1,2,3 to 3,2,1,0. He further asks Akash to reverse the position of the
Beeze Aal
03.Jun.2020
Hackerrank - Alphabet Rangoli
You are given an integer, . Your task is to print an alphabet rangoli of size . (Rangoli is a form of Indian folk art based on creation of patterns.) Different sizes of alphabet rangoli are shown below: #size 3 ----c---- --c-b-c-- c-b-a-b-c --c-b-c-- ----c---- #size 5 --------e-------- ------e-d-e------ ----e-d-c-d-e---- --e-d-c-b-c-d-e-- e-d-c-b-a-b-c-d-e
Beeze Aal
03.Jun.2020
Hackerrank - String Formatting Solution
Given an integer, , print the following values for each integer from to : DecimalOctalHexadecimal (capitalized)BinaryThe four values must be printed on a single line in the order specified above for each from to . Each value should be space-padded to match the width of the binary value of . Input Format A
Beeze Aal
03.Jun.2020
Hackerrank - Filling Jars Solution
Animesh has N empty candy jars, numbered from 1 to N, with infinite capacity. He performs M operations. Each operation is described by 3 integers, a, b, and k. Here, a and b are indices of the jars, and k is the number of candies to be added inside each
Beeze Aal
03.Jun.2020
Hackerrank - Restaurant Solution
Martha is interviewing at Subway. One of the rounds of the interview requires her to cut a bread of size into smaller identical pieces such that each piece is a square having maximum possible side length with no left over piece of bread. Input Format The first line contains an
Beeze Aal
03.Jun.2020
Hackerrank - Connecting Towns Solution
Gandalf is travelling from Rohan to Rivendell to meet Frodo but there is no direct route from Rohan (T1) to Rivendell (Tn). But there are towns T2,T3,T4...Tn-1 such that there are N1 routes from Town T1 to T2, and in general, Ni routes from Ti to Ti+
More Posts