hackerrank python

King Robert has 7 kingdoms under his rule. he gets to know from a raven that the Dothraki are going to wage a war against him soon. but, he knows the Dothraki need to cross the narrow river to enter his dynasty. there is only one bridge that

Given two integers:LAndR Limit L ≤ A ≤ B ≤ r, find outAXORB. Input Format The first line containsLThe first line containsR Data range 1 ≤ L ≤ r ≤103 Output Format Maximum exclusive or sum of outputs Question: 1 import java.io.*; 2 import java.util.

Link: Pairs This is the deformation of the two sum problem! The two sum problem requires that the two numbers in the array and the number is exactly equal to K. This is to find that the difference between the two numbers in the array is exactly

Find digits Problem Statement Given a number you have to print how many digits in that number exactly divides that number. Input Format The first line contains t (number of test cases followed by T lines each containing N Constraints 1 0 Output

Sunny and Johnny together have M dollars which they intend to use at the ice cream parlour. among n flavors available, they have to choose two distinct flavors whose cost equals m. given a list of cost of N flavors, output the indices of two items

One classic method for composing secret messages is called a square code. the spaces are removed from the English text and the characters are written into a square (or rectangle ). the width and height of the rectangle have the constraint, Floor

First I was stuck at what represent state of ' Add all except I '. But after checking editorial, it's simply inverted Coin change problem.#include #include#include#include#includeusing namespacestd;#defineMOD 1000000007#defineMax_val 2000intMain () {

A trickier Dijkstra.#include #include#include#includestring>#include#include#include#include#includeusing namespacestd;Const intINF = std::numeric_limitsint>:: Max (); typedef pairint,int> Node;//index-diststructcomp{int operator() (ConstNode

Question Link Median Dynamic Max score: 67 The medianMNumbers is defined as the middle number after sorting them in order ifMIs odd or the average number of the middle 2 numbers (again after sorting) IfMIs even. You have an emptyNumber list at

In Haskell. Points:1. Pruning 2. Int suffers from overflow. Integer it is.Getpowersum:: integer-(integer)--Integergetpowersum _ [] _ =0getpowersum TGT cand start = case Compare TGT start ofEQ-1LT-0GT- LetNewcand = Filter (>start) candinch

Actually I think problem statement is somewhat misleading. No need to mention range [L, R] @ all.The intention is a variation to "largest Rectangle" which are a classic stack problem on Leetcode.But you need to run largest Rectangle twice:increased

XOR-0 is the key (make it even pair): http://www.cnblogs.com/lautsie/p/3908006.htmlSomething to learn about basic Game theory:http://www.cdf.toronto.edu/~ajr/270/probsess/03/strategy.htmlYou can see, it's all on state (bit) toggling.#include

Same as Lintcode "Sliding window Median", but requires + care on details-no trailing zeroes.#include #includeSet>#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing

Transmission DoorIce Cream Parlorauthored by Dheeraj on Mar Problem StatementSunny and Johnny together has M dollars they want to spend on ice cream. The parlor offers N flavors, and they want to choose. Flavors So, they end up spending the whole

1.You is given a table, Projects, containing three columns: task_id, start_date and End_da Te. It is guaranteed that the difference between the end_date and the start_date are equal to 1 Day For each row in the table.If the end_date of the tasks is

Question connection: Sherlock and minimax Watson gives Sherlock an arrayA1, a2....He asks him to find an integerMBetweenPAndQ(BOTH aggressive), such that,Min {| ai-M |, 1 ≤ I ≤ n}Is maximized. If there are multiple solutions, print the smallest one.

In this challenge you need to print the data that accompanies each integer in a list. in addition, if two strings have the same integers, You need to print the strings in their original order. hence, your Sorting Algorithm shocould beStable, I. e.

Question connection: Game of Rotation Mark is an undergraduate student and he is interested in rotation. a conveyor belt competition is going on in the town which mark wants to win. in the competition, there's a conveyor belt which can be

Change language: Manasa and her friends go hiking. She found a small river lined up with stones with numerical values. She began to walk along the river and found that the numbers on the adjacent two stones increased.AOrBThere is a treasure at the

Animesh hasNEmpty candy jars, numbered from 1N, With infinite capacity. He performsMOperations. Each operation is described by 3 IntegersA, BAndK. Here,AAndBAre index of the jars, andKIs the number of candies to be added inside each jar whose index