Given a BST, check if is balanced or not.
Solution: Wrote a recursive code to check the heights.

Find the contiguos substrings in a string S, with no duplicates.
Example: S=abcdabcd -> o/p:["a","ab","abc","abcd" ]
Solution: Used HashSet to check if the string is already seen or not.