I applied online. The process took 2 weeks. I interviewed at Pinterest in Oct 2022
Interview
I received a coding assessment in the first round. It was through CodeSignal. There were 10 questions and 70 mins! The questions were not as hard as I thought they would be. But, the time was extremely short.
Interview questions [1]
Question 1
- 6 hard quiz - questions with 4-6 T/F options (not necessarily from your everyday ML algorithms). - 1 medium leetcode problem (from their list of most repeated questions) - 2 implementation questions. Mine were KNN and Kmeans. - One neural network hand-calculation (easy) Overall the assessment was thorough, but the time limit is unreasonably low! As someone with tons of coding and ML experience, I could say you had to be top 10% of Stanford graduates so that you can come close to getting all the questions right in 70 mins.
Thank you so much for interviewing at Pinterest and for taking time to leave this review. We’re working hard every day to create the best recruiting experience, and we’ll be sure to take this feedback into account as we build for the future. If you have any additional details that you’d like to share, we encourage you to email us at gd@pinterest.com.
Pinterest Recruiting
Neutral experience
Average interview
Application
I interviewed at Pinterest (New York, NY)
Interview
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
I applied online. The process took 4 weeks. I interviewed at Pinterest in Aug 2025
Interview
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.
Interview questions [1]
Question 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.
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.
Interview questions [1]
Question 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.
