PayPal | Software Engineer 2 | Banglore | Oct [Offer]
Summary
I successfully interviewed for the Software Engineer 2 position at PayPal in Bangalore, India, in October 2022, and received an offer. The process involved four rounds covering data structures, algorithms, API design, and behavioral aspects.
Full Experience
I am currently an SDE at a startup with 2 years of experience. I interviewed for the Software Engineer 2 position at PayPal in Bangalore, India, in October 2022.
The interview process consisted of four rounds:
Round 1: Online Assessment (HackerRank)
This round had two sections. The first was a hard-level DSA question, where I managed to pass some test cases using a brute-force approach. The second part involved a simple API design problem.
Round 2: Technical Interview
This round focused on data structures and algorithms. I was asked to design a stack with O(1) time complexity for push, pop, findMiddle, and deleteMiddle operations. Additionally, I had to solve a problem similar to LeetCode's Top K Frequent Elements.
Round 3: Technical Interview
Another technical round where I encountered a problem similar to LeetCode's Car Pooling. There were also questions related to Java, design patterns, and discussions about my current projects.
Round 4: Hiring Manager Interview
Unexpectedly, this round included a standard DP problem, similar to LeetCode's Partition Equal Subset Sum. The rest of the round involved behavioral questions and discussions about my projects.
I successfully cleared all rounds and received an offer.
Interview Questions (4)
Design a stack that supports push(), pop(), findMiddle(), and deleteMiddle() operations, all in O(1) time complexity.
There is a car with capacity capacity that drives from an initial location to a final location. You are given the trips array, where trips[i] = [numPassengers_i, from_i, to_i] indicates that the i-th trip has numPassengers_i passengers and travels from location from_i to location to_i. The car only drives in one direction, from left to right. Return true if it is possible to pick up and drop off all passengers for all the given trips, or false otherwise.