Question d’entretien chez Affirm

Solve Shortest uncommon substring problem in preferred language