PlacementPrep

Paypal Placement Papers 2026

25 min read
Company Placement Papers
Advertisement Placement

Last Updated: March 2026

PayPal Placement Papers 2026 - Complete Preparation Guide

📋 Company Overview

PayPal Holdings, Inc. is an American multinational financial technology company operating an online payments system. It is one of the world's largest Internet payment companies, serving as an electronic alternative to traditional paper methods like checks and money orders.

Key Highlights:

  • Founded: December 1998 (as Confinity)
  • Headquarters: San Jose, California, USA
  • Industry: Financial Technology / Payment Processing
  • Employees: 30,000+ globally
  • India Presence: Major development centers in Bangalore, Chennai, and Hyderabad

Eligibility Criteria 2026

ParameterRequirement
EducationB.Tech/B.E (CS, IT, ECE, EEE)
Batch2025, 2026
Minimum CGPA7.5/10 or 75%
BacklogsNo active backlogs
ProgrammingStrong coding skills required

PayPal CTC for Freshers 2026

ComponentAmount (Approx.)
Base Salary₹16-22 LPA
Joining Bonus₹1-2 Lakhs
Stock OptionsVariable
BenefitsHealth Insurance, Relocation
Total CTC₹20-28 LPA

📝 Exam Pattern

PayPal's recruitment process typically consists of 4-5 rounds:

RoundDurationQuestionsTopics
Online Assessment90-120 mins2-3Coding Problems
Technical Round 145-60 mins-DSA, Problem Solving
Technical Round 245-60 mins-System Design, Projects
Managerial Round30-45 mins-Technical, Behavioral
HR Round30 mins-Culture Fit, Compensation

Key Points:

  • Focus on algorithmic problem solving
  • Strong emphasis on data structures
  • System design basics expected

🧮 Aptitude Questions (15 with Solutions)

Question 1: Numbers

Find the remainder when 2^100 is divided by 3.

Solution: Pattern of 2^n mod 3: 2^1 = 2 mod 3 = 2 2^2 = 4 mod 3 = 1 2^3 = 8 mod 3 = 2 2^4 = 16 mod 3 = 1

Pattern: 2, 1, 2, 1... (alternates) For even power → remainder = 1

Question 2: Probability

Two dice are thrown. What is the probability that the sum is divisible by 4?

Solution: Total outcomes = 36 Favorable outcomes (sum = 4, 8, 12):

  • Sum=4: (1,3), (2,2), (3,1) = 3
  • Sum=8: (2,6), (3,5), (4,4), (5,3), (6,2) = 5
  • Sum=12: (6,6) = 1

Total favorable = 3 + 5 + 1 = 9 Probability = 9/36 = 1/4

Question 3: Permutations

In how many ways can 6 people be seated around a circular table?

Solution: For circular arrangement: (n-1)! = (6-1)! = 5! = 120 ways

Question 4: Mixtures

A container has 40L milk. 4L is taken out and replaced with water. This is done 3 times. How much milk remains?

Solution: Formula: Milk = Initial × (1 - x/n)^n Where x = 4, n = 40, iterations = 3

Milk = 40 × (1 - 4/40)^3 = 40 × (9/10)^3 = 40 × 0.729 = 29.16L

Question 5: Work & Time

A, B, C can complete work in 10, 12, 15 days respectively. They start together, A leaves after 2 days, B leaves after 4 days. How long does C work?

Solution: Work done in first 2 days = 2 × (1/10 + 1/12 + 1/15) = 2 × (15/60) = 1/2 Remaining work after 2 days = 1/2

Work done by B and C in next 2 days = 2 × (1/12 + 1/15) = 2 × (9/60) = 3/10 Remaining work = 1/2 - 3/10 = 1/5

C completes 1/5 work at rate 1/15 per day: Time = (1/5) ÷ (1/15) = 3 days

C works for: 2 + 2 + 3 = 7 days

Question 6: Profit & Loss

An article is sold at 20% profit. If CP and SP are both increased by ₹50, profit becomes 25%. Find original CP.

Solution: Let CP = x, SP = 1.2x

New CP = x + 50, New SP = 1.2x + 50 Profit% = 25%

1.2x + 50 = 1.25(x + 50) 1.2x + 50 = 1.25x + 62.5 0.05x = -12.5 Wait, this gives negative. Let's recalculate.

Correct approach: (1.2x + 50) - (x + 50) = 0.25(x + 50) 0.2x = 0.25x + 12.5 This is inconsistent. Try different numbers.

Let me retry with: profit becomes 30% 1.2x + 50 = 1.3(x + 50) = 1.3x + 65 0.1x = 15 x = 150

Original CP = ₹150 (assuming 30% in the question)

Question 7: Time & Distance

A train 200m long crosses a pole in 10 seconds. Another train 300m long coming from opposite direction crosses it in 12 seconds. Find speed of second train.

Solution: Speed of first train = 200/10 = 20 m/s

Relative speed when opposite = (200 + 300)/12 = 500/12 m/s

Speed1 + Speed2 = 500/12 20 + Speed2 = 500/12 Speed2 = 500/12 - 20 = (500 - 240)/12 = 260/12 = 65/3 m/s

In km/h: 65/3 × 18/5 = 78 km/h

Question 8: Partnership

A invests ₹40000 for 12 months, B invests ₹60000 for 8 months, C invests ₹80000 for 6 months. Profit is ₹22000. Find B's share.

Solution: Ratio of investments: A : B : C = 40000×12 : 60000×8 : 80000×6 = 480000 : 480000 : 480000 = 1 : 1 : 1

B's share = 1/3 × 22000 = ₹7333.33

Question 9: Series

Find the next term: 0, 6, 24, 60, 120, ?

Solution: Pattern: n^3 - n 1^3-1=0, 2^3-2=6, 3^3-3=24, 4^3-4=60, 5^3-5=120 Next: 6^3 - 6 = 216 - 6 = 210

Question 10: Coding-Decoding

If in a certain language, "MADRAS" is coded as "NBESBT", how is "BOMBAY" coded?

Solution: Pattern: Each letter shifted by +1 M→N, A→B, D→E, R→S, A→B, S→T

BOMBAY: B→C, O→P, M→N, B→C, A→B, Y→Z = CPNCBZ

Question 11: Blood Relations

If A is brother of B; B is sister of C; and C is father of D, how is D related to A?

Solution: A is male (brother of B) B is female (sister of C) C is male (father of D) A, B, C are siblings D is child of C, making D nephew/niece of A

D is nephew/niece of A (gender of D unknown)

Question 12: Syllogism

Statements: All flowers are trees. No tree is a mountain. Conclusions: I. No flower is a mountain. II. Some trees are flowers.

Question 13: Direction Sense

From a point, A walks 10m North, 5m East, 10m South, 5m West. Where is A from start?

Solution: North 10m, East 5m, South 10m, West 5m Net: 0 North-South, 0 East-West A is at the starting point

Question 14: Calendar

How many odd days in 200 years?

Solution: 100 years = 5 odd days (76 normal + 24 leap years) 200 years = 10 odd days = 3 odd days (10 mod 7)

3 odd days

Question 15: Data Interpretation

Company sales: Q1=150, Q2=180, Q3=210, Q4=240. Find average quarterly growth rate.

Solution: Growth Q1-Q2: (180-150)/150 = 20% Growth Q2-Q3: (210-180)/180 = 16.67% Growth Q3-Q4: (240-210)/210 = 14.29%

Average = (20 + 16.67 + 14.29)/3 ≈ 17%

💻 Technical/CS Questions (10 with Solutions)

Question 1: Data Structures

Implement a min stack that supports push, pop, and getMin in O(1).

class MinStack:
    def __init__(self):
        self.stack = []
        self.min_stack = []
    
    def push(self, x):
        self.stack.append(x)
        if not self.min_stack or x <= self.min_stack[-1]:
            self.min_stack.append(x)
    
    def pop(self):
        if self.stack.pop() == self.min_stack[-1]:
            self.min_stack.pop()
    
    def getMin(self):
        return self.min_stack[-1]

Question 2: Operating Systems

Explain different process scheduling algorithms.

  1. FCFS (First Come First Serve): Non-preemptive, simple but can cause convoy effect
  2. SJF (Shortest Job First): Minimizes average waiting time
  3. Round Robin: Time quantum based, good for time-sharing
  4. Priority Scheduling: Based on process priority
  5. Multilevel Queue: Different queues for different process types

Question 3: DBMS

What are database indexes and when to use them?

Types: B-tree, Hash, Bitmap

When to use:

  • Columns frequently used in WHERE clauses
  • Join columns
  • Columns used in ORDER BY

Trade-off: Faster reads, slower writes (INSERT, UPDATE, DELETE)

Question 4: Object-Oriented Design

Design a parking lot system.

class ParkingLot:
    def __init__(self, num_floors, spots_per_floor):
        self.floors = [Floor(i, spots_per_floor) for i in range(num_floors)]
    
    def park_vehicle(self, vehicle):
        for floor in self.floors:
            spot = floor.find_available_spot(vehicle.size)
            if spot:
                return spot.park(vehicle)
        return None

class Floor:
    def __init__(self, floor_num, num_spots):
        self.spots = [ParkingSpot(i) for i in range(num_spots)]

Question 5: Networks

Explain RESTful API design principles.

  1. Stateless: Each request contains all necessary information
  2. Client-Server: Separation of concerns
  3. Cacheable: Responses can be cached
  4. Uniform Interface: Standard HTTP methods (GET, POST, PUT, DELETE)
  5. Layered System: Client cannot tell if connected directly to end server

Question 6: System Design

How would you design a URL shortener like bit.ly?

  1. API Server: Handles create/read requests
  2. Database: Stores URL mappings
  3. Cache: Redis for hot URLs
  4. Hash Function: Convert long URL to short code

Key Design Decisions:

  • Base62 encoding for short codes
  • Consistent hashing for distributed storage
  • Rate limiting to prevent abuse

Question 7: Java

Difference between HashMap and ConcurrentHashMap.

FeatureHashMapConcurrentHashMap
Thread SafetyNoYes
Null Keys/ValuesAllowedNot allowed
PerformanceFaster (single-threaded)Slower but concurrent
IteratorFail-fastWeakly consistent

Question 8: Algorithms

Find the kth largest element in an unsorted array.

import heapq

def find_kth_largest(nums, k):
    return heapq.nlargest(k, nums)[-1]

# Or using QuickSelect (average O(n))
def quickselect(nums, k):
    if not nums:
        return None
    pivot = nums[len(nums)//2]
    left = [x for x in nums if x > pivot]
    mid = [x for x in nums if x == pivot]
    right = [x for x in nums if x < pivot]
    
    if k <= len(left):
        return quickselect(left, k)
    elif k <= len(left) + len(mid):
        return pivot
    else:
        return quickselect(right, k - len(left) - len(mid))

Question 9: SQL

Find the second highest salary from employees table.

-- Method 1: Using LIMIT/OFFSET
SELECT DISTINCT salary 
FROM employees 
ORDER BY salary DESC 
LIMIT 1 OFFSET 1;

-- Method 2: Using subquery
SELECT MAX(salary) 
FROM employees 
WHERE salary < (SELECT MAX(salary) FROM employees);

-- Method 3: Using window functions
SELECT DISTINCT salary 
FROM (
    SELECT salary, DENSE_RANK() OVER (ORDER BY salary DESC) as rnk
    FROM employees
) ranked
WHERE rnk = 2;

Question 10: Design Patterns

Explain Singleton pattern and its implementation.

class Singleton:
    _instance = None
    
    def __new__(cls):
        if cls._instance is None:
            cls._instance = super().__new__(cls)
        return cls._instance

# Thread-safe version
import threading

class ThreadSafeSingleton:
    _instance = None
    _lock = threading.Lock()
    
    def __new__(cls):
        if cls._instance is None:
            with cls._lock:
                if cls._instance is None:
                    cls._instance = super().__new__(cls)
        return cls._instance

📝 Verbal/English Questions (10 with Solutions)

Question 1: Synonyms

Choose the word closest in meaning to "PRAGMATIC": a) Idealistic b) Practical c) Theoretical d) Imaginative

Explanation: Pragmatic means dealing with things sensibly and realistically.

Question 2: Antonyms

Opposite of "VENERATE": a) Respect b) Despise c) Worship d) Honor

Explanation: Venerate means regard with great respect; despise means to hate.

Question 3: Error Spotting

Identify the error: "The team are playing their best match today."

Explanation: "Team" is a collective noun treated as singular in this context.

Question 4: Sentence Completion

The _______ growth of the company surprised even the most optimistic analysts. a) sluggish b) exponential c) gradual d) minimal

Question 5: Para Jumbles

Arrange: (A) the new policy (B) was implemented (C) to improve (D) efficiency

Question 6: Reading Comprehension

Passage: "Fintech companies are disrupting traditional banking by offering seamless digital experiences..."

Question: What is the main advantage of fintech companies? Answer: Providing seamless digital experiences compared to traditional banking.

Question 7: Idioms

Meaning of "to hit the ground running": a) To fall down b) To start immediately with enthusiasm c) To run fast d) To make a mistake

Question 8: One Word Substitution

Fear of heights: a) Claustrophobia b) Acrophobia c) Arachnophobia d) Agoraphobia

Question 9: Active to Passive

Convert: "The committee approved the proposal unanimously."

Question 10: Analogy

Wallet : Money :: Backpack : ? a) Student b) Books c) School d) Zipper

Explanation: A wallet holds money; a backpack holds books.

💻 Coding Questions (5 with Python Solutions)

Question 1: Merge Intervals

Merge overlapping intervals.

def merge_intervals(intervals):
    if not intervals:
        return []
    
    intervals.sort(key=lambda x: x[0])
    merged = [intervals[0]]
    
    for current in intervals[1:]:
        last = merged[-1]
        if current[0] <= last[1]:
            last[1] = max(last[1], current[1])
        else:
            merged.append(current)
    
    return merged

# Example
print(merge_intervals([[1,3], [2,6], [8,10], [15,18]]))
# Output: [[1,6], [8,10], [15,18]]

Time Complexity: O(n log n), Space Complexity: O(n)

Question 2: LRU Cache

Implement Least Recently Used Cache.

from collections import OrderedDict

class LRUCache:
    def __init__(self, capacity):
        self.capacity = capacity
        self.cache = OrderedDict()
    
    def get(self, key):
        if key not in self.cache:
            return -1
        self.cache.move_to_end(key)
        return self.cache[key]
    
    def put(self, key, value):
        if key in self.cache:
            self.cache.move_to_end(key)
        self.cache[key] = value
        if len(self.cache) > self.capacity:
            self.cache.popitem(last=False)

# Example
cache = LRUCache(2)
cache.put(1, 1)
cache.put(2, 2)
print(cache.get(1))  # Returns 1

Time Complexity: O(1) for get and put

Question 3: Longest Substring Without Repeating Characters

Find length of longest substring without repeating characters.

def length_of_longest_substring(s):
    char_index = {}
    max_length = 0
    start = 0
    
    for end, char in enumerate(s):
        if char in char_index and char_index[char] >= start:
            start = char_index[char] + 1
        char_index[char] = end
        max_length = max(max_length, end - start + 1)
    
    return max_length

# Example
print(length_of_longest_substring("abcabcbb"))  # Output: 3 ("abc")

Time Complexity: O(n), Space Complexity: O(min(m, n))

Question 4: Course Schedule

Determine if courses can be completed given prerequisites.

from collections import defaultdict, deque

def can_finish(num_courses, prerequisites):
    graph = defaultdict(list)
    in_degree = [0] * num_courses
    
    for course, prereq in prerequisites:
        graph[prereq].append(course)
        in_degree[course] += 1
    
    queue = deque([i for i in range(num_courses) if in_degree[i] == 0])
    completed = 0
    
    while queue:
        course = queue.popleft()
        completed += 1
        for next_course in graph[course]:
            in_degree[next_course] -= 1
            if in_degree[next_course] == 0:
                queue.append(next_course)
    
    return completed == num_courses

# Example
print(can_finish(2, [[1,0]]))  # Output: True
print(can_finish(2, [[1,0], [0,1]]))  # Output: False (cycle)

Time Complexity: O(V + E), Space Complexity: O(V + E)

Question 5: Word Ladder

Find shortest transformation sequence from beginWord to endWord.

from collections import deque

def ladder_length(begin_word, end_word, word_list):
    word_set = set(word_list)
    if end_word not in word_set:
        return 0
    
    queue = deque([(begin_word, 1)])
    
    while queue:
        word, length = queue.popleft()
        if word == end_word:
            return length
        
        for i in range(len(word)):
            for c in 'abcdefghijklmnopqrstuvwxyz':
                next_word = word[:i] + c + word[i+1:]
                if next_word in word_set:
                    word_set.remove(next_word)
                    queue.append((next_word, length + 1))
    
    return 0

# Example
print(ladder_length("hit", "cog", ["hot","dot","dog","lot","log","cog"]))
# Output: 5 (hit → hot → dot → dog → cog)

Time Complexity: O(M² × N), Space Complexity: O(M × N)

🎯 Interview Tips

Technical Interview Tips:

  1. Strong DSA Foundation: PayPal interviews heavily focus on algorithms. Practice LeetCode medium-hard problems.

  2. System Design Basics: Understand basic system design concepts - scalability, load balancing, caching, database sharding.

  3. Payment Domain Knowledge: Understand basic payment processing concepts, security (PCI DSS), and fraud detection basics.

  4. Java/Python Proficiency: Be strong in at least one language. Know collections, multithreading, and memory management.

  5. Database Skills: Understand SQL joins, indexing, transactions, and normalization.

HR Interview Tips:

  1. Know PayPal's Mission: "To democratize financial services" - understand and relate to this mission.

  2. Behavioral Preparation: Use STAR method (Situation, Task, Action, Result) for all behavioral questions.

❓ Frequently Asked Questions

Q1: What makes PayPal interviews challenging?

A: PayPal focuses heavily on problem-solving abilities and code quality. Expect follow-up questions that increase problem complexity.

Q2: Is system design asked for freshers?

A: Basic system design concepts may be asked. Focus on understanding scalability, database design, and API design principles.

Q3: What technologies does PayPal use?

A: Java, Node.js, Python, Spring Boot, React, Oracle, MongoDB, Kafka, and various cloud services.

Q4: How to prepare for PayPal coding rounds?

A: Practice LeetCode medium-hard problems, focus on optimal solutions, and be ready to explain time/space complexity trade-offs.

Q5: Does PayPal hire through campus placements?

A: Yes, PayPal recruits from top engineering colleges in India through campus placements and off-campus drives.

Best of luck with your PayPal placement preparation! 💳

Advertisement Placement

Share this article: