Acudí a una entrevista en Pinterest (Calimesa, CA)
Entrevista
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. 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.
Preguntas de entrevista [1]
Pregunta 1
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.
Acudí a una entrevista en Pinterest (New York, NY)
Entrevista
recruiter reached out discussed teams during call, one technical round leetcode round, probably leetcode medium, then followed by onsite of five or six rounds mainly technical rounds with hiring manager call as well
Envié una solicitud electrónica. El proceso duró 4 semanas. Acudí a una entrevista en Pinterest en ago 2025
Entrevista
The interview process had a phone screening followed by a panel. In the screening, they asked three ML questions and one coding question (LeetCode medium–hard). I solved the coding with BFS and answered all the ML questions correctly, but in the end they ghosted me.
Preguntas de entrevista [1]
Pregunta 1
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.
