In this post, we will solve HackerRank Training the army Problem Solution. In the magical kingdom of Kasukabe, people strive to possess skillsets. Higher the number of skillset present among the people, the more content people will be.There are N types of skill set present and initially there exists C, people possessing ith skill set,…
In this post, we will solve HackerRank Huarongdao Problem Solution. Huarongdao is a well-known game in China. The purpose of this game is to move the Cao Cao block out of the board. Acme is interested in this game, and he invents a similar game. There is a N*M board. Some blocks in this board…
In this post, we will solve HackerRank HackerX Problem Solution. Update: A slight modification in the problem statement (see below) Evil Nation A is angry and plans to launch N guided-missiles at the peaceful Nation B in an attempt to wipe out all of Nation B’s people. Nation A’s missile i will arrive in nation B at time ti. Missile i communicates…
In this post, we will solve HackerRank Hacker Country Problem Solution. There are N cities in Hacker Country. Each pair of cities are directly connected by a unique directed road, and each road has its own toll that must be paid every time it is used. You’re planning a road trip in Hacker Country, and its itinerary must satisfy…
In this post, we will solve HackerRank Quadrant Queries Problem Solution. There are n points on a plane. Each point p[i] is described by [x[i], y[i]], where 1 ≤ i ≤n. There are three types of queries needed: Given a set of n points and q queries, perform each query in order. For example, given…
In this post, we will solve HackerRank Jogging Cats Problem Solution. It’s almost summertime, so Big Cat and Little Cat are getting in shape. They decide the core of their fitness plan is to start jogging every day.Their city consists of N Intersections connected by M bidirectional roads. The cats decide that their jogging route…
In this post, we will solve HackerRank Favorite sequence Problem Solution. Johnny, like every mathematician, has his favorite sequence of distinct natural numbers. Let’s call this sequence M. Johnny was very bored, so he wrote down N copies of the sequence M in his big notebook. One day, when Johnny was out, his little sister…
In this post, we will solve HackerRank DAG Queries Problem Solution. You are given a Directed Acyclic Graph (DAG) with n vertices and m edges. Each vertex v has an integer, a,, associated with it and the initial value of a, is 0 for all vertices. You must perform q queries on the DAG, where…
In this post, we will solve HackerRank Tree Flow Problem Solution. Recall that a tree is an undirected, connected acyclic graph. We have a weighted tree, T with n vertices; let distuv be the total sum of edge weights on the path between nodes u and v. Input FormatThe first line contains a single positive…
In this post, we will solve HackerRank Tripartite Matching Problem Solution. You are given 3 unweighted, undirected graphs, G1, G2, and G3. with n vertices each, where the kth graph has my edges and the vertices in each graph are numbered from 1 through n. Find the number of ordered triples (a, b, c), where…
Read More “HackerRank Tripartite Matching Problem Solution” »
In this post, we will solve HackerRank Jumping Rooks Problem Solution. Nina has an n x n chessboard and k jumping rooks. Every cell of the chessboard is either blocked or free, and Nina can only put a single rook in any free cell.Two jumping rooks beat each other if they are either in the…
In this post, we will solve HackerRank Liars Problem Solution. You have N soldiers numbered from 1 to N. Each of your soldiers is either a liar or a truthful person. You have M sets of information about them. Each set of information tells you the number of liars among a certain range of your…
