Domanda di colloquio di Affirm

Solve Shortest uncommon substring problem in preferred language