Jump it up Solution | CodeChef [Easy]
Three dinos decide to play a game. In one move, one of the outer dinos can hop into a spot between the other two. Help them maximise their duration of play.
Category: Competitive Programming
RectangleArea Solution | CodeChef [Easy]
There are several sticks each 1 inch long. Your job is to form a rectangle with the biggest possible area, using these sticks as the perimeter.
Lucy and Flowers | HackerRank Solution [Medium]
The number of possible Binary Search Trees with n keys is Catalan Number (Cn). You could learn about Catalan Number & Binomial Coefficient.
Program for Nth Catalan Number
Catalan numbers (Cn) are a sequence of natural numbers. Nth Catalan number has applications in many counting problems.
How to calculate Binomial Coefficient (nCr) in O(r) time complexity
The recomputations in calculating binomial coefficient (nCr) can be avoided by exploiting optimal substructure and overlapping subproblems
Array Manipulation | HackerRank Solution [Hard]
Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array.
Palindrome Index | HackerRank Solution [Easy]
Given a string of lowercase letters in the range ascii[a-z], determine the index of a character that can be removed to make the string a palindrome
Sherlock and MiniMax | HackerRank Solution [Hard]
Given an integer range, for all M in that inclusive range, determine the minimum – abs(arr[i]-M) for all i
PacMan – DFS | HackerRank Solution [Easy]
Print all the nodes that you encounter while printing DFS tree. Then, print the distance ‘D’ between the source ‘P’ and the destination ‘.’
Reverse Shuffle Merge | HackerRank Solution [Advanced]
Given a string s such that, s ∈ merge(reverse(A), shuffle(A)) for some string A, find the lexicographically smallest A