CategoryCoding Challenge

HackerRank ‘Sherlock and Array’ Solution

H

Short Problem Definition: Watson gives Sherlock an array A of length N. Then he asks him to determine if there exists an element in the array such that the sum of the elements on its left is equal to the sum of the elements on its right. If there are no elements to the left/right, then the sum is considered to be zero.Formally, find an i, such that, A1+A2…Ai-1 =Ai+1+Ai+2…AN Link Sherlock and...

HackerRank ‘Sherlock and GCD’ Solution

H

Short Problem Definition: Sherlock is stuck while solving a problem: Given an array A={a1,a2,..aN}, he wants to know if there exists a subset, B={ai1,ai2,…aik} where 1≤i1<i2<…<ik≤N… Link Sherlock and GCD Complexity: time complexity is O(N); space complexity is O(1) Execution: A subset has no common divisor if the GCD equals 1. There is an interesting fact that leads to my solution: If...

HackerRank ‘Sherlock and Pairs’ Solution

H

Short Problem Definition: Sherlock is given an array of N integers A0, A1 … AN-1 by Watson. Now Watson asks Sherlock how many different pairs of indices i and j exist such that i is not equal to j but Ai is equal to Aj. That is, Sherlock has to count total number of pairs of indices (i, j) where Ai = Aj AND i ≠ j. Link Sherlock and Pairs Complexity: time complexity is O(n) space complexity is...

HackerRank ‘Sherlock and Squares’ Solution

H

Short Problem Definition: Watson gives two integers A & B to Sherlock and asks if he can count the number of square integers between A and B (both inclusive). A square integer is an integer which is the square of any integer. For example, 1, 4, 9, 16 are some of the square integers as they are squares of 1, 2, 3, 4 respectively. Link Sherlock and Squares Complexity: time complexity is O(sqrt(N));...

HackerRank ‘Sherlock and The Beast’ Solution

H

Short Problem Definition: Sherlock Holmes suspects his archenemy, Professor Moriarty, is once again plotting something diabolical. Sherlock’s companion, Dr. Watson, suggests Moriarty may be responsible for MI6’s recent issues with their supercomputer, The Beast. Shortly after resolving to investigate, Sherlock receives a note from Moriarty boasting about infecting The Beastwith a virus; however...

HackerRank ‘Pairs’ Solution

H

Short Problem Definition: Given N integers, count the number of pairs of integers whose difference is K. Link Pairs Complexity: time complexity is O(N*log(N)) space complexity is O(N) Execution: The solution is pretty straight-forward, just read the code :). The runtime complexity is calculated with log(N) access times for tree-based sets (not the case in Python). Solution: 1 2 3 4 5 6 7 8 9...

HackerRank ‘Sherlock and Watson’ Solution

H

Short Problem Definition: John Watson performs an operation called Right Circular Rotation on an integer array [a0, a1, … an-1]. Right Circular Rotation transforms the array from [a0, a1, … aN-1] to [aN-1, a0,… aN-2]. He performs the operation K times and tests Sherlock’s ability to identify the element at a particular position in the array. He asks Q queries. Each query consists of one integer...

HackerRank ‘Palindrome Index’ Solution

H

Short Problem Definition: You are given a string of lower case letters. Your task is to figure out the index of the character on whose removal it will make the string a palindrome. There will always be a valid solution. Link Palindrome Index Complexity: time complexity is O(N) space complexity is O(N) Execution: The solution seems n^2 but isPalindrome is executed only once. Due to the problem...

Archives

Categories