Here are all the challenges from hacker rank that i have solved.
My aim is not just to solve to probllem but to find the most optimal solutions :)
Summary: Used hashedtable to simplify the time complexity to O(n)
Result:My hacker rank instance for birthday cake problem
Summary: Used hashmap to simplify the time complexity to O(n)
Result:My hacker rank instance for Ice cream parlor problem
Summary: used DFS for tree travesal and then located the top view using resursion
Result:My hacker rank instance for Tree top view problem
Summary: Insert a new node into a binary tree
Result:My hacker rank instance for Binary search tree insertion
Summary: calculate the max height of the tree
Result:My hacker rank instance for Binary search tree
Summary: find the lowest common ancestor for any two nodes
Result:My hacker rank instance for Binary search tree for Lowest Common Ancestor