In this post, we will solve HackerRank Marc’s Cakewalk Problem Solution. Marc loves cupcakes, but he also likes to stay fit. Each cupcake has a calorie count, and Marc can walk a distance to expend those calories. If Marc has eaten j cupcakes so far. after eating a cupcake with e calories he must walk…
In this post, we will solve HackerRank Minimum Absolute Difference in an Array Problem Solution. The absolute difference is the positive difference between two values a and b, is written labor bal and they are equal. If a = 3 and b = 2, 3-2 = 2-3 = 1. Given an array of integers, find…
Read More “HackerRank Minimum Absolute Difference in an Array” »
In this post, we will solve HackerRank Definite Random Walks Problem Solution. Alex has a board game consisting of: Input FormatThe first line contains three space-separated integers describing the respective values of n (the number of positions), m (the number of die faces), and (the number of turns). The second line contains n space-separated integers…
In this post, we will solve HackerRank Airports Problem Solution. Airports are being built on a straight road according to a new construction plan. For convenience, imagine a number line on which at different points airports can be positioned. Because a plane can’t take off and start landing immediately, there will be flight between two…
In this post, we will solve HackerRank Diameter Minimization Problem Solution. We define the diameter of a strongly-connected oriented graph, G = (V,E), as the minimum integer & such that for each u, v EG there is a path from u to v of length <d (recall that a path’s length is its number of…
In this post, we will solve HackerRank Ticket Problem Solution. There are n people at the railway station, and each one wants to buy a ticket to go to one of k different destinations. Then people are in a queue.There are m ticket windows from which tickets can be purchased. Then people will be distributed…
In this post, we will solve HackerRank Tree Splitting Problem Solution. Given a tree with vertices numbered from 1 to n. You need to process m queries. Each query represents a vertex number encoded in the following way:Queries are encoded in the following way: Let. m, be the jth query and ans, be theanswer for…
In this post, we will solve HackerRank Going to the Office Problem Solution. Ms.Kox enjoys her job, but she does not like to waste extra time traveling to and from her office. After working for many years, she knows the shortest-distance route to her office on a regular day. Recently, the city began regular maintenance…
Read More “HackerRank Going to the Office Problem Solution” »
In this post, we will solve HackerRank Road Network Problem Solution. Fedor is a research scientist, who has recently found a road map of Ancient Berland. Ancient Berland consisted of N cities that were connected by M bidirectional roads. The road builders weren’t knowledgable. Hence, the start city and the end city for each road were always chosen randomly and…
In this post, we will solve HackerRank Travelling Salesman in a Grid Problem Solution. The travelling salesman has a map containing m*n squares. He starts from the top left corner and visits every cell exactly once and returns to his initial position (top left). The time taken for the salesman to move from a square…
Read More “HackerRank Travelling Salesman in a Grid Solution” »
In this post, we will solve HackerRank Drive Problem Solution. HackerRank is starting a bus service in MountainView, California. The bus starts at time T = 0 at station1 and goes through station2, station3, station4 in that order and reaches the headquarters located at stationn. At every station, the bus waits for various commuters to arrive before it departs to the next station….
In this post, we will solve HackerRank Vertical Paths Problem Solution. You have a rooted tree with n vertices numbered from 1 through n where the root is vertex1.You are given m triplets, the jth triplet is denoted by three integers uj, vj, Cj. The th triplet represents a simple path in the tree with…
