Perform boundary trversal on a given binary tree.
Given a linked list, reverse the direction of nodes in the list.
Delete a node from BST (Binary Search Tree) such that the resultant tree is also a BST.
Given a linked list, check if it has a loop. If yes, remove the loop.
Given two time values, generate the time difference string.