Min-Max String

You are initially given a collection of $N$ **distinct** strings. The $i^{th}$ string in the order of input, is assigned index $i$. (i.e. the first string is assigned index $1$, second string is assigned index $2$, …, the $N^{th}$ string is assigned index $N$). You have to process $Q$ queries. Each query can be of one of three types: - $1$ $x$ $c$ Insert a new string into the collection