Upload Button Icon Add office photos

PayPal

Compare button icon Compare button icon Compare

Filter interviews by

PayPal Software Engineer Interview Questions and Answers for Freshers

Updated 10 Apr 2025

11 Interview questions

A Software Engineer was asked
Q. How would you return the minimum element in a stack in constant time (O(1))?
Ans. 

Implement a stack that supports retrieving the minimum element in constant time.

  • Use an auxiliary stack to keep track of minimum values.

  • Push the current minimum onto the auxiliary stack whenever a new element is pushed.

  • When popping an element, also pop from the auxiliary stack if it is the current minimum.

  • Example: For stack [3, 5, 2], min stack would be [3, 2].

  • To get min: simply return the top of the min stack.

A Software Engineer was asked
Q. Given a file path and a file system hierarchy, how would you determine if the file path exists within the hierarchy?
Ans. 

Check if a given file path exists in the file system hierarchy and return the result.

  • Use file system APIs to check if the given file path exists in the hierarchy.

  • Traverse the file system hierarchy starting from the root directory to find the given file path.

  • Return true if the file path exists, false otherwise.

Software Engineer Interview Questions Asked at Other Companies for Fresher

asked in Capgemini
Q1. In a dark room, there is a box of 18 white and 5 black gloves. Yo ... read more
asked in Capgemini
Q2. How can you cut a rectangular cake in 8 symmetric pieces in three ... read more
Q3. Split Binary String Problem Statement Chintu has a long binary st ... read more
asked in TCS
Q4. What is the reason that the Iterative Waterfall model was introdu ... read more
asked in Wipro
Q5. Knapsack Problem Statement There is a potter with a limited amoun ... read more
A Software Engineer was asked
Q. Describe how you would design a parking system given a specific use case.
Ans. 

Design a parking system to manage vehicle parking efficiently and optimize space usage.

  • Define user roles: Admin, Driver, and Parking Attendant.

  • Implement features like real-time availability tracking and reservation.

  • Use sensors or cameras for automated entry/exit logging.

  • Integrate payment systems for seamless transactions.

  • Consider mobile app for users to find and reserve spots.

A Software Engineer was asked
Q. How is MongoDB scalable?
Ans. 

MongoDB is scalable due to its ability to horizontally partition data across multiple servers.

  • MongoDB uses sharding to distribute data across multiple servers.

  • Sharding allows for horizontal scaling by adding more servers to the cluster.

  • MongoDB also supports replica sets for high availability and fault tolerance.

  • Indexes can be created on any field in a MongoDB document, allowing for efficient querying of large data...

A Software Engineer was asked
Q. 

Maximum Difference Problem Statement

Given an array ARR of N elements, your task is to find the maximum difference between any two elements in ARR.

If the maximum difference is even, print EVEN; if it is ...

Ans. 

Find the maximum difference between any two elements in an array and determine if it is even or odd.

  • Iterate through the array to find the maximum and minimum elements

  • Calculate the difference between the maximum and minimum elements

  • Check if the difference is even or odd and return the result

A Software Engineer was asked
Q. 

Cycle Detection in Undirected Graph Problem Statement

You are provided with an undirected graph containing 'N' vertices and 'M' edges. The vertices are numbered from 1 to 'N'. Your objective is to determin...

Ans. 

Detect cycles in an undirected graph with given vertices and edges.

  • Use Depth First Search (DFS) to traverse the graph and detect cycles.

  • Maintain a visited array to keep track of visited vertices and a parent array to keep track of the parent of each vertex.

  • If while traversing, you encounter a visited vertex that is not the parent of the current vertex, then a cycle exists.

  • Consider edge cases like disconnected grap...

A Software Engineer was asked
Q. What is hashing and how can it be implemented?
Ans. 

Hashing is a process of converting input data into a fixed-size string of bytes using a hash function.

  • Hashing is used to securely store passwords by converting them into a hash value before storing in a database.

  • Hashing is used in data structures like hash tables to quickly retrieve data based on a key.

  • Common hash functions include MD5, SHA-1, and SHA-256.

  • Hashing can be implemented in programming languages like Py...

Are these interview questions helpful?
A Software Engineer was asked
Q. 

Palindrome Partitioning II Problem Statement

Given a string ‘str’, find the minimum number of partitions needed such that every segment of the string is a palindrome.

The task is to make cuts in the strin...

Ans. 

Find the minimum number of partitions needed in a string such that every segment is a palindrome.

  • Iterate through the string and check for palindromes at each possible partition point.

  • Use dynamic programming to keep track of the minimum cuts needed.

  • Consider edge cases where the string is already a palindrome or consists of different characters only.

A Software Engineer was asked
Q. 

Merge Sort Problem Statement

You are given a sequence of numbers, ARR. Your task is to return a sorted sequence of ARR in non-descending order using the Merge Sort algorithm.

Explanation:

The Merge Sort ...

Ans. 

Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.

  • Implement the Merge Sort algorithm using a Divide and Conquer approach

  • Recursively divide the input array into two halves until the size of each array is 1

  • Merge the sorted halves to produce a completely sorted array

  • Ensure the output is in non-descending order

A Software Engineer was asked
Q. 

DFS Traversal Problem Statement

Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GRA...

Ans. 

DFS traversal problem on an undirected and disconnected graph to find connected components.

  • Perform Depth First Search (DFS) on each vertex to find connected components

  • Use a visited array to keep track of visited vertices

  • Print the number of connected components and list vertices in ascending order for each component

PayPal Software Engineer Interview Experiences for Freshers

4 interviews found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Hackerrank - 1.5 hour

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

I applied via Instahyre and was interviewed before Aug 2022. There were 5 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 - Coding Test 

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

Round 3 - One-on-one 

(2 Questions)

  • Q1. One of the question was about return min element in stack in constant time (O(1)).
  • Ans. 

    Implement a stack that supports retrieving the minimum element in constant time.

    • Use an auxiliary stack to keep track of minimum values.

    • Push the current minimum onto the auxiliary stack whenever a new element is pushed.

    • When popping an element, also pop from the auxiliary stack if it is the current minimum.

    • Example: For stack [3, 5, 2], min stack would be [3, 2].

    • To get min: simply return the top of the min stack.

  • Answered by AI
  • Q2. Find the and return if the given file path existing in the given file hierarcy(file system).
  • Ans. 

    Check if a given file path exists in the file system hierarchy and return the result.

    • Use file system APIs to check if the given file path exists in the hierarchy.

    • Traverse the file system hierarchy starting from the root directory to find the given file path.

    • Return true if the file path exists, false otherwise.

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

(2 Questions)

  • 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...
  • Q2. Given a usecase to build parking system
  • Ans. 

    Design a parking system to manage vehicle parking efficiently and optimize space usage.

    • Define user roles: Admin, Driver, and Parking Attendant.

    • Implement features like real-time availability tracking and reservation.

    • Use sensors or cameras for automated entry/exit logging.

    • Integrate payment systems for seamless transactions.

    • Consider mobile app for users to find and reserve spots.

  • Answered by AI
Round 5 - Behavioral 

(1 Question)

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

Interview Preparation Tips

Interview preparation tips for other job seekers - be fearless and answer only when you sure if not be frank nothing in wrong to try by asking before you do.

Interview Questionnaire 

1 Question

  • Q1. How is MongoDB scalable?
  • Ans. 

    MongoDB is scalable due to its ability to horizontally partition data across multiple servers.

    • MongoDB uses sharding to distribute data across multiple servers.

    • Sharding allows for horizontal scaling by adding more servers to the cluster.

    • MongoDB also supports replica sets for high availability and fault tolerance.

    • Indexes can be created on any field in a MongoDB document, allowing for efficient querying of large datasets.

  • Answered by AI

Skills evaluated in this interview

I appeared for an interview before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This was an online test for 90 minutes. 2 programming questions and MCQs related to CS fundamentals were asked.

  • Q1. 

    Cycle Detection in a Singly Linked List

    Determine if a given singly linked list of integers forms a cycle or not.

    A cycle in a linked list occurs when a node's next points back to a previous node in the ...

  • Ans. 

    Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.

    • Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.

    • If the two pointers meet at any point, it indicates the presence of a cycle in the linked list.

    • If one of the pointers reaches the end of the list (null), it means there is no cycle.

  • Answered by AI
  • Q2. 

    Palindrome Partitioning II Problem Statement

    Given a string ‘str’, find the minimum number of partitions needed such that every segment of the string is a palindrome.

    The task is to make cuts in the stri...

  • Ans. 

    Find the minimum number of partitions needed in a string such that every segment is a palindrome.

    • Iterate through the string and check for palindromes at each possible partition point.

    • Use dynamic programming to keep track of the minimum cuts needed.

    • Consider edge cases where the string is already a palindrome or consists of different characters only.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round that lasted for around 60 minutes. The interviewer asked questions related to data structures and algorithms.

  • Q1. 

    DFS Traversal Problem Statement

    Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...

  • Ans. 

    DFS traversal problem on an undirected and disconnected graph to find connected components.

    • Perform Depth First Search (DFS) on each vertex to find connected components

    • Use a visited array to keep track of visited vertices

    • Print the number of connected components and list vertices in ascending order for each component

  • Answered by AI
  • Q2. 

    Cycle Detection in Undirected Graph Problem Statement

    You are provided with an undirected graph containing 'N' vertices and 'M' edges. The vertices are numbered from 1 to 'N'. Your objective is to determi...

  • Ans. 

    Detect cycles in an undirected graph with given vertices and edges.

    • Use Depth First Search (DFS) to traverse the graph and detect cycles.

    • Maintain a visited array to keep track of visited vertices and a parent array to keep track of the parent of each vertex.

    • If while traversing, you encounter a visited vertex that is not the parent of the current vertex, then a cycle exists.

    • Consider edge cases like disconnected graphs an...

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round that lasted for around 60 minutes. The interviewer asked questions related to data structures and algorithms.

  • Q1. 

    Merge Sort Problem Statement

    You are given a sequence of numbers, ARR. Your task is to return a sorted sequence of ARR in non-descending order using the Merge Sort algorithm.

    Explanation:

    The Merge Sort...

  • Ans. 

    Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.

    • Implement the Merge Sort algorithm using a Divide and Conquer approach

    • Recursively divide the input array into two halves until the size of each array is 1

    • Merge the sorted halves to produce a completely sorted array

    • Ensure the output is in non-descending order

  • Answered by AI
  • Q2. 

    Maximum Difference Problem Statement

    Given an array ARR of N elements, your task is to find the maximum difference between any two elements in ARR.

    If the maximum difference is even, print EVEN; if it is...

  • Ans. 

    Find the maximum difference between any two elements in an array and determine if it is even or odd.

    • Iterate through the array to find the maximum and minimum elements

    • Calculate the difference between the maximum and minimum elements

    • Check if the difference is even or odd and return the result

  • Answered by AI
  • Q3. What is hashing and how can it be implemented?
  • Ans. 

    Hashing is a process of converting input data into a fixed-size string of bytes using a hash function.

    • Hashing is used to securely store passwords by converting them into a hash value before storing in a database.

    • Hashing is used in data structures like hash tables to quickly retrieve data based on a key.

    • Common hash functions include MD5, SHA-1, and SHA-256.

    • Hashing can be implemented in programming languages like Python ...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPaypal interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.:

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Top trending discussions

View All
Interview Tips & Stories
2w
toobluntforu
·
works at
Cvent
Can speak English, can’t deliver in interviews
I feel like I can't speak fluently during interviews. I do know english well and use it daily to communicate, but the moment I'm in an interview, I just get stuck. since it's not my first language, I struggle to express what I actually feel. I know the answer in my head, but I just can’t deliver it properly at that moment. Please guide me
Got a question about PayPal?
Ask anonymously on communities.

Interview questions from similar companies

I applied via Campus Placement and was interviewed before Jun 2020. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Normal coding question medium level , approach focusing rounds actually how you get up to result

Interview Preparation Tips

Interview preparation tips for other job seekers - "GfG must do" should be solved properly alteast , otherwise go keep on practicing on any platform .

I applied via Naukri.com and was interviewed in Sep 2020. There were 5 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. More about my technical side.

Interview Preparation Tips

Interview preparation tips for other job seekers - Stay connected with good data which may help in current situation for interview process.

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

Are these interview questions helpful?

Software Engineer Interview Questions & Answers

Visa user image Pranali Yawalkar

posted on 14 Dec 2015

Interview Questionnaire 

7 Questions

  • Q1. Discussion on my internships and course projects.
  • Q2. My field of interest, how well have I fared in it.
  • Q3. Design a mvc controller system where given a url, I am able to invoke the right controller. Eg, given "xyz.com/a/b/c", I should be able to invoke c controller by going through a and b
  • Ans. 

    Design an MVC controller system to route URLs to the appropriate controllers based on the URL structure.

    • Define a routing mechanism that maps URLs to controller actions.

    • Use a hierarchical structure where each segment of the URL corresponds to a controller.

    • Example: For 'xyz.com/a/b/c', 'a' routes to 'AController', 'b' to 'BController', and 'c' to 'CController'.

    • Implement a method to parse the URL and invoke the correspond...

  • Answered by AI
  • Q4. Design autocomplete in IDEs
  • Ans. 

    Autocomplete in IDEs helps developers write code faster by suggesting code snippets and completing code as they type.

    • Autocomplete should suggest code snippets based on the context of the code being written

    • Autocomplete should prioritize suggestions based on frequency of use

    • Autocomplete should also suggest variable and function names

    • Autocomplete should be customizable to allow for user-defined snippets and suggestions

    • Exa...

  • Answered by AI
  • Q5. What is my weakness
  • Ans. 

    My weakness is public speaking.

    • I tend to get nervous when speaking in front of large groups.

    • I am working on improving my public speaking skills by practicing and seeking feedback.

    • I have taken courses and attended workshops to help me overcome my fear of public speaking.

  • Answered by AI
  • Q6. Given 2 game scenarios for basketball, and given p as the probability of making a basket in an attempt, I have to understand the condition where game1 would be preferable over game2. In first game, I have ...
  • Ans. 

    Comparing 2 basketball game scenarios with different number of trials and baskets required to win

    • Calculate the probability of winning in each game scenario using binomial distribution formula

    • Compare the probabilities to determine which game scenario is preferable

    • In game1, the probability of winning is p. In game2, the probability of winning is the sum of probabilities of making 2 or 3 baskets

    • If p is high, game1 is pref...

  • Answered by AI
  • Q7. Given a dictionary of words, I have to go from one word to another in least number of transitions where a transition is a defined as changing any letter of the current word such that the new word is also i...

Interview Preparation Tips

Round: Test
Experience: The test was on hackerrank.
Tips: * Fast coding and problem solving required
* Time crunch
* The test is valued a LOT in the hiring process
Duration: 120 minutes
Total Questions: 4

Round: Technical Interview
Experience: Question 1 : He tried to take the discussion to web based technologies to which I straightly told I don’t know. Not sure if that was a good decision. Nevertheless, he went over my resume a lot of times and asked about various projects.
Question 2 : Discussed the various projects related to it.
Question 3 : He asked this question because I had worked on django during my FB internship. I proposed a tree based structure. xyz.com/a/b/c ---> b is child of a, c is child of b.

Question 4 : Next he moved to a very interesting question. Given a simple text editor, I want to facilitate autocomplete feature. We discussed about syntactic methods using language specific keywords. I suggested a trie based implementation which he liked. Later he asked me to improve and redirected me to using scope of the variables, and grammar of the language. We discussed about all the steps I did in language translators lab (macrojava -> minijava -> typechecking -> miniIR -> microIR -> miniRA ->Mips) where we built a Java compiler in Java. We later hopped back to original question and I suggested that we can use grammar to to store multiple (nested kind of) tries for different scope. He asked me how would I define “scope”. He gave me a scenario which helped me come up with the nested trie structure
int a;
{
int b;
{
int c; //a b c can be used
}
{
int d; //a b d can be used
}
}
He then asked me details of how I would code. I said we could use the respective visitors and maintain the current trie root for scope. He liked it but I missed at 2 places :
1. He asked me about token generation used in a compiler and I said flex and bison. I was expected to elaborate a bit.
2. He asked me how the grammar is generated and how the visitors are invoked. I couldn’t explain properly because I was not thorough with it.
Tips: * Keep smiling in the interviews.
* My interviewer had hopped from Microsoft to Visa. We had a short detailed discussion on how the transition was and what drove him to do that.
* It’s always good to know about the company to pick up interesting discussions, read up latest articles and news
* The interviewers want to see if you are passionate about what they are building. Their PPT (Pre Placement Talk) was also focussed majorly on the technologies they are building.
* If you take a question in a direction, make sure you are very very thorough with it. I took it in the direction of compilers, but couldn't make the transition seamlessly because I wasn't thorough with a lot of things (like token generation, visitor invocation).
* Not sure if telling upfront that you don't know about web technologies when you are applying for a profile that might need it is a good idea or not.


Round: Technical Interview
Experience: I think he was a senior person and spoke very passionately about the work that is happening in visa Bangalore office.

Question 1 : I said maybe I should have learnt a little about web based technologies. I think he was looking for a more generic answer.
Question 2 : I went ahead with calculating the expected score where my score random variable = 1 with probability p, and 0 with probability (1-p). I conditioned that expected score of game1 > game2 which would give me the range of p. I goofed up the equations twice but he said he liked my approach and I was just there

Question 3 : I suggested building a graph where a node is a word and an edge means a transition, and then performing BFS. He said that was obvious and that he was more interested in knowing how I build the graph. I suggested a method to reduce the number of string comparisons by storing a count vector with each word. Count vector is a 26 length vector where count[i] = number of times that letter occurs in the word. I would do string comparison to identify neighbours only if the difference in count vectors in 2. Eg, cot = cat - a + o. String comparison is still needed because of false positives. Eg, oct = cat - a + o but cat -> oct is not a valid transition. He liked my approach and asked me to code, discussed the complexity.
Tips: * Don't be naive around a senior engineer. Be confident.
* Explain your approach before going ahead solving it. I missed that in Q1 and for a long time he didn't know what I was heading towards.
* Write clean code, practice coding on paper to make sure you write compilable code. Shabby code is a turn off.
* Show passion for the company you are applying for.

General Tips: * Be friendly and keep smiling.
* Know about the company, well in detail. Recent news, articles, acquisitions, organisational changes, new offices, new product, etc.
* Know about the volume the company handles, certain mind boggling figures, what the company *does not* do
* If you are introducing yourself as an expert in a certain field, be prepared for questions like "How will you contribute to our company with your expertise" type of questions.
* Be very very thorough with every single thing you write on your resume. A small point you weren't sure about might become the basis of your whole interview. Don't write things you are unsure of, or have worked very little on.
Skill Tips: * I think I didn’t take Visa very seriously. I was assuming they won’t take a undergrad and they won’t take me because I have 0 knowledge in web based technologies. I might have acted a little cocky.
* They had nice pie diagrams which shows that they had done thorough research about each and every candidate based on resume and the coding test.
* They value the coding test a lot.
* Be very thorough with the projects you write on resume. They will give you a problem which won't be straightforward and will map onto one of your course projects. You are expected to do the mapping seamlessly. Every bit of the discussion you have with the interviewer can be your next problem.
* Brush up on web based technologies if you can.
* There will be a HR round as well if you clear the technical interviews.

Skills: Maths(esp Probability), Design, Passion, Web Technologies, Technical Skill And Speaking Skill, Coding Skills
College Name: IIT Madras
Motivation: * Been the leader since more than half a century, been through the technological revolution.
* Revolutionising payments architecture. Building something of greatest need, so elegant and optimised, yet producing such consistent performance.
* Keeping up with the need of the generation by introducing features which are brand new. Eg, “all-purpose credit card”.
* Loved their PPT (Pre Placement Talk). Volume of the data and processing is IMMENSE. Billions of transactions in a year voluming up to trillions. More than 200 countries in the world --> these stats are HUGE.
* Fraud detection is a space I would have loved to work on given that I come from a Data Mining background.

Funny Moments: Chucked out before HR round :P

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. Why would you like to join Visa and why?
  • Ans. 

    I want to join Visa to contribute to innovative payment solutions and be part of a global leader in financial technology.

    • Visa is at the forefront of digital payment innovation, allowing me to work on cutting-edge technologies.

    • The company's commitment to security aligns with my passion for developing secure software solutions.

    • Visa's global presence offers opportunities to collaborate with diverse teams and learn from di...

  • Answered by AI
  • Q2. Tell me about yourself
  • Ans. 

    I'm a passionate software engineer with a strong background in full-stack development and a love for problem-solving.

    • Graduated with a degree in Computer Science from XYZ University.

    • Worked at ABC Corp, where I developed a web application that improved user engagement by 30%.

    • Proficient in languages like JavaScript, Python, and Java, with experience in frameworks like React and Django.

    • Enjoy collaborating in agile teams an...

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Coding Questions were fairly standard ones.
Duration: 75 minutes
Total Questions: 42

Round: Interview
Experience: Networks based questions, firewalls, TCP/IP and other OSI layers

Round: Interview
Experience: Coding questions. Asked to code on paper. Questions on Object Oriented Design.

Skills: Networks basics, OOPs basics, Coding Skills
College Name: IIT Guwahati
Motivation: Profiles offered, Package, Location

Interview Preparation Tips

Round: Test
Experience: Questions on
1. Programming: 10 Questions2. Machine Learning Hadoop MCQ: 6 Questions3. Networking MCQ: 6 Questions4. Operating System: 6 Questions5. Infrastructure: 6 Questions6. Application Security: 6 Questions
Tips: Questions were simple , except sections 2,5 unless you have a basic idea about it.
Duration: 75 minutes
Total Questions: 34+2

Round: Technical Interview
Experience: – Projects, Internship– Asymmetric and Symmetric encryption with some real world usage– Concepts behind Digital Signature and Digital Certificates– Detailed discussion on HTTPS– Basic OS concepts : Threads, Mutex , Semaphores– Basic OOPS concepts : Virtual functions , Function overloading and overriding , encapsulation.
Tips: Focus on Network Security concepts !

Round: Technical Interview
Experience: – Projects , Internship– Some discussion on Testing and how you would design a unit test case and a complete project test case. Discussion on Automated Testing.– How does a Web application work.– Software Development Models– Discussion on interpreted language and compiled language– Some DBMS basics for efficiency :- Indexing viz. B+trees , Hashing.– Some discussion on Apple Pay , VbV (Verified by Visa) (informal)

Round: HR Interview
Experience: Basic HR questions !

General Tips: Confidence is the key along with sufficient coding practice both on the IDE and pen-paper.
Skills: Network Security, Programming, Algorithms, Operating System
College Name: IIT ROORKEE

PayPal Interview FAQs

How many rounds are there in PayPal Software Engineer interview for freshers?
PayPal interview process for freshers usually has 3 rounds. The most common rounds in the PayPal interview process for freshers are Coding Test, One-on-one Round and Resume Shortlist.
How to prepare for PayPal Software Engineer interview for freshers?
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, SQL, Oracle, Agile and Coding.
What are the top questions asked in PayPal Software Engineer interview for freshers?

Some of the top questions asked at the PayPal Software Engineer interview for freshers -

  1. one of the question was about return min element in stack in constant time (O(1...read more
  2. find the and return if the given file path existing in the given file hierarcy(...read more
  3. Given a usecase to build parking sys...read more

Tell us how to improve this page.

Overall Interview Experience Rating

4/5

based on 2 interview experiences

Difficulty level

Moderate 100%

Duration

Less than 2 weeks 100%
View more
PayPal Software Engineer Salary
based on 330 salaries
₹14 L/yr - ₹48 L/yr
238% more than the average Software Engineer Salary in India
View more details

PayPal Software Engineer Reviews and Ratings

based on 29 reviews

3.6/5

Rating in categories

3.1

Skill development

3.6

Work-life balance

3.7

Salary

2.7

Job security

3.5

Company culture

2.9

Promotions

3.1

Work satisfaction

Explore 29 Reviews and Ratings
Software Engineer2
345 salaries
unlock blur

₹22.2 L/yr - ₹40 L/yr

Software Engineer
330 salaries
unlock blur

₹14 L/yr - ₹48 L/yr

Senior Software Engineer
304 salaries
unlock blur

₹23.7 L/yr - ₹42 L/yr

Software Engineer III
284 salaries
unlock blur

₹20 L/yr - ₹66 L/yr

Data Scientist
265 salaries
unlock blur

₹18.5 L/yr - ₹65 L/yr

Explore more salaries
Compare PayPal with

Paytm

3.2
Compare

Razorpay

3.5
Compare

Visa

3.5
Compare

MasterCard

3.9
Compare
write
Share an Interview