## 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

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

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

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

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

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

Ram Kripal Algorithm Algorithm, Sorting 0

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

Ram Kripal Algorithm Algorithm 0

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

Ram Kripal Algorithm Algorithm 0

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

Ram Kripal Algorithm Algorithm, Sorting 0

Bubble sort is the simplest sorting algorithm. It works by iterating the input array from the first element to last. We compare each pairs of elements and swapping them if they are in wrong order.

Ram Kripal Algorithm Algorithm 0

The word algorithm is come from the name of a Persian author, Abu Ja’far Mohammed Ibn Musa al Khowarizmi, who wrote a text book on mathematics. This word Algorithm has a special significance