PayPal | Software Developer | | Campus Placement | Jul [Reject]

Interview Experience: PayPal | Software Developer | | Campus Placement | Jul [Reject]

Status: New Grad, Computer Science background. Position: Software Developer at PayPal. Location: Date: July 27

Every round is an Elimination round.

Day 1:

First Round: Online Coding Round - 2 Questions(2hrs)

Question 1: Given a grid with was width, has height. Each cell of the grid represents a potential building lot and we will be adding "n" buildings inside this grid. The goal is for the furthest of all lots to be as near as possible to a building. Given an input n, which is the number of buildings to be placed in the lot, determine the building placement to minimize the distance the most distant empty lot is from the building. Movement is restricted to horizontal and vertical i.e. diagonal movement is not required.

(Solved using Backtracking and BFS)

Question 2: Given an array, find the number of couples (two values) that add up to 60 or a value divisible by 60.

(Solved using Hashing in O(n) time complexity and O(1) space complexity)

Day 2:

Second Round: Technical Phone Screen Round - 3 Questions(1 hr)

Question 1: Create a Data Structure which can perform Forward, Backward and goto certain searched website (similar to browser operations).

(Solved using Doubly LinkedList and Stack is another alternative that can be used)

Question 2: Find the minimum distance to reach every node from any of the one nodes from two given nodes.

(Solved using BFS)

Question 3: Find the intersection of the given list of ranges

(Solved using Greedy approach)

Day 3:

Third Round: Technical Phone Screen Round -3 Questions(1 hr)

Question 1: Maximum profit by buying and selling a share at most k times.

(Solved using Dynamic Programming)

Question 2: Minimum steps to reach a target by a Knight.

(Solved using BFS)

Question 3: Trapping Rain Water.

(Solved the problem using left array and right array concept)

Day 3 Evening:

Final Round (HR Round): (30 min)

Asked to explain the approach for "Find the minimum number of coins that make a given value", explained the solution using Dynamic Programming.

Asked few Questions on Project, Hobbies, Activities, etc.

Got rejected in the HR round.