Upload Button Icon Add office photos

Filter interviews by

PayPal Full Stack Engineer Interview Questions and Answers

Updated 5 May 2019

PayPal Full Stack Engineer Interview Experiences

1 interview found

Interview Questionnaire 

4 Questions

  • Q1. React questions How do you organize code in react (components, containers, separation of logic) ? MVC patterns UI design Finding local maxima in series of numbers
  • Q2. Basics of HTML, CSS, Javascript css transform properties implement redux publish subscribe model
  • Q3. Singleton pattern Few algorithmic questions Anagram problems Design patterns
  • Q4. JSON.stringify implementation Problem solving methodology Array - sorting and finding maxium related problem middlewares in node js

Interview Preparation Tips

Round: Test
Experience: Hacker rank testing round

The questions were based on dynamic programming


Interview questions from similar companies

I was interviewed in Sep 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    Longest Palindromic Subsequence Problem Statement

    Given a string A consisting of lowercase English letters, determine the length of the longest palindromic subsequence within A.

    Explanation:

    • A subsequ...
  • Ans. Recursive Approach

    The main idea behind this approach is to use recursion. The idea is to compare the first character of the string A[i..j] with its last character. There are two possibilities:

    1. If the first character of the string is the same as the last character, we include first and last characters in the palindrome and do a recursive call for the remaining substring A[i + 1, j - 1].
    2. If the last character of the string...
  • Answered Anonymously
  • Q2. 

    Word Pattern Problem Statement

    Given two strings S and T, determine if S follows the same pattern as T.

    A full match means there is a bijection between a letter of T and a non-empty word of S.

    Example:

    ...
  • Ans. Hashmap

    We will use two hashmaps ‘charToWord’ and ‘wordToChar’ to track which character of ‘T’ maps to which word of ‘S’ and which word of ‘S’ maps to which character of ‘T’,  respectively.

     

    Here is the algorithm:

    1. We initialise two hashmaps ‘charToWord’ and ‘wordToChar’.
    2. We scan each character-word pair
      1. If the character is not present in ‘charToWord’ 
        1. If the word is already present in ‘wordToChar’ 
          1. Return ...
  • Answered Anonymously
Round 2 - Video Call 

(2 Questions)

Round duration - 40 Minutes
Round difficulty - Easy

  • Q1. 

    Level Order Traversal Problem Statement

    Given a binary tree of integers, return the level order traversal of the binary tree.

    Input:

    The first line contains an integer 'T', representing the number of te...
  • Ans. Breadth First Search

    In the level order traversal, we will be using queue data structure which has the property FIRST IN FIRST OUT that’s why which nodes come first in current level the children of that node will also come first for the next level. So, we visit all the nodes one by one of the current level and push into the queue so that when we will be complete with the current level, then we can start exploring nodes ...

  • Answered Anonymously
  • Q2. 

    Next Greater Node in Linked List Problem Statement

    In a set of linked ninja villages, the goal is to determine if a stronger ninja exists in the nearest village linked ahead. Given a linked list of 'N' in...

  • Ans. Brute Force

    We will iterate through the given linked list of elements (nodes) with the help of two nested loops. Where we will check for every node whether there exists a next node with a value bigger than the value of current node and subsequently build the ‘ans’ list (array) and return it.

     

    The algorithm will be-

     

    1. We will run a loop for the starting node (head) of the given linked list.
    2. From every node we will ...
  • Answered Anonymously
Round 3 - HR 

Round duration - 15 Minutes
Round difficulty - Easy

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Full Stack Engineer in PuneEligibility criteriaAbove 7 CGPA, Resume shortlisting on the basis of projectsMasterCard interview preparation:Topics to prepare for the interview - Data Structure, Algorithms, JavaScript, HTML/CSS, ReactTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Be consistent, practice regularly whatever you read/study.
Tip 2 : Apply what you learn through code.

Application resume tips for other job seekers

Tip 1 : Have some projects on your resume.
Tip 2 : If you have an internship or training explain it in a proper way like what are the techniques you learned during your training.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview experience
1
Bad
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
No response

I applied via Approached by Company and was interviewed in Sep 2024. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Sal queries simeple data structure question finding largest number in am array.
  • Q2. Solid principal

Interview Preparation Tips

Interview preparation tips for other job seekers - Simply waste of time they asked me 3-4 questions and didn't responded .
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

It will be a basic maths questions.

Round 2 - Group Discussion 

As a general topic of trend in world.

Round 3 - Coding Test 

To be known for programming knowledge about us.

Round 4 - Technical 

(2 Questions)

  • Q1. Programming oridanited
  • Q2. Skill knowledge questions
Round 5 - HR 

(2 Questions)

  • Q1. Tell me about your self.
  • Q2. Family background .

Interview Preparation Tips

Interview preparation tips for other job seekers - pls don't stress the candidate to suffer as high .
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(2 Questions)

  • Q1. What are the java 1.8 features?
  • Ans. 

    Java 1.8 introduced several new features including lambda expressions, functional interfaces, streams, and default methods.

    • Lambda expressions allow you to write code in a more concise and readable way.

    • Functional interfaces are interfaces with a single abstract method, used for lambda expressions.

    • Streams provide a way to work with sequences of elements and perform operations on them.

    • Default methods allow interfaces to h...

  • Answered by AI
  • Q2. Write program to print element sorting by using java 8 feature.
  • Ans. 

    Program to print elements sorted using Java 8 features

    • Use Stream API to sort the elements

    • Use lambda expressions for sorting

    • Use the sorted() method to sort the elements

  • Answered by AI

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(2 Questions)

  • Q1. Experience in ReactJS
  • Ans. 

    I have 2 years of experience in ReactJS, including building interactive user interfaces and integrating with backend services.

    • Developed a responsive web application using ReactJS, Redux, and Material-UI

    • Implemented RESTful APIs to fetch and update data in the application

    • Utilized React Router for client-side routing and navigation

    • Worked on optimizing performance by using memoization and lazy loading techniques

  • Answered by AI
  • Q2. Experience in Spring Boot

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
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 - One-on-one 

(2 Questions)

  • Q1. What is react and why are we using it
  • Ans. 

    React is a JavaScript library for building user interfaces.

    • React allows for building reusable UI components

    • It uses a virtual DOM for efficient updates

    • React is declarative, making it easier to reason about code

    • It is widely used in web development for its performance and flexibility

  • Answered by AI
  • Q2. What is redux in react
  • Ans. 

    Redux is a predictable state container for JavaScript apps.

    • Redux is a state management library for React

    • It helps in managing the state of the application in a predictable manner

    • It follows a unidirectional data flow pattern

    • It has three main components: store, actions, and reducers

    • Store holds the state of the application

    • Actions are plain JavaScript objects that describe what happened

    • Reducers specify how the application's...

  • Answered by AI
Round 3 - Assignment 

Create a react app with redux

Interview Preparation Tips

Interview preparation tips for other job seekers - Just stay put and don't panic. So basically there are 10 people taking my interview at the same time which is too much but you have to find a way to stay calm

Skills evaluated in this interview

I was interviewed in Aug 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 70 minutes
Round difficulty - Medium

The test started around 3 pm and was of 70 minutes. 3 coding questions were asked which were mainly on trees and number theory.

  • Q1. 

    Factorial Calculation Problem Statement

    Develop a program to compute the factorial of a given integer 'n'.

    The factorial of a non-negative integer 'n', denoted as n!, is the product of all positive integ...

  • Ans. Using while() loop
    • This can be done using an if-else-if ladder to check for negative,0, and positive numbers.
    • If the input is a positive number use a while loop to multiply n with n-1, n-2…1 and get the desired output.
    Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
  • Answered Anonymously
  • Q2. 

    Next Greater Element Problem Statement

    Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...

  • Ans. Brute Force

    For every element in the array, we will run a loop on its right side. As soon as we find an element on its right side which is greater than it, we will break the loop, assign it as the NGE of this element, move forward, and do the same for the next element.

    Space Complexity: O(1)Explanation:

    O(1)

     

    No extra space is used.

    Time Complexity: O(n^2)Explanation:

    O(N ^ 2),  Where N is the number of elements ...

  • Answered Anonymously
  • Q3. 

    Ceil Value from BST Problem Statement

    Given a Binary Search Tree (BST) and an integer, write a function to return the ceil value of a particular key in the BST.

    The ceil of an integer is defined as the s...

  • Ans. Brute Force

    We will traverse the Binary search tree from the root node till we find the node whose key value is given, and upon getting that, we return the ceil value of it.


     

    The steps are as follows:  

    • Initialize ‘ceilValue’ to store the ceil value to be returned.
    • We run a while loop till the value of the node is not equal to NULL.
      • If the value of the node is equal to ‘X’’ then we return the node value.
      • If th...

  • Answered Anonymously
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Interviewer was very friendly and supportive. My interview happened on google meet. What is a View? What is Denormalization? Difference between “==” and “===” operators in js.

  • Q1. 

    Sub Sort Problem Statement

    You are given an integer array ARR. Determine the length of the shortest contiguous subarray which, when sorted in ascending order, results in the entire array being sorted in a...

  • Ans. Brute Force

    In this approach, we consider every possible subarray that can be formed from the given array ‘ARR’. For every subarray ARR[i … j] considered, we need to check whether this is the smallest unsorted subarray or not.

     

    The algorithm is as follows:

    1. Let’s take the variable ‘ANS’ equal to 'N' (the length of the array) initially.
    2. Now for every subarray ARR[i … j], we will find the maximum and minimum value lying ...
  • Answered Anonymously
  • Q2. 

    Sort 0 1 2 Problem Statement

    Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.

    Input:

    The first line contains an integer 'T' representing the n...
  • Ans. Sorting

    Use any good sorting algorithm like Merge Sort, Quick Sort or inbuilt sorting function of different languages.

    • Sort the Array and just return.
    Space Complexity: O(1)Explanation:

    O(1), As we are using constant space.

    Time Complexity: O(nlogn)Explanation:

    O(N*log(N)), where ‘N’ is the size of the array.

    We are using inbuilt sort algorithm which has Overall Time Complexity O(N*log(N))

  • Answered Anonymously
Round 3 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

What are some of the advantages of Angular over other frameworks?

  • Q1. 

    Cousin Nodes in a Binary Tree

    Determine if two nodes in a binary tree are cousins. Nodes are considered cousins if they are at the same level and have different parents.

    Explanation:

    In a binary tree, e...

  • Ans. Recursive Solution
    • Find the levels of both the given nodes.
    • This can be done by making a separate function for finding the level/by using level order traversal.
    • The levels should be the same.
    • Check if both the nodes are siblings or not.
    • This can again be done by simply going through the entire Binary Tree and checking if the node’s children are the given two nodes. If this is true, then given two nodes are siblings and henc...
  • Answered Anonymously
Round 4 - HR 

(3 Questions)

Round duration - 10 minutes
Round difficulty - Easy

I got a call from HR in the evening around 6:30 pm.

  • Q1. Can you tell me about yourself?
  • Ans. 

    Tip 1 : Do prepare such questions before hand only.
    Tip 2 : Speak confidently.

  • Answered Anonymously
  • Q2. How was your experience with the previous two technical rounds?
  • Ans. 

    Tip 1 : Do remember the names of the interviewers who took your interview.

  • Answered Anonymously
  • Q3. What do you know about Paytm?
  • Ans. 

    Tip 1 : Do a research before hand about what does the company do.

  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from TIET - Thapar Institute of Engineering And Technology. Eligibility criteriaAbove 7 CGPAPaytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, OOPS, OS, DBMS, Computer Networks, System DesignTime required to prepare for the interview - 7 monthsInterview preparation tips for other job seekers

Tip 1 : Practice at least 350 questions to have good hold on data structures
Tip 2 : Practice at least 100 - 150 company specific coding questions.
Tip 3 : Try to give timing contests to build up your speed.

Application resume tips for other job seekers

Tip 1 : Keep your resume only of 1 page
Tip 2 : Showcase your major projects on the top

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Sep 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    Longest Palindromic Subsequence Problem Statement

    Given a string A consisting of lowercase English letters, determine the length of the longest palindromic subsequence within A.

    Explanation:

    • A subsequ...
  • Ans. Recursive Approach

    The main idea behind this approach is to use recursion. The idea is to compare the first character of the string A[i..j] with its last character. There are two possibilities:

    1. If the first character of the string is the same as the last character, we include first and last characters in the palindrome and do a recursive call for the remaining substring A[i + 1, j - 1].
    2. If the last character of the string...
  • Answered Anonymously
  • Q2. 

    Word Pattern Problem Statement

    Given two strings S and T, determine if S follows the same pattern as T.

    A full match means there is a bijection between a letter of T and a non-empty word of S.

    Example:

    ...
  • Ans. Hashmap

    We will use two hashmaps ‘charToWord’ and ‘wordToChar’ to track which character of ‘T’ maps to which word of ‘S’ and which word of ‘S’ maps to which character of ‘T’,  respectively.

     

    Here is the algorithm:

    1. We initialise two hashmaps ‘charToWord’ and ‘wordToChar’.
    2. We scan each character-word pair
      1. If the character is not present in ‘charToWord’ 
        1. If the word is already present in ‘wordToChar’ 
          1. Return ...
  • Answered Anonymously
Round 2 - Video Call 

(2 Questions)

Round duration - 40 Minutes
Round difficulty - Easy

  • Q1. 

    Level Order Traversal Problem Statement

    Given a binary tree of integers, return the level order traversal of the binary tree.

    Input:

    The first line contains an integer 'T', representing the number of te...
  • Ans. Breadth First Search

    In the level order traversal, we will be using queue data structure which has the property FIRST IN FIRST OUT that’s why which nodes come first in current level the children of that node will also come first for the next level. So, we visit all the nodes one by one of the current level and push into the queue so that when we will be complete with the current level, then we can start exploring nodes ...

  • Answered Anonymously
  • Q2. 

    Next Greater Node in Linked List Problem Statement

    In a set of linked ninja villages, the goal is to determine if a stronger ninja exists in the nearest village linked ahead. Given a linked list of 'N' in...

  • Ans. Brute Force

    We will iterate through the given linked list of elements (nodes) with the help of two nested loops. Where we will check for every node whether there exists a next node with a value bigger than the value of current node and subsequently build the ‘ans’ list (array) and return it.

     

    The algorithm will be-

     

    1. We will run a loop for the starting node (head) of the given linked list.
    2. From every node we will ...
  • Answered Anonymously
Round 3 - HR 

Round duration - 15 Minutes
Round difficulty - Easy

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Full Stack Engineer in PuneEligibility criteriaAbove 7 CGPA, Resume shortlisting on the basis of projectsMasterCard interview preparation:Topics to prepare for the interview - Data Structure, Algorithms, JavaScript, HTML/CSS, ReactTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Be consistent, practice regularly whatever you read/study.
Tip 2 : Apply what you learn through code.

Application resume tips for other job seekers

Tip 1 : Have some projects on your resume.
Tip 2 : If you have an internship or training explain it in a proper way like what are the techniques you learned during your training.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Easy questions were asked. Practice aptitude questions from net along with javascript

Round 2 - One to one 

(2 Questions)

  • Q1. Write a servlet in java
  • Ans. 

    A servlet in Java is a server-side component that extends the capabilities of servers.

    • Create a class that extends HttpServlet

    • Override the doGet or doPost method

    • Implement the logic for handling requests and generating responses

    • Register the servlet in web.xml or using annotations

  • Answered by AI
  • Q2. Sql queries and jdbc questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Be yourself and be prepared with your project and basic coding concepts

Skills evaluated in this interview

PayPal Interview FAQs

How to prepare for PayPal Full Stack Engineer 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 Computer science, Financial Services, Coding, SOA and Data Structures.
What are the top questions asked in PayPal Full Stack Engineer interview?

Some of the top questions asked at the PayPal Full Stack Engineer interview -

  1. React questions How do you organize code in react (components, containers, sep...read more
  2. JSON.stringify implementation Problem solving methodology Array - sorting and f...read more
  3. Basics of HTML, CSS, Javascript css transform properties implement redux publis...read more

Tell us how to improve this page.

Interview Questions from Similar Companies

Paytm Interview Questions
3.3
 • 763 Interviews
FIS Interview Questions
3.9
 • 476 Interviews
PhonePe Interview Questions
4.0
 • 302 Interviews
HighRadius Interview Questions
2.9
 • 180 Interviews
Fiserv Interview Questions
3.1
 • 168 Interviews
Razorpay Interview Questions
3.6
 • 148 Interviews
Visa Interview Questions
3.6
 • 137 Interviews
MasterCard Interview Questions
4.0
 • 132 Interviews
Angel One Interview Questions
4.0
 • 130 Interviews
View all
Software Engineer2
286 salaries
unlock blur

₹15 L/yr - ₹45 L/yr

Software Engineer III
247 salaries
unlock blur

₹17 L/yr - ₹66 L/yr

Software Engineer
242 salaries
unlock blur

₹13.5 L/yr - ₹50 L/yr

Senior Software Engineer
228 salaries
unlock blur

₹15 L/yr - ₹53 L/yr

Risk Analyst
165 salaries
unlock blur

₹4.8 L/yr - ₹11 L/yr

Explore more salaries
Compare PayPal with

Paytm

3.3
Compare

Razorpay

3.6
Compare

Visa

3.5
Compare

MasterCard

4.0
Compare
Did you find this page helpful?
Yes No
write
Share an Interview