The interview process included a phone screening followed by a panel.

In the screening, they asked:

• Three ML questions
• One coding question (LeetCode medium–hard).

I solved the coding question using BFS and answered all the ML questions correctly, but in the end, they ghosted me.

Coding: You are given an integer array parent representing a forest of rooted trees with n nodes, where parent[i] is the parent of the i-th node.

• If parent[i] == i, then node i is the root of a tree.
• Otherwise, parent[i] < i, meaning that the parent always has a smaller index.

Every node has exactly one parent, except the root.

You are also given an integer nodeToDelete, representing a node to delete.

Your task is to delete nodeToDelete and all of its descendants from the forest. Deletion is done in-place by setting parent[x] = -1 for every deleted node x.

Return the updated parent array.