# CategoryCoding Challenge

## HackerRank âAnagramâ Solution

H

Short Problem Definition:
Sid is obsessed with reading short stories. Being a CS student, he is doing some interesting frequency analysis with the books. He chooses strings S1 and S2 in such a way that |len(S1)âlen(S2)|â€1
Anagram
Complexity:
time complexity is O(N)
space complexity is O(N)
Execution:
Compare the frequency counts of the two parts.
Solution:

## HackerRank âAngryProfessorâ Solution

H

Short Problem Definition: The professor is conducting a course on Discrete Mathematics to a class of N students. He is angry at the lack of their discipline, and he decides to cancel the class if there are less than K students present after the class starts. Given the arrival time of each student, your task is to find out if the class gets cancelled or not. Link Angry Professor Complexity: time...

## HackerRank âApple and Orangeâ Solution

H

Short Problem Definition: Samâs house has an apple tree and an orange tree that yield an abundance of fruit. In the diagram below, the red region denotes his house, where s is the start point, and i is the endpoint. The apple tree is to the left of his house, and the orange tree is to its right. You can assume the trees are located on a single point, where the apple tree is at point a, and the...

## HackerRank âBalanced Parenthesesâ Solution

H

Short Problem Definition: Given a sequence consisting of parentheses, determine whether the expression is balanced. Link Balanced Parentheses Complexity: time complexity is O(N) space complexity is O(N) Execution: Equivalent to Codility Brackets. Solution: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 def isValidPair(left...

## HackerRank âBetween Two Setsâ Solution

H

Short Problem Definition: You will be given two arrays of integers and asked to determine all integers that satisfy the following two conditions: The elements of the first array are all factors of the integer being considered The integer being considered is a factor of all elements of the second array Link Between Two Sets Complexity: time complexity is O(A* (N+M)) space complexity is O(1)...

## HackerRank âBigger is Greaterâ Solution

H

Short Problem Definition: Given a word w, rearrange the letters of w to construct another word in such a way that is lexicographically greater than w. In case of multiple possible answers, find the lexicographically smallest one among them. Link Bigger is Greater Complexity: time complexity is O(N) space complexity is O(N) Execution: This task challenges us to find the next...

## HackerRank âBirthday Cake Candlesâ Solution

H

Short Problem Definition: Calculate and print the sum of the elements in an array, keeping in mind that some of those integers may be quite large. Link A Very Big Sum Complexity: time complexity is O(N) space complexity is O(1) Execution: Just add all of this together. No magic. Solution: 1 2 3 4 5 #!/usr/bin/py if __name__ == '__main__':     t = input()...

## HackerRank âBirthday Chocolateâ Solution

H

Short Problem Definition: The member states of the UN are planning to send 2 people to the moon. They want them to be from different countries. You will be given a list of pairs of astronaut IDâs. Each pair is made of astronauts from the same country. Determine how many pairs of astronauts from different countries they can choose from. Link Birthday Chocolate Complexity: time complexity is O(N)...