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.

I got an email and they set up an online interview. First step was coding interview. It was online. Two medium to hard Leetcode problems. one question was sorting.