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

Ravi Kant Algorithm Algorithm, Code Jam17 0

Given a long number and you have to determine a number which is smaller than the number (or equal) as well as its digits must be arranged in non-decreasing order.

Ravi Kant Algorithm Algorithm, Code Jam17 0

Last year, the Infinite House of Pancakes introduced a new kind of pancake. It has a happy face made of chocolate chips on one side (the “happy side”), and nothing on the other side (the “blank side”).

Ravi Kant Algorithm, Artificial Intelligence Artificial Intelligence, Game Theory 0

The prisoner’s dilemma refers to a situation, wherein an individual has to choose between self-interest and mutual interest.The prisoner’s dilemma is a standard

Ravi Kant Algorithm, Hacker Rank Algorithm, CodeSprint, Hacker Rank 0

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

1 2