1. Basic Intro 2. Question regarding the greedy approach to filling gaps in the elements. You have been provided with 3 arguments of n, m, o, you can use at most those numbers of times "m", "n" and "o" and build the max string using those characters such that no 3 same elements come together. The second question was on binary search with memoisation.