CircularListLongestNonRepeatSequence

find the longest sequence in a given
	circular list that doesn't contain duplicate element
coin sum

use minimum number of coins to get a given sum
Implement a LRU cache