Question d’entretien chez UiPath
1. current work and projects 2. deep dive in current work 3. DS problem (given an integer K, remove nodes form a binary tree having leaf node lesser than K distance from root)
1. current work and projects 2. deep dive in current work 3. DS problem (given an integer K, remove nodes form a binary tree having leaf node lesser than K distance from root)