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
Sherlock and Array | HackerRank Solution [Easy]
Challenge is to find an element of the array such that the sum of all elements to the left is equal to the sum of all elements to the right
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
map vs unordered_map in C++ Standard Template Library (STL)
Internally, the elements in the unordered_map are not sorted in any particular order with respect to either their key or values (unlike map)
nCr table | HackerRank Solution [Medium]
Jim is doing his discrete maths homework which requires him to repeatedly calculate nCr(n choose r) for different values of n
Max Min | HackerRank Solution [Medium]
Given a list of integers, arr, and a single integer k. Create an array of size k from elements of arr such that its unfairness is minimum
Common Child | Algorithms | HackerRank Solution [Medium]
Given two strings p and q of equal length, what’s the longest string that can be constructed such that it is a child of both?
Generate Parentheses – LeetCode Solution [Medium]
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
Sum of Left Leaves in Binary tree – LeetCode Solution [Easy]
Given the root of a binary tree, return the sum of all left leaves. Number of nodes in the tree lie in the range – [1, 1000]