In this post, we will solve HackerRank Bear and Steady Gene Problem Solution. A gene is represented as a string of length n (where n is divisible by 4), composed of the letters A, C, T. and G. It is considered to be steady if each of the four letters occurs exactly times. For example,…
In this post, we will solve HackerRank Common Child Problem Solution. A string is said to be a child of a another string if it can be formed by deleting 0 or more characters from the other string. Letters cannot be rearranged. Given two strings of equal length, what’s the longest string that can be…
In this post, we will solve HackerRank Sherlock and Anagrams Problem Solution. Two strings are anagrams of each other if the letters of one string can be rearranged to form the other string. Given a string, find the number of pairs of substrings of the string that are anagrams of each other.Examples = momThe list…
In this post, we will solve HackerRank Maximum Palindromes Problem Solution. Madam Hannah Otto, the CEO of Reviver Corp., is fond of palindromes, or words that read the same forwards or backwards. She thinks palindromic brand names are appealing to millennials.As part of the marketing campaign for the company’s new juicer called the Rotator™, Hannah…
In this post, we will solve HackerRank Highest Value Palindrome Solution. Palindromes are strings that read the same from the left or right, for example madam or 0110.You will be given a string representation of a number and a maximum number of changes you can make. Alter the string, one digit at a time, to…
In this post, we will solve HackerRank Sherlock and the Valid String Solution. Sherlock considers a string to be valid if all characters of the string appear the same number of times. It is also valid if he can remove just 1 character at 1 index in the string, and the remaining characters will occur…
Read More “HackerRank Sherlock and the Valid String Solution” »
In this post, we will solve HackerRank String Construction Problem Solution. Amanda has a string of lowercase letters that she wants to copy to a new string. She can perform the following operations with the given costs. She can perform them any number of times to construct a new string p: Function Description Complete the stringConstruction function…
Read More “HackerRank String Construction Problem Solution” »
In this post, we will solve HackerRank Two Strings Problem Solution. Given two strings, determine if they share a common substring. A substring may be as smallas one character.Examples1 = ‘and’s2 = ‘art’These share the common substring a.s1 = ‘be’s2 = ‘cat’These do not share a substring. Function Description Complete the function twoStrings in the editor below….
In this post, we will solve HackerRank Game of Thrones – I Problem Solution. Dothraki are planning an attack to usurp King Robert’s throne. King Robert learns of this conspiracy from Raven and plans to lock the single door through which the enemy can enter his kingdom. But, to lock the door he needs a…
Read More “HackerRank Game of Thrones – I Problem Solution” »
In this post, we will solve HackerRank Making Anagrams Problem Solution. We consider two strings to be anagrams of each other if the first string’s letters can be rearranged to form the second string. In other words, both strings must contain the same exact letters in the same exact frequency. For example, bacdc and dcbac…
In this post, we will solve HackerRank Anagram Problem Solution. Two words are anagrams of one another if their letters can be rearranged to form the other word.Given a string, split it into two contiguous substrings of equal length. Determine the minimum number of characters to change to make the two substrings into anagrams of…
In this post, we will solve HackerRank Fraudulent Activity Notifications Problem Solution. HackerLand National Bank has a simple policy for warning clients about possible fraudulent account activity. If the amount spent by a client on a particular day is greater than or equal to 2x the client’s median spending for a trailing number of days,…
