Question d’entretien chez Amazon

Diagonal Traversal of Binary Tree Maximum common sub-string