# Series Update

Series Update is the last problem of the HackerRank Contest GOC-18. It is a hard label problem. The minimum requirement to solve this problem is the knowledge of Binary Indexed Tree. Time complexity Read More

# Happiness Counter

Happiness Counter is the fourth problem of the HackerRank Contest GOC-18. It is a hard problem. The minimum requirement to solve this problem is the knowledge of dynamic programming. To solve this problem Read More

# Drawing Red Out

Drawing Red Out is the third problem of the HackerRank Contest GOC-18. It is a medium label problem. The minimum requirement to solve this problem is the knowledge of probability, Bayes Theorem, and Read More

# Product of Modulus Pairs

Product of Modulus Pairs is the second problem of the HackerRank Contest GOC-18. It is an easy problem. The minimum requirement to solve this problem is the knowledge of for loop and modular arithmetic. Time complexity Read More

# Guess 2 or 5

Guess 2 or 5 is the first problem of the HackerRank Contest GOC-18. It is an easy problem. The minimum requirement to solve this problem is the knowledge of if-else. Time complexity Read More

# Insertion Sort Algorithm

Insertion sort is a simple and efficient sorting algorithm that works the way we sort playing cards in our hands. It is based on the idea that one element from the input elements is consumed in each iteration Read More

# Problem on Master Method

In this post I am going to discuss how to use Master Method for solving the recurrence relation. If you are not familiar with the master method see the link Introduction to Master Method. Lets review the three cases Read More

# Master Method for Solving Recurrence

When analyzing algorithm we only care about the asymptotic behavior. Recursive Algorithm are no different. Rather than solving the recurrence relation associated with the cost of an algorithm, it is Read More