Question d’entretien chez Genesys

Coding question - Largest subsequence sum in a tree for a given path.