TheCScience is a blog that publishes daily tutorials and guides on engineering subjects and everything that related to computer science and technology
In this HackerEarth Permutations, problem solution you are given a permutation A = {a1,a2,a3,…aN} of N integers from 0 to N – 1. You are also given Q queries of the following two forms: X Y: Swap (ax, ay) L R K: Print MexK (aL,….,aR) Here, MexK(aL,…,aR) = Kth smallest non-negative integer that is not available in…
In this HackerEarth Inverse List problem solution, There are many ways to order a list of integers from 1 to n. For example, if n = 3, the list could be : [3 1 2]. But there is a special way to create another list from the given list of integers. In this list, the position of…
In this HackerEarth Good String problem solution we have given a string S, print the minimum number of characters you have to remove from the string S to make it a good string. A good string is a string in which all the characters are distinct. HackerEarth Good String problem solution. #include <bits/stdc++.h> #define ll long long…
In this HackerEarth Development Cost problem solution, A country is represented as a matrix of the size N x M and each cell is considered to be a city. There are Q missions and you are required to accomplish K missions to receive the tourist certification. In each mission, you are given a source and destination and you…
In this HackerEarth Power of String problem solution For a given integer K and a string S of length N, we denote the power of S, as the length of the longest substring occurring in S at least K times. Given K and S, find the power of S. HackerEarth Power of String problem solution. #include <cstdio> #include…
In this HackerEarth Make Paths problem solution Walter White and Jesse Pinkman have now established their bases at different places. Now they want to form a network, that is, they want that all their bases should be reachable from every base. Bases are supposedly based on a 2-D plane having integer coordinates. The cost of building tunnels between…
In this HackerEarth Mathison and the problem of the Pokemon fight solution, Mathison has decided to become a Pokémon master. In order to do that he has to gain some experience by fighting in a lot of tournaments, some of which can take quite a lot of time. Recently, he has signed up for a new one,…
Read More “HackerEarth Mathison and the Pokémon fights problem solution” »
In this HackerEarth Tree tearing problem solution, You are given a tree consisting of N vertices. What is the minimum number of vertices that should be removed so that all the remaining parts of the initial tree will contain less than K vertices? HackerEarth Tree tearing problem solution. #include <cstdio> #include <algorithm> #include <vector> #include <iostream> #include…