Upload Button Icon Add office photos

PayPal

Compare button icon Compare button icon Compare

Filter interviews by

PayPal Software Engineer Level 1 Interview Questions and Answers

Updated 11 Feb 2024

13 Interview questions

A Software Engineer Level 1 was asked
Q. Amazon can perform searches in O(n) time complexity. Why would it choose to use O(nk) instead, especially considering that 'n' can be large for data structures like hash tables? Is O(nk) actually better tha...
Ans. 

O(nk) is better than O(n) for large data and hash tables.

  • O(nk) is better because it takes into account the size of the data and the number of keys.

  • For large data and hash tables, the size of n will be large, making O(nk) more efficient.

  • O(n) assumes a constant number of keys, which may not be the case in practice.

  • Amazon may have chosen O(nk) for better scalability and performance.

A Software Engineer Level 1 was asked
Q. Describe a time you processed a file, selected the first three lines, identified the longest line, and counted the words in that line. What approach did you take, and what Java methods did you use?
Ans. 

The program reads a file and selects the first 3 lines. It then identifies the longest line and counts the number of words in that line.

  • Read the file using appropriate file handling methods

  • Store the first 3 lines in an array of strings

  • Iterate through the array to find the longest line

  • Count the number of words in the longest line using string manipulation methods

Software Engineer Level 1 Interview Questions Asked at Other Companies

asked in PayPal
Q1. Describe a time you processed a file, selected the first three li ... read more
asked in PayPal
Q2. Amazon can perform searches in O(n) time complexity. Why would it ... read more
asked in PayPal
Q3. When you search for a particular product on Amazon, it displays s ... read more
asked in PayPal
Q4. Given a 3x3 matrix where each edge has a weight, find the path fr ... read more
Q5. 1. Abstraction Vs Interface 2. Sealed class 3. why do we use a pr ... read more
A Software Engineer Level 1 was asked
Q. What is the running time complexity of Radix sort?
Ans. 

Radix sort has a running time of O(nk), where n is the number of elements and k is the length of the longest element.

  • Radix sort is a non-comparative sorting algorithm that sorts elements by their individual digits or characters.

  • It works by distributing the elements into 10 buckets based on the value of the least significant digit, then repeatedly redistributing them based on the next significant digit.

  • The process ...

A Software Engineer Level 1 was asked
Q. When you search for a particular product on Amazon, it displays some search results, but only a few particular products which are available on Amazon are displayed, not all. How does this happen?
Ans. 

Amazon displays only a subset of search results based on various factors like relevance, popularity, and user preferences.

  • Amazon uses algorithms to determine which products to display in search results.

  • Factors considered include product relevance, customer reviews, sales rank, and availability.

  • Machine learning techniques may be used to personalize search results based on user behavior and preferences.

  • Amazon also c...

A Software Engineer Level 1 was asked
Q. Given a 3x3 matrix where each edge has a weight, find the path from the first element to the last element with the minimum sum of weights.
Ans. 

The question is about finding the shortest path in a 3x3 matrix with weighted edges.

  • This is a graph traversal problem.

  • Use a graph algorithm like Dijkstra's algorithm or A* search to find the shortest path.

  • Assign weights to the edges and calculate the sum of weights for each possible path.

  • Choose the path with the smallest sum of weights as the shortest path.

A Software Engineer Level 1 was asked
Q. Given an integer array nums and an integer k, return the kth largest element in the array.
Ans. 

Use a MinHeap to efficiently find the kth largest element in an array.

  • 1. Create a MinHeap of size k to store the largest k elements.

  • 2. Iterate through the array, adding elements to the MinHeap.

  • 3. If the size of the MinHeap exceeds k, remove the smallest element.

  • 4. After processing all elements, the root of the MinHeap is the kth largest element.

  • Example: For array [3, 2, 1, 5, 6, 4] and k=2, the MinHeap will contai...

A Software Engineer Level 1 was asked
Q. What happens when you type www.google.com in a web browser?
Ans. 

Typing www.google.com initiates a series of network requests to load the webpage in your browser.

  • 1. DNS Resolution: The browser queries a DNS server to translate www.google.com into an IP address.

  • 2. TCP Connection: A TCP connection is established with the server using the IP address.

  • 3. HTTP Request: The browser sends an HTTP request to the server for the webpage.

  • 4. Server Response: The server processes the request...

Are these interview questions helpful?
A Software Engineer Level 1 was asked
Q. How would you check if your system has an internet connection?
Ans. 

To check internet connectivity, you can use various methods like pinging a website or checking network status.

  • Use the command 'ping www.google.com' to see if you receive a response.

  • Check network settings in your operating system for connectivity status.

  • Use tools like 'traceroute' to diagnose network paths and issues.

  • In programming, use libraries like 'requests' in Python to attempt a web request.

A Software Engineer Level 1 was asked
Q. Given an array of strings, find the shortest length palindrome. I solved it in O(n2)
Ans. 

Find the shortest palindrome in an array of strings using O(n^2) time complexity.

  • A palindrome reads the same forwards and backwards, e.g., 'racecar'.

  • Iterate through each string in the array and check if it's a palindrome.

  • Keep track of the shortest palindrome found during the iteration.

  • Example: For ['abc', 'a', 'aba', 'xyz'], the shortest palindrome is 'a'.

  • Use two pointers to check for palindrome properties efficie...

A Software Engineer Level 1 was asked
Q. What data structure do they use? Hash tables.
Ans. 

Hash tables are a data structure that uses a hash function to map keys to values, providing efficient lookup, insertion, and deletion.

  • Hash tables use a hash function to convert keys into array indices.

  • They provide constant-time average case complexity for search, insert, and delete operations.

  • Collisions can occur when different keys map to the same index, which can be resolved using techniques like chaining or ope...

PayPal Software Engineer Level 1 Interview Experiences

3 interviews found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed in Jul 2022. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

2 Leetcode medium question for 1 hr. 1st was of string manipulation and 2nd was of Dynamic Programming. I don’t remember the exact question.

Round 3 - Technical 

(1 Question)

  • Q1. 1. Median in array stream (standard leetcode question): was able to solve using min and max heap. 2. Question on my prev company project. 3. I mention of Kafka in my resume and my prev company project so ...
Round 4 - Behavioral 

(1 Question)

  • Q1. After my 1st tech round I was told I am moving to HM round directly. And would not have to attend 2nd tech round. 1. Standard HM question. 2. Case study question. 3. Tech and project discussion.

Interview Preparation Tips

Topics to prepare for PayPal Software Engineer Level 1 interview:
  • DSA
  • Object Oriented Programming
  • Design
Interview preparation tips for other job seekers - 1. Prepare DSA (leetcode hard-medium is enough)
2. Prepare HM round seriously as there was much grilling happend and various situation based question asked.

Best of luck
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Feb 2023. There were 4 interview rounds.

Round 1 - Coding Test 

Online coding round. It has Data structure and algo based questions

Round 2 - Technical 

(1 Question)

  • Q1. Based on DBMS,Java,oops concepts
Round 3 - Technical 

(1 Question)

  • Q1. Java,oops concepts
Round 4 - HR 

(1 Question)

  • Q1. Behavioural question

I appeared for an interview in Aug 2017.

Interview Questionnaire 

17 Questions

  • Q1. Input a file. Select first 3 lines of the file. Select the longest line and count the number of words in that line. It was easy. I used Java methods to solve the problem. I explained the logic and he accep...
  • Ans. 

    The program reads a file and selects the first 3 lines. It then identifies the longest line and counts the number of words in that line.

    • Read the file using appropriate file handling methods

    • Store the first 3 lines in an array of strings

    • Iterate through the array to find the longest line

    • Count the number of words in the longest line using string manipulation methods

  • Answered by AI
  • Q2. Given an array of strings, find the shortest length palindrome. I solved it in O(n2)
  • Ans. 

    Find the shortest palindrome in an array of strings using O(n^2) time complexity.

    • A palindrome reads the same forwards and backwards, e.g., 'racecar'.

    • Iterate through each string in the array and check if it's a palindrome.

    • Keep track of the shortest palindrome found during the iteration.

    • Example: For ['abc', 'a', 'aba', 'xyz'], the shortest palindrome is 'a'.

    • Use two pointers to check for palindrome properties efficiently.

  • Answered by AI
  • Q3. There exists a 3x3 matrix, start from the first element reach the last element of the matrix, between each edges there exists a weight. Reach the destination such that the sum of weights should be small. I...
  • Ans. 

    The question is about finding the shortest path in a 3x3 matrix with weighted edges.

    • This is a graph traversal problem.

    • Use a graph algorithm like Dijkstra's algorithm or A* search to find the shortest path.

    • Assign weights to the edges and calculate the sum of weights for each possible path.

    • Choose the path with the smallest sum of weights as the shortest path.

  • Answered by AI
  • Q4. Application of Fibonacci series in day-to-day life.
  • Ans. 

    The Fibonacci series can be applied in day-to-day life for various purposes.

    • Financial planning: Fibonacci numbers can be used to calculate investment growth and determine optimal investment strategies.

    • Architecture and design: Fibonacci ratios can be used to create aesthetically pleasing designs and layouts.

    • Nature and biology: Fibonacci patterns can be observed in the growth of plants, arrangement of leaves, and formati...

  • Answered by AI
  • Q5. Balancing parantheses – I defined my own algorithm. He tested it for all test cases. He told me some modifications and I rectified my algorithm.
  • Q6. There was a discussion about my projects and he was quite satisfied with it.
  • Q7. He asked me what happens when I type www.google.com in the web browser. -----/
  • Ans. 

    Typing www.google.com initiates a series of network requests to load the webpage in your browser.

    • 1. DNS Resolution: The browser queries a DNS server to translate www.google.com into an IP address.

    • 2. TCP Connection: A TCP connection is established with the server using the IP address.

    • 3. HTTP Request: The browser sends an HTTP request to the server for the webpage.

    • 4. Server Response: The server processes the request and ...

  • Answered by AI
  • Q8. He asked me how I will check whether I have internet connection in my system? ping www.google.com will respond.
  • Ans. 

    To check internet connectivity, you can use various methods like pinging a website or checking network status.

    • Use the command 'ping www.google.com' to see if you receive a response.

    • Check network settings in your operating system for connectivity status.

    • Use tools like 'traceroute' to diagnose network paths and issues.

    • In programming, use libraries like 'requests' in Python to attempt a web request.

  • Answered by AI
  • Q9. Find the kth largest element in an array. I used MaxHeap concept but he asked me to define it using MinHeap. I modified the code and he accepted it.
  • Ans. 

    Use a MinHeap to efficiently find the kth largest element in an array.

    • 1. Create a MinHeap of size k to store the largest k elements.

    • 2. Iterate through the array, adding elements to the MinHeap.

    • 3. If the size of the MinHeap exceeds k, remove the smallest element.

    • 4. After processing all elements, the root of the MinHeap is the kth largest element.

    • Example: For array [3, 2, 1, 5, 6, 4] and k=2, the MinHeap will contain [5,...

  • Answered by AI
  • Q10. When you search for a particular product in amazon, it displays some of the search results. But, only few particular products which are available in amazon are displayed, not all. How does this happen? I ...
  • Ans. 

    Amazon displays only a subset of search results based on various factors like relevance, popularity, and user preferences.

    • Amazon uses algorithms to determine which products to display in search results.

    • Factors considered include product relevance, customer reviews, sales rank, and availability.

    • Machine learning techniques may be used to personalize search results based on user behavior and preferences.

    • Amazon also consid...

  • Answered by AI
  • Q11. What data structure do they use? Hash tables.
  • Ans. 

    Hash tables are a data structure that uses a hash function to map keys to values, providing efficient lookup, insertion, and deletion.

    • Hash tables use a hash function to convert keys into array indices.

    • They provide constant-time average case complexity for search, insert, and delete operations.

    • Collisions can occur when different keys map to the same index, which can be resolved using techniques like chaining or open add...

  • Answered by AI
  • Q12. What will be the key and what will be the values? The product will be the key. The brands will be the values.
  • Ans. 

    The product will be the key and the brands will be the values.

    • The key in this case refers to the unique identifier for each product.

    • The values are the different brands associated with each product.

    • For example, if the product is a smartphone, the key could be the model number and the values could be the different brands that manufacture that model.

  • Answered by AI
  • Q13. Do you know Radix Sort? Where it is used? Radix sort can be applied in amazon.
  • Ans. 

    Radix sort is a sorting algorithm that sorts integers by processing individual digits from least significant to most significant.

    • Radix sort is a non-comparative sorting algorithm.

    • It sorts numbers by grouping them based on each digit's value.

    • It is commonly used for sorting strings in lexicographic order.

    • Radix sort has linear time complexity, making it efficient for large datasets.

  • Answered by AI
  • Q14. Running time of Radix sort? O(nk)
  • Ans. 

    Radix sort has a running time of O(nk), where n is the number of elements and k is the length of the longest element.

    • Radix sort is a non-comparative sorting algorithm that sorts elements by their individual digits or characters.

    • It works by distributing the elements into 10 buckets based on the value of the least significant digit, then repeatedly redistributing them based on the next significant digit.

    • The process conti...

  • Answered by AI
  • Q15. But amazon can do the search in O(n). Why it has to go for O(nk)? For data structures like Hash tables and for large data, n will be large. So O(nk) is better than O(n) (former n is smaller than latter n...
  • Ans. 

    O(nk) is better than O(n) for large data and hash tables.

    • O(nk) is better because it takes into account the size of the data and the number of keys.

    • For large data and hash tables, the size of n will be large, making O(nk) more efficient.

    • O(n) assumes a constant number of keys, which may not be the case in practice.

    • Amazon may have chosen O(nk) for better scalability and performance.

  • Answered by AI
  • Q16. Tell me about your projects.
  • Ans. 

    I have worked on various projects including a web application for tracking fitness goals and a mobile app for managing personal finances.

    • Developed a web application using React and Node.js to track fitness goals and progress

    • Created a mobile app using Flutter to manage personal finances and budgeting

    • Collaborated with a team to implement features, fix bugs, and optimize performance

  • Answered by AI
  • Q17. If you don’t get selected for PayPal, what will you do?
  • Ans. 

    If not selected for PayPal, I will continue applying to other companies, improve my skills, and network with professionals in the industry.

    • Continue applying to other tech companies for similar roles

    • Work on improving technical skills through online courses or personal projects

    • Network with professionals in the industry through events or online platforms like LinkedIn

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: It was conducted in Hackerrank which consisted of 10 aptitude questions that included C, C++, Java MCQ

Skills evaluated in this interview

Top trending discussions

View All
Interview Tips & Stories
2w
boredinlife
·
works at
Mercer
I left in the middle of an interview.
M a self-taught developer. been working really hard, trying to break into tech. Two days ago, I got approached by an hr from this e learning company for an IT role. I was super nervous but also excited because it felt like maybe this is it. The interview was on teams with 9 experienced pros all with degrees and certifications while I had no formal IT background, just self-taught skills. I felt completely out of place. Most of the interviewers were kind and said I could learn on the job. But one person kept throwing back-to-back questions with shady comments after every answer made me feel like I wasn’t good enough. It crushed my confidence About 10 minutes before the interview ended, I panicked. Anxiety took over, so I faked a network issue and left the call. Then I just broke down. I didn’t want to be disrespectful, so I quickly emailed saying I got disconnected. Truth is, I was overwhelmed and felt like a total fraud. I’ve wanted a job in tech for so long.
Got a question about PayPal?
Ask anonymously on communities.

Interview questions from similar companies

I applied via Recruitment Consulltant and was interviewed before Apr 2021. There were 3 interview rounds.

Round 1 - Aptitude Test 

Common aptitude questions that are available on online (Example : IndiaBix)

Round 2 - Coding Test 

Needs to do coding in Java / Python. Problem solving needs to concentrate.

Round 3 - HR 

(4 Questions)

  • Q1. What is your family background?
  • Q2. What are your strengths and weaknesses?
  • Q3. Tell me about yourself.
  • Q4. Ready to relocate? Ready to immediate join?

Interview Preparation Tips

Topics to prepare for FIS Software Engineer Level 1 interview:
  • Java
  • DBMS
  • SQL
  • Testing
  • Python
Interview preparation tips for other job seekers - Prepare well for Java and Programming...
Also DBMS, Testing knowledge required.
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(2 Questions)

  • Q1. Talk about your experience
  • Ans. 

    I have experience in software development, focusing on web applications and collaborative projects using various technologies.

    • Developed a web application using React and Node.js for a local business, improving their online presence.

    • Collaborated with a team of developers on a project using Agile methodologies, enhancing my teamwork and communication skills.

    • Completed an internship where I contributed to a mobile app, gai...

  • Answered by AI
  • Q2. Talk about what are you looking for
Round 2 - Technical 

(1 Question)

  • Q1. Details about your previous tech experience
  • Ans. 

    I have experience in software development, focusing on web applications and collaborative projects using various technologies.

    • Developed a web application using React and Node.js for a local business, improving their online presence.

    • Collaborated with a team of developers on a project using Agile methodologies, enhancing my teamwork and communication skills.

    • Interned at a tech company where I assisted in debugging and opt...

  • Answered by AI
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Company Website and was interviewed in Jul 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Mainframe support questions about COBOL,JCL,VSAM,gdg

Round 2 - HR 

(1 Question)

  • Q1. About Day today Activities of my support activity in my previous company and basic mainframe questions and willingness to work in night shift
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed before Feb 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Haker rank coding link

Round 2 - Technical 

(1 Question)

  • Q1. Not remember its been more than 2 years

Interview Preparation Tips

Interview preparation tips for other job seekers - prepare well for java 8 programming , design patterns and micro services
Are these interview questions helpful?
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed before May 2023. There were 3 interview rounds.

Round 1 - Coding Test 

1 DSA Question and Output based MCQ q

Round 2 - One-on-one 

(1 Question)

  • Q1. Technical round depending on role requirement
Round 3 - HR 

(1 Question)

  • Q1. Aptitude Question and behvioural questions

I applied via Company Website and was interviewed before Jan 2021. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(2 Questions)

  • Q1. Pl sql Unix api configuration
  • Q2. Routing how to use proxy
  • Ans. 

    Routing through a proxy involves configuring the proxy server to forward requests to the destination server.

    • Configure the proxy server to listen for incoming requests

    • Configure the proxy server to forward requests to the destination server

    • Configure the client to use the proxy server for outgoing requests

    • Use a proxy server to bypass network restrictions or improve performance

    • Examples: Nginx, Apache, Squid

  • Answered by AI
Round 3 - One-on-one 

Interview Preparation Tips

Interview preparation tips for other job seekers - Avoid this company. You can be fired any day without notice.

Skills evaluated in this interview

Interview Preparation Tips

Round: Technical Interview
Tips: Have a good grasp of DS algo, java, etc.(Here CGPA doesn't matter)

General Tips: Do’s and Don’ts :
1. Be confident and to be confident prepare well.
2. Set the priority of your companies 
3. Don't start preparation at end. Don't ignore the content of resume.

Be confident and start preparation as soon as possible.
College Name: IIT Kanpur

PayPal Interview FAQs

How many rounds are there in PayPal Software Engineer Level 1 interview?
PayPal interview process usually has 4 rounds. The most common rounds in the PayPal interview process are Technical, Behavioral and Coding Test.
How to prepare for PayPal Software Engineer Level 1 interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at PayPal. The most common topics and skills that interviewers at PayPal expect are Financial Services, Coding, Javascript, Python and Computer science.
What are the top questions asked in PayPal Software Engineer Level 1 interview?

Some of the top questions asked at the PayPal Software Engineer Level 1 interview -

  1. Input a file. Select first 3 lines of the file. Select the longest line and cou...read more
  2. But amazon can do the search in O(n). Why it has to go for O(nk)? For data stru...read more
  3. When you search for a particular product in amazon, it displays some of the sea...read more

Tell us how to improve this page.

Overall Interview Experience Rating

4.5/5

based on 2 interview experiences

Difficulty level

Moderate 100%

Duration

Less than 2 weeks 100%
View more

Interview Questions from Similar Companies

Paytm Interview Questions
3.2
 • 793 Interviews
FIS Interview Questions
3.9
 • 501 Interviews
PhonePe Interview Questions
4.0
 • 340 Interviews
Fiserv Interview Questions
2.9
 • 181 Interviews
Razorpay Interview Questions
3.6
 • 159 Interviews
KFintech Interview Questions
3.5
 • 148 Interviews
Angel One Interview Questions
3.9
 • 147 Interviews
Visa Interview Questions
3.5
 • 145 Interviews
MasterCard Interview Questions
3.9
 • 144 Interviews
View all
PayPal Software Engineer Level 1 Salary
based on 33 salaries
₹12.1 L/yr - ₹27 L/yr
111% more than the average Software Engineer Level 1 Salary in India
View more details

PayPal Software Engineer Level 1 Reviews and Ratings

based on 1 review

4.0/5

Rating in categories

5.0

Skill development

4.0

Work-life balance

4.0

Salary

3.0

Job security

4.0

Company culture

4.0

Promotions

4.0

Work satisfaction

Explore 1 Review and Rating
Software Engineer2
339 salaries
unlock blur

₹15 L/yr - ₹45 L/yr

Software Engineer
325 salaries
unlock blur

₹13.5 L/yr - ₹45 L/yr

Senior Software Engineer
294 salaries
unlock blur

₹15.4 L/yr - ₹46.6 L/yr

Software Engineer III
283 salaries
unlock blur

₹20 L/yr - ₹70 L/yr

Data Scientist
263 salaries
unlock blur

₹15 L/yr - ₹65 L/yr

Explore more salaries
Compare PayPal with

Paytm

3.2
Compare

Razorpay

3.6
Compare

Visa

3.5
Compare

MasterCard

3.9
Compare
write
Share an Interview