Procore Full Stack Developer Interview Questions and Answers

Round duration - 50 Minutes
Round difficulty - Medium

It was the screening round he asked me 2 questions 
First one is easy and other one is medium type

Q1. 
Find All Pairs Adding Up to Target
Given an array of integers ARR of length N and an integer Target, your task is to return all pairs of elements such that they add up to the Target.
Input:
The first line ...read more
Ans. 
Find all pairs of elements in an array that add up to a given target.
• Iterate through the array and store each element in a hashmap along with its index.

• For each element, check if the target minus the element exists in the hashmap.

• If found, print the pair of elements. If not found, print (-1, -1).
Answered by AI
Add your answer
Q2. 
Root to Leaf Path Problem Statement
Given a binary tree with 'N' nodes numbered from 1 to 'N', your task is to print all the root-to-leaf paths of the binary tree.
Input:
The first line of the input con...read more
Ans. 
Given a binary tree, print all root-to-leaf paths in order.
• Traverse the binary tree from root to leaf nodes, keeping track of the path nodes.

• Use depth-first search (DFS) to explore all possible paths.

• Return each path as a string of nodes separated by spaces.

• Handle cases where nodes have NULL values by skipping them in the path.

• Ensure the order of nodes in each path is maintained.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

This is the first round in the loop interviews. Are you familiar with Javascript. Why do we use js. How do you use js to change the value of a textbox.

Q1. 
Validate BST Problem Statement
Given a binary tree with N nodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, return true; otherwise, return false.
A binary search tree (BST)...read more
Ans. 
Validate if a binary tree is a Binary Search Tree (BST) based on given properties.
• Check if the left subtree of a node contains only nodes with data less than the node's data.

• Verify if the right subtree of a node contains only nodes with data greater than the node's data.

• Ensure that both the left and right subtrees are also binary search trees.

• Iterate through the tree in level order form to validate the BST properties.
Answered by AI
Add your answer
Q2. 
Construct Tree from Preorder Traversal
Given a list of integers pre[] of size n, representing the preorder traversal of a special binary tree where each node has 0 or 2 children, and a boolean array isLea...read more
Ans. 
Construct a binary tree from preorder traversal and leaf node information.
• Create a binary tree using preorder traversal and leaf node information

• Use recursion to build the tree

• Handle both leaf and non-leaf nodes appropriately
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

It was the team fit round

Round duration - 45 Minutes
Round difficulty - Medium

4tn round in the loop, he asked me to design a game. He focused both on backend and frontend.
..

Q1. 
Bursting Balloons Problem
Given an array ARR of size N, where each element represents the height of a balloon. The task is to destroy all balloons by shooting arrows from left to right. When an arrow hits...read more
Ans. 
Find the minimum number of arrows needed to burst all balloons by shooting arrows from left to right.
• Sort the array in ascending order to make it easier to determine the minimum number of arrows needed.

• Iterate through the sorted array and count the number of times the height decreases.

• The count of height decreases plus 1 gives the minimum number of arrows needed to burst all balloons.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

Another problem solving round

Q1. 
Triplets with Given Sum Problem
Given an array or list ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a specified number K.
Explanation:
A t...read more
Ans. 
Identify all distinct triplets within an array that sum up to a specified number.
• Iterate through the array and use nested loops to find all possible triplets.

• Check if the sum of the triplet equals the specified number.

• Print the valid triplets or return -1 if no triplet exists.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It was a hangout video call. The interviewer asked me these questions. Tell me about yourself and 1 coding question.

Q1. 
Special Numbers Problem Statement
Your task is to find the total count of special numbers within a range from 1 to a given integer, 'MAXVAL'. A special number is defined as a number whose digits, when rot...read more
Ans. 
Count the total number of special numbers within a given range by rotating digits 180 degrees.
• Create a function to check if a number is a special number by rotating its digits.

• Iterate through the range from 1 to MAXVAL and count the special numbers.

• Handle the digit rotation mapping for 0, 1, 6, 8, 9.

• Return the count of special numbers for each test case.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

This was an On-site (Behavioural Round) interview. He asked me these questions.

Round duration - 60 Minutes
Round difficulty - Easy

This was another On-site ( DS & Algo) algorithm.

Q1. 
Covid Vaccination Distribution Problem
As the Government ramps up vaccination drives to combat the second wave of Covid-19, you are tasked with helping plan an effective vaccination schedule. Your goal is...read more
Ans. 
Given constraints, find max vaccines administered on a specific day during a vaccination drive.
• Iterate through each test case and calculate the maximum number of vaccines distributed on the specified day.

• Distribute vaccines evenly across days while maximizing the number on the specified day.

• Ensure that the sum of vaccines administered does not exceed the maximum allowed.

• Consider edge cases like when the number of days ...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Another On-site ( DS & Algo) interview.

Q1. 
Painter's Partition Problem Statement
Given an array/list representing boards, where each element denotes the length of a board, and a number ‘K’ of available painters, determine the minimum time required...read more
Ans. 
Determine the minimum time required to paint all boards with given constraints.
• Use binary search to find the minimum and maximum possible time to paint all boards.

• Iterate through the boards and assign them to painters based on the time constraints.

• Calculate the total time taken to paint all boards with the assigned painters.
Answered by AI
View 1 more answer
Q2. 
Chocolate Distribution Problem
You are given an array/list CHOCOLATES of size 'N', where each element represents the number of chocolates in a packet. Your task is to distribute these chocolates among 'M'...read more
Ans. 
Distribute chocolates among students to minimize the difference between the largest and smallest number of chocolates.
• Sort the array of chocolates.

• Use sliding window technique to find the minimum difference between the largest and smallest number of chocolates.

• Return the minimum difference as the output.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Another On-site ( DS & Algo) interview.

Q1. 
Problem Statement: Minimize the Maximum
You are given an array of integers and an integer K. For each array element, you can adjust it by increasing or decreasing it by a value of K. Your goal is to minim...read more
Ans. 
Given an array of integers and an integer K, minimize the difference between the maximum and minimum elements after adjusting each element by +/- K.
• Sort the array in non-decreasing order.

• For each element, calculate the difference between the current element and the next element.

• Adjust the element by adding or subtracting K to minimize the difference.

• Return the minimum possible difference between the maximum and minimum
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

On-site ( DS & Algo) interview.
Google mainly focuses on logic and how you are coming with a solution. It notes down each and every small mistake. Interviewers are really very helpful. They expect clear code with an optimal approach.

Q1. 
Farthest Distance From Lands Problem Statement
Given a binary square matrix 'ARR' with 'N' rows and 'N' columns, where '0' represents water and '1' represents land.
Determine the water cell whose distanc...read more
Ans. 
Find the water cell farthest from land in a binary matrix using Manhattan distance.
• Iterate through the matrix to find all land cells and water cells

• Calculate the Manhattan distance of each water cell to the nearest land cell

• Return the maximum distance found
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Round duration - 90 minutes
Round difficulty - Easy

Q1. 
Alien Dictionary Problem Statement
You are provided with a sorted dictionary (by lexical order) in an alien language. Your task is to determine the character order of the alien language from this dictiona...read more
Ans. 
Given a sorted alien dictionary, determine the character order of the alien language.
• Create a graph data structure to represent the relationships between characters based on the given dictionary.

• Perform a topological sort on the graph to determine the character order of the alien language.

• Return the character array obtained from the topological sort as the final output.
Answered by AI
Add your answer
Q2. 
Shopping Spree Problem Statement
Preeti plans to shop for her father's birthday at a store with unlimited quantities of N different items. She has a budget that allows her to buy a maximum of K items. Hel...read more
Ans. 
Calculate the number of ways Preeti can purchase items within budget, considering distinct ways.
• Use dynamic programming to calculate the number of ways to purchase items within budget

• Consider different scenarios where Preeti buys different quantities of each item

• Return the result modulo 10^9 + 7 to handle large answers
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Basic DBMS problems.

Round duration - 30 Minutes
Round difficulty - Easy

He asked basic Database and oops questions and discussion about my projects.

Round duration - 50 Minutes
Round difficulty - Easy

It was evening. Since it was a telephonic interview so all at the home. NOthing different. About my soft skills, resume, and some basic coding stuff. Why google? Where do you see yourself in 5 years?

Q1. 
Count Ways to Reach the N-th Stair Problem Statement
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...read more
Ans. 
Count the number of distinct ways to climb to the Nth stair by climbing one or two steps at a time.
• Use dynamic programming to solve the problem efficiently.

• The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.

• Handle base cases where N=0 and N=1 separately.

• Apply modulo 10^9+7 to avoid overflow in the final result.
Answered by AI
Add your answer