In this post, we will solve HackerRank Funny String Problem Solution. In this challenge, you will determine whether a string is funny or not. To determine whether a string is funny, create a copy of the string in reverse e.g. abc → cba. Iterating through each string, compare the absolute difference in the ascii values…
In this post, we will solve HackerRank Separate the Numbers Problem Solution. A numeric string, s, is beautiful if it can be split into a sequence of two or more positive integers, a[1], a[2],…, a[n], satisfying the following conditions: Perform q queries where each query consists of some integer string s. For each query, print…
In this post, we will solve HackerRank Weighted Uniform Strings Solution. A weighted string is a string of lowercase English letters where each letter has a weight. Character weights are 1 to 26 from a to z as shown below: A pangram is a string that contains every letter of the alphabet. Given a sentence determine whether it is a pangram in the English…
In this post, we will solve HackerRank Pangrams Problem Solution. A pangram is a string that contains every letter of the alphabet. Given a sentence determine whether it is a pangram in the English alphabet. Ignore case. Return either pangram or not pangram as appropriate.Examples = ‘The quick brown fox jumps over the lazy dog’The…
In this post, we will solve HackerRank Quicksort 1 – Partition Problem Solution. The previous challenges covered Insertion Sort, which is a simple and intuitive sorting algorithm with a running time of O(n²). In these next few challenges, we’re covering a divide-and-conquer algorithm called Quicksort (also known as Partition Sort). This challenge is a modified…
In this post, we will solve HackerRank in a String! Problem Solution. We say that a string contains the word hackerrank if a subsequence of its characters spell the word hackerrank. Remeber that a subsequence maintains the order of characters selected from a sequence.More formally, let p[0], p[1],…, p[9] be the respective indices of h,…
In this post, we will solve HackerRank Running Time of Algorithms Solution. In a previous challenge you implemented the Insertion Sort algorithm. It is a simple sorting algorithm that works well with small or mostly sorted data. However, it takes a long time to sort large unsorted data. To see why, we will analyze its…
Read More “HackerRank Running Time of Algorithms Solution” »
In this post, we will solve HackerRank Mars Exploration Problem Solution. A space explorer’s ship crashed on Mars! They send a series of SOS messages to Earth for help. Letters in some of the SOS messages are altered by cosmic radiation during transmission. Given the signal received by Earth as a string, s, determine how many letters of the SOS message have…
In this post, we will solve HackerRank Caesar Cipher Problem Solution. Julius Caesar protected his confidential information by encrypting it using a cipher. Caesar’s cipher shifts each letter by a number of letters. If the shift takes you past the end of the alphabet, just rotate back to the front of the alphabet. In the…
In this post, we will solve HackerRank Correctness and the Loop Invariant Problem Solution. In the previous challenge, you wrote code to perform an Insertion Sort on an unsorted array. But how would you prove that the code is correct? I.e. how do you show that for any input your code will provide the right output? Loop…
In this post, we will solve HackerRank Insertion Sort – Part 2 Problem Solution. In Insertion Sort Part 1, you inserted one element into an array at its correct sorted position. Using the same approach repeatedly, can you sort an entire array? Guideline: You already can place an element into a sorted array. How can you use…
In this post, we will solve HackerRank Two Characters Problem Solution. Given a string, remove characters until the string is made up of any two alternating characters. When you choose a character to remove, all instances of that character must be removed. Determine the longest string possible that contains just two alternating letters.Examples = ‘abaacdabd’Delete…
