PayPal interview experience Real time questions & tips from candidates to crack your interview
Software Engineer
PayPal
2 rounds | 3 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3 months
Topics: Data structures, Algorithms, System Design, Javascript, Database, OOPs
Tip 1 : Always keep your focus on learning the basics, they should be rock solid
Tip 2 : Don't try to cram things days or weeks before interviews, that never helps. Try to learn little by little every day incrementally.
Tip 3 : Don't try to target any specific company, it almost never works out, just stay true to yourself and keep doing the hard work, opportunity will come to you eventually.
Tip 4 : If you need to prepare in a short time, I would suggest doing the 30-day interview challenge
Application process
Where: Other
Eligibility: None, as I am experienced professional
Tip 1 : Keep it short and simple, don't clutter with lots of text, try to convey things using bullet points instead of paragraphs
Tip 2 : Don't use fancy graphics and make sure the resume is not more than 1 page (or maybe 2 in case you have more experience)
Interview rounds
01
Round
Easy
Video Call
Duration60 Minutes
Interview date17 Jun 2020
Coding problem2
The interview was held in the evening on a weekday, Interview was nice and quite experienced, he asked me about my previous experience in the area and they told me about the team and work for which they were hiring, we did some discussion on that. Meanwhile, I was also asked a few questions on Database and SQL.
1. DBMS Questions
Asked me about some advanced DBMS concepts like windowing, triggers, joins, and indexing.
Problem approach
Tip 1 : Practice writing fairly complex SQL queries
Tip 2 : Make sure you understand all the basics well
Tip 3 : Be proficient in at least on DBMS
2. Magic Index
Easy
20m average time
80% success
0/40
Asked in companies
You are given a sorted array A consisting of N integers. Your task is to find the magic index in the given array.
Note :
1. A magic index in an array A[0 ... N - 1] is defined to be an index i such that A[i] = i.
2. The elements in the array can be negative.
3. The elements in the array can be repeated multiple times.
4. There can be more than one magic index in an array.
02
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date10 Jul 2020
Coding problem1
The interview was in the afternoon. There were some glitches with the teams meeting but it got sorted out in a few minutes. This round was purely coding based. He started with questions on arrays, linked lists, and string manipulation with an increasing level of hardness. The tricky part was that the online editor I was given for writing the code was not an IDE but a simple text editor, so I wasn't getting any help in terms of code completion or syntax errors or syntax highlighting.
1. Two Sum
Easy
10m average time
90% success
0/40
Asked in companies
You are 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 Target.
Note:
We cannot use the element at a given index twice.
Follow Up:
Try to do this problem in O(N) time complexity.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
Software Engineer
4 rounds | 7 problems
Interviewed by PayPal
Selected 
1416 views
0 comments
0 upvotes
Software Engineer
3 rounds | 6 problems
Interviewed by PayPal
Rejected
2425 views
0 comments
0 upvotes
Software Engineer
3 rounds | 5 problems
Interviewed by PayPal
Selected 3719 views
0 comments
0 upvotes
Software Engineer
3 rounds | 4 problems
Interviewed by PayPal
Selected 6367 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
Selected 7874 views
1 comments
0 upvotes
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
Selected 9973 views
1 comments
0 upvotes
Software Engineer
2 rounds | 4 problems
Interviewed by Amazon
Selected 4310 views
1 comments
0 upvotes