1)secret santa , circle of houses with children , santa has to give gifts to children so that no 2 adjacent houses should get gifts. calculate max number of gifts santa can give
//similar to house robber dynamic programming in leetcode
2)number of pairs formed from the given array , where a[i]%a[j]=0 or a[j]%a[i]=0
3)longest palindrome substring