PayPal Software Engineer Interview Questions, Process, and Tips

Hackerrank - 1.5 hour

Q1. Rotten oranges problem - DS
Ans. 
Rotten oranges problem involves finding the minimum time required to rot all oranges in a grid.
• Use Breadth First Search (BFS) to traverse the grid and update the ripening time of neighboring oranges.

• Keep track of the fresh oranges and the time taken to rot them all.

• Handle edge cases like no fresh oranges or unreachable oranges.
Answered by AI
Add your answer

Q1. System design for parking lot
Ans. 
Design a system for managing a parking lot efficiently.
• Use a database to store information about available parking spots, vehicles, and payments.

• Implement a system for tracking entry and exit of vehicles.

• Include features like online booking, payment options, and real-time availability updates.

• Consider implementing a ticketing system for managing parking duration and fees.
Answered by AI
Add your answer

Leetcode medium level qustion

There 2 coding rounds one on online and other on one-one discussion, both including few problem solving on DS and Algo on topics of Trees, Priority Queue, Arrays, DFS

Q1. One of the question was about return min element in stack in constant time (O(1)).
Add your answer
Q2. Find the and return if the given file path existing in the given file hierarcy(file system).
Add your answer

Q1. This round was regarding LLD and HLD round, question on java and resume and LLD and HLD. Java 1) why functional interface 2) how would you use and make yuor own functional interface 3) Options class Netwo...read more
Add your answer
Q2. Given a usecase to build parking system
Add your answer

Q1. This round was about lot of conversation with technical, leadership and cultural aspect with my manager
Add your answer

2 coding question
Leetcode medium

Q1. Optimal path cost and path in a matrix . Dynamic programming
Ans. 
Finding optimal path cost and path in a matrix using dynamic programming.
• Dynamic programming is a technique to solve problems by breaking them down into smaller subproblems and solving them recursively.

• In this case, we can use dynamic programming to find the optimal path cost and path in a matrix.

• We can start by defining a 2D array to store the minimum cost of reaching each cell in the matrix.

• Then, we can use a recursi...read more
Answered by AI
Add your answer

Q1. 2 coding question + general resume discussion
Add your answer

Q1. Questions from resume and few general hr question.
Add your answer
Q2. Where do you see yourself after 2 years? Why do you want to join the company?
Ans. 
In 2 years, I see myself as a senior software engineer, leading a team and contributing to the company's growth. I want to join the company because of its reputation for innovation and its focus on employee development.
• I plan to continue learning and growing my skills in software development

• I hope to take on more leadership responsibilities and mentor junior engineers

• I want to contribute to the company's success by dev...read more
Answered by AI
Add your answer