PayPal | Worst Experience | Backend Developer | Bangalore | January 29, 2022 | Reject
- Result
- Rejected
- Location
- Bangalore
- Posted
- 29 Jan 2022
Summary
I had a very negative interview experience with PayPal for a Backend Developer role where the interviewer displayed unprofessional behavior, leading to my rejection. Despite solving one problem, I was cut short and judged prematurely.
How it went
I recently interviewed for a Backend Developer role at PayPal in Bangalore. The experience was quite negative, primarily due to the interviewer's unprofessional conduct.
We covered two questions. For the first question, I was asked to reverse a string based on curly brackets. I initially tried a recursive approach, but after a few more examples provided by the interviewer, I realized it wouldn't work and switched to a stack-based solution. Unfortunately, I couldn't complete it within the allotted timeframe.
The interviewer then made a startling comment, stating, "I don't think you will be able to solve the next question" simply because I struggled with the first. The second question was the classic 'Number of Islands' graph traversal problem. This is a frequently asked question, so I knew the solution well and completed it in about 20 minutes. However, the interviewer refused to let me run my solution, claiming that "Time is up & I need to go to the next candidate now. Bye!" and immediately ended the meeting.
Despite having 20-25 minutes left, she chose to take a break instead of proceeding or even checking my solution. I was stunned by this attitude and have since passed my feedback to HR. In a nutshell, I would never apply to PayPal again and wish to avoid working with individuals who display such behavior.
Questions asked (2)
- 01
Reverse String with Curly Brackets
Data Structures & Algorithms · Medium
Given an input string with nested curly brackets, reverse the string content within each pair of curly brackets. For example:
- Input:
{I{am}paypal} - Output:
lapyapaml
- Input:
- 02
Number of Islands
Data Structures & Algorithms · Medium
This is a standard graph traversal problem to count the number of distinct islands in a 2D binary grid where '1' represents land and '0' represents water. Adjacent lands (horizontally or vertically) form a single island.