Paytm Placement Papers 2026 - Complete Preparation Guide

Last Updated: March 2026

📋 Company Overview

Paytm (Pay Through Mobile) is India's largest digital payments and financial services company, founded in 2010 by Vijay Shekhar Sharma under One97 Communications. Headquartered in Noida, Uttar Pradesh, Paytm has transformed India's fintech landscape with its mobile-first approach to payments, banking, and financial services.

With over 300 million users and 20+ million merchant partners, Paytm operates India's largest payments platform. The company went public in November 2021 in India's largest-ever IPO. Paytm's ecosystem spans payments, banking, lending, insurance, and wealth management services.

🎯 Eligibility Criteria for Freshers 2026

Parameter	Requirements
Academic Qualification	B.Tech/B.E (CS/IT/ECE), MCA, M.Tech
Batch Eligible	2025, 2026 graduating batches
Minimum CGPA	7.0/10 or 70% throughout academics
Backlogs	No active backlogs at time of joining
Skills Preferred	Java, Spring Boot, Microservices, SQL, React/Angular
Experience	Freshers (0-1 years)

💰 CTC Package for Freshers 2026

Component	Amount (INR)
Base Salary	₹10,00,000 - ₹16,00,000
Joining Bonus	₹1,00,000 - ₹2,00,000
Performance Bonus	Up to 15% of CTC
ESOPs	Variable (vesting over 4 years)
Benefits	Health insurance, meal allowances, wellness programs
Total CTC	₹12,00,000 - ₹20,00,000

📊 Exam Pattern 2026

Paytm's recruitment process consists of multiple rounds designed to assess technical skills and cultural fit:

Stage 1: Online Assessment (OA)

Section	Duration	Questions	Topics
Quantitative Aptitude	25 mins	15	Arithmetic, Algebra, Data Interpretation
Logical Reasoning	20 mins	10	Puzzles, Series, Coding-Decoding
Technical MCQ	30 mins	20	DSA, OOPS, DBMS, Java/Python, CN
Coding Problems	60 mins	2-3	Algorithms, Data Structures
English Communication	15 mins	10	Grammar, Comprehension, Vocabulary

Stage 2-5: Interview Rounds

Round	Type	Duration	Focus Area
Round 2	Technical Interview I	45-60 mins	Problem Solving, DSA, Coding
Round 3	Technical Interview II	45-60 mins	System Design, Projects
Round 4	Managerial Round	30-45 mins	Architecture, Domain Knowledge
Round 5	HR Interview	20-30 mins	Culture Fit, Compensation

Marking Scheme:

MCQs: +4 for correct, -1 for incorrect
Coding: Evaluated on correctness, efficiency, and code quality

🧮 Aptitude Questions with Solutions (15 Questions)

Question 1

Problem: Paytm processes 2.4 million transactions in 8 hours during peak time. How many transactions per minute is this?

Solution: Total minutes = 8 × 60 = 480 minutes Transactions per minute = 2,400,000 / 480 = 5,000 transactions/minute

Question 2

Problem: A wallet has ₹800 in denominations of ₹50, ₹100, and ₹200. The number of ₹200 notes is twice the number of ₹100 notes, and the number of ₹50 notes is 4. How many ₹100 notes are there?

Solution: Let ₹100 notes = x Then ₹200 notes = 2x ₹50 notes = 4 (given)

Total: 50(4) + 100(x) + 200(2x) = 800 200 + 100x + 400x = 800 500x = 600 x = 1.2 → Since x must be integer, let's verify: x=1 gives 200+100+400=700. With x=2: 200+200+800=1200. Problem might have adjusted numbers. Answer assuming closest: 1 or 2 notes.

Question 3

Problem: In a coding competition, 45% participants solved problem A, 35% solved problem B, and 20% solved both. What percentage solved at least one problem?

Solution: Using inclusion-exclusion: P(A∪B) = P(A) + P(B) - P(A∩B) = 45% + 35% - 20% = 60%

Question 4

Problem: Find the wrong number in the series: 2, 6, 12, 20, 30, 42, 56, 73

Solution: Pattern: n(n+1) 1×2=2, 2×3=6, 3×4=12, 4×5=20, 5×6=30, 6×7=42, 7×8=56, 8×9=72 73 should be 72

Question 5

Problem: A UPI payment fails 3 times out of 20 attempts. What is the probability of success in the next attempt?

Solution: Assuming independent events: Success probability = (20-3)/20 = 17/20 = 0.85 or 85%

Question 6

Problem: If 15 programmers can complete a project in 24 days, how many programmers are needed to complete it in 18 days?

Solution: Using work equivalence: M1×D1 = M2×D2 15 × 24 = M2 × 18 M2 = (15 × 24) / 18 = 360/18 = 20 programmers

Question 7

Problem: A merchant sells two mobile wallets each for ₹1,200. On one he gains 20% and on the other he loses 20%. What is his overall gain or loss percentage?

Solution: When SP is same and gain% = loss%, there is always a loss. Loss% = (x²/100)% = (20²/100) = 4% loss

Verification: CP1 = 1200/1.2 = 1000 CP2 = 1200/0.8 = 1500 Total CP = 2500, Total SP = 2400 Loss = 100, Loss% = 100/2500 × 100 = 4%

Question 8

Problem: The average of 5 consecutive even numbers is 32. Find the largest number.

Solution: Let numbers be: x, x+2, x+4, x+6, x+8 Average = (5x + 20)/5 = x + 4 = 32 x = 28 Largest = x + 8 = 36

Shortcut: Average of consecutive even numbers = middle number So numbers: 28, 30, 32, 34, 36. Largest = 36.

Question 9

Problem: A train 180m long crosses a platform 220m long in 40 seconds. Find the speed of the train in km/hr.

Solution: Total distance = 180 + 220 = 400m Time = 40 seconds Speed = 400/40 = 10 m/s = 10 × (18/5) = 36 km/hr

Question 10

Problem: If LOGIC is coded as 12157139, how is PAYTM coded?

Solution: Pattern: L(12), O(15), G(7), I(9), C(3) → Square each: 144, 225, 49, 81, 9 Or: L(12), O(15), G(7)... Numbers shown: 12, 15, 7, 13, 9? Actually: L=12, O=15, G=7, I=9, C=3 → 1215793? Given: 12157139 → 12, 15, 7, 13, 9? I=9, C=3 → 93? Pattern seems: Position in alphabet as digits concatenated. P=16, A=1, Y=25, T=20, M=13 → 161252013

Question 11

Problem: A sum of ₹10,000 amounts to ₹12,100 in 2 years at compound interest. What is the rate of interest?

Solution: 12100 = 10000(1 + r/100)² 1.21 = (1 + r/100)² 1.1 = 1 + r/100 r = 10%

Question 12

Problem: In a row of 60 students, Rahul is 25th from the left end and Priya is 20th from the right end. How many students are between them?

Solution: Priya from left = 60 - 20 + 1 = 41st Students between = 41 - 25 - 1 = 15 students

Question 13

Problem: A can complete work in 12 days, B in 18 days. They work together for 4 days, then A leaves. How long will B take to complete the remaining work?

Solution: A's 1 day work = 1/12, B's 1 day work = 1/18 Combined 1 day = 1/12 + 1/18 = 5/36 Work in 4 days = 4 × 5/36 = 5/9 Remaining = 4/9 B's time = (4/9) / (1/18) = (4/9) × 18 = 8 days

Question 14

Problem: If x + 1/x = 5, find x² + 1/x².

Solution: Squaring both sides: (x + 1/x)² = 25 x² + 2 + 1/x² = 25 x² + 1/x² = 23

Question 15

Problem: Find the unit digit of 3^47 + 4^32.

Solution: Unit digit cycle of 3: 3, 9, 7, 1 (cycle of 4) 47 mod 4 = 3, so 3^47 ends in 7

Unit digit cycle of 4: 4, 6 (cycle of 2) 32 mod 2 = 0, so 4^32 ends in 6

Unit digit of sum: 7 + 6 = 13 → 3

💻 Technical/CS Questions with Solutions (10 Questions)

Question 1

Q: Explain the concept of Microservices architecture.

Key Characteristics:

Single Responsibility: Each service handles one business capability
Independently Deployable: Services can be deployed separately
Decentralized: Teams can choose their own tech stack
Resilient: Failure in one service doesn't cascade

Advantages:

Scalability: Scale individual services as needed
Technology Diversity: Use best tool for each job
Fault Isolation: Limited blast radius
Team Autonomy: Independent development

Challenges:

Distributed system complexity
Network latency
Data consistency across services
Operational overhead

Question 2

Q: What is the difference between REST and GraphQL?

Aspect	REST	GraphQL
Data Fetching	Multiple endpoints, fixed data structure	Single endpoint, client-specified queries
Over-fetching	Common problem	Eliminated
Under-fetching	May need multiple requests	Single request sufficient
Versioning	URL-based (/v1/, /v2/)	Schema evolution without versioning
Caching	HTTP caching built-in	Requires custom caching
Complexity	Simpler	Steeper learning curve

Paytm Context: For a payments app with complex data relationships, GraphQL could reduce API calls but REST is simpler for transactional operations.

Question 3

Q: Explain database sharding and when to use it.

Types:

Range Sharding: Data split by key ranges (e.g., UserID 1-1000000 in Shard 1)
Hash Sharding: Hash of key determines shard
Directory Sharding: Lookup service maps keys to shards

When to Use:

Data exceeds single server capacity
Need to distribute write load
Query performance degrades with data growth
Geographical distribution requirements

Paytm Use Case: Transaction data can be sharded by user_id or time range to handle billions of transactions.

Question 4

Q: What is JWT (JSON Web Token) and how does it work?

Structure:

xxxxx.yyyyy.zzzzz
(header.payload.signature)

Header: Algorithm and token type
Payload: Claims (user data, expiration, etc.)
Signature: Ensures integrity (HMAC or RSA)

Workflow:

User authenticates, server issues JWT
Client stores JWT (localStorage/cookie)
Client sends JWT in Authorization header
Server verifies signature and extracts claims
Access granted based on claims

Pros: Stateless, portable, widely supported Cons: Token size, cannot revoke immediately (need blacklist)

Question 5

Q: Explain the CAP theorem and its relevance to payment systems.

Consistency: All nodes see same data simultaneously
Availability: Every request gets a response
Partition Tolerance: System works despite network failures

Payment System Trade-offs:

During normal operation: Prioritize C and A (CA system)
During network partition: Must choose CP or AP
Payment systems typically choose CP: Consistency is critical for financial transactions

Paytm Approach: Use distributed transactions (2PC, Saga pattern) to maintain consistency across services.

Question 6

Q: What are design patterns? Name some commonly used patterns.

Creational Patterns:

Singleton: Single instance of a class (Database connection)
Factory: Create objects without specifying exact class
Builder: Construct complex objects step by step

Structural Patterns:

Adapter: Interface compatibility between classes
Decorator: Add behavior dynamically
Proxy: Control access to objects

Behavioral Patterns:

Observer: Subscribe/notify mechanism
Strategy: Family of interchangeable algorithms
Command: Encapsulate requests as objects

Question 7

Q: Explain the difference between SQL and NoSQL databases.

Feature	SQL (Relational)	NoSQL (Non-relational)
Schema	Fixed schema	Flexible/dynamic schema
Scaling	Vertical	Horizontal
ACID	Full ACID support	Varies (eventual consistency)
Data Model	Tables with rows/columns	Document, key-value, column, graph
Joins	Supported	Limited/no joins
Use Case	Complex queries, transactions	High volume, unstructured data

Paytm Stack: MySQL/PostgreSQL for transactional data, MongoDB/Cassandra for logs and analytics, Redis for caching.

Question 8

Q: What is garbage collection in Java?

How it works:

Mark: Identify reachable objects from GC roots
Sweep: Remove unreachable objects
Compact: Defragment memory (optional)

GC Algorithms:

Serial GC: Single thread, simple
Parallel GC: Multiple threads for young generation
CMS (Concurrent Mark Sweep): Low pause times
G1 GC: Region-based, predictable pauses
ZGC/Shenandoah: Ultra-low latency (sub-10ms)

Tuning: Set heap size (-Xms, -Xmx), choose collector based on latency/throughput needs.

Question 9

Q: Explain the concept of Load Balancing.

Types:

Hardware Load Balancers: Physical devices (F5, Citrix)
Software Load Balancers: Nginx, HAProxy, AWS ALB

Algorithms:

Round Robin: Distribute sequentially
Least Connections: To server with fewest active connections
IP Hash: Same client always to same server
Weighted: Based on server capacity

Health Checks: Continuously monitor server health and remove failed instances.

Paytm Scale: Uses multi-tier load balancing - DNS → CDN → L4 → L7 → Application servers.

Question 10

Q: What is the difference between Authentication and Authorization?

Authentication	Authorization
Verifies identity	Determines access rights
"Who are you?"	"What can you do?"
Username/password, biometrics, OTP	Roles, permissions, policies
First step	Second step
Implements identity proof	Implements access control

Implementation:

Authentication: OAuth 2.0, SAML, LDAP, MFA
Authorization: RBAC (Role-Based), ABAC (Attribute-Based), ACLs

Paytm Example: Login with phone + OTP (AuthN), then check if user can access wallet features (AuthZ).

📝 Verbal/English Questions with Solutions (10 Questions)

Question 1

Spot the error: Neither the developers nor the manager are aware of the deployment issue.

Question 2

Fill in the blank: The payment gateway _______ designed to handle millions of transactions daily.

Options: (a) is (b) are (c) were (d) being

Question 3

Synonym: PRAGMATIC

Options: (a) Idealistic (b) Practical (c) Theoretical (d) Visionary

Question 4

Antonym: TRANSPARENT

Options: (a) Clear (b) Opaque (c) Visible (d) Honest

Question 5

Rearrange: (A) Digital payments / (B) have transformed / (C) the way Indians / (D) transact money

Question 6

Idiom: "To be on the same page"

Meaning: (a) Reading together (b) To have the same understanding (c) To be in a book (d) To agree on everything

Question 7

One word substitution: A person who starts a business

Options: (a) Employee (b) Entrepreneur (c) Manager (d) Investor

Question 8

Reading Comprehension: Paytm's Super App strategy consolidates multiple services into a single platform, offering users a seamless experience for payments, shopping, ticketing, and financial services without switching between multiple apps.

What is the main advantage of the Super App approach?

Question 9

Sentence Correction: The data show that mobile payments have increased significantly.

Question 10

Analogies: Wallet : Money :: Database : ?

Options: (a) Computer (b) Data (c) Storage (d) Server

👨‍💻 Coding Questions with Python Solutions (5 Questions)

Question 1: Climbing Stairs

Problem: You are climbing a staircase with n steps. Each time you can climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Solution:

def climb_stairs(n):
    """
    Time Complexity: O(n)
    Space Complexity: O(1)
    """
    if n <= 2:
        return n
    
    prev2, prev1 = 1, 2
    
    for i in range(3, n + 1):
        current = prev1 + prev2
        prev2 = prev1
        prev1 = current
    
    return prev1

# Test
print(climb_stairs(2))   # 2
print(climb_stairs(3))   # 3
print(climb_stairs(4))   # 5
print(climb_stairs(5))   # 8

Question 2: Maximum Subarray (Kadane's Algorithm)

Problem: Find the contiguous subarray with the largest sum.

Solution:

def max_subarray(nums):
    """
    Kadane's Algorithm
    Time Complexity: O(n)
    Space Complexity: O(1)
    """
    max_current = max_global = nums[0]
    
    for i in range(1, len(nums)):
        max_current = max(nums[i], max_current + nums[i])
        max_global = max(max_global, max_current)
    
    return max_global

def max_subarray_with_indices(nums):
    """Returns max sum and the subarray"""
    max_current = max_global = nums[0]
    start = end = temp_start = 0
    
    for i in range(1, len(nums)):
        if max_current + nums[i] < nums[i]:
            max_current = nums[i]
            temp_start = i
        else:
            max_current += nums[i]
        
        if max_current > max_global:
            max_global = max_current
            start = temp_start
            end = i
    
    return max_global, nums[start:end+1]

# Test
nums = [-2, 1, -3, 4, -1, 2, 1, -5, 4]
print(max_subarray(nums))              # 6
print(max_subarray_with_indices(nums)) # (6, [4, -1, 2, 1])

Question 3: Find Duplicate Number

Problem: Given an array containing n+1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Find the duplicate.

Solution:

def find_duplicate(nums):
    """
    Floyd's Cycle Detection (Tortoise and Hare)
    Time Complexity: O(n)
    Space Complexity: O(1)
    """
    # Phase 1: Find intersection point
    slow = nums[0]
    fast = nums[0]
    
    while True:
        slow = nums[slow]
        fast = nums[nums[fast]]
        if slow == fast:
            break
    
    # Phase 2: Find entrance to cycle (duplicate)
    slow = nums[0]
    while slow != fast:
        slow = nums[slow]
        fast = nums[fast]
    
    return slow

# Alternative: Using set (O(n) space)
def find_duplicate_set(nums):
    seen = set()
    for num in nums:
        if num in seen:
            return num
        seen.add(num)

# Test
print(find_duplicate([1, 3, 4, 2, 2]))      # 2
print(find_duplicate([3, 1, 3, 4, 2]))      # 3

Question 4: LRU Cache

Problem: Design a data structure that follows the constraints of a Least Recently Used (LRU) cache.

Solution:

from collections import OrderedDict

class LRUCache:
    """
    Time Complexity: O(1) for get and put
    Space Complexity: O(capacity)
    """
    def __init__(self, capacity: int):
        self.cache = OrderedDict()
        self.capacity = capacity
    
    def get(self, key: int) -> int:
        if key not in self.cache:
            return -1
        # Move to end (most recent)
        self.cache.move_to_end(key)
        return self.cache[key]
    
    def put(self, key: int, value: int) -> None:
        if key in self.cache:
            self.cache.move_to_end(key)
        self.cache[key] = value
        if len(self.cache) > self.capacity:
            # Remove least recently used (first item)
            self.cache.popitem(last=False)

# Test
lru = LRUCache(2)
lru.put(1, 1)
lru.put(2, 2)
print(lru.get(1))    # 1
lru.put(3, 3)        # evicts key 2
print(lru.get(2))    # -1
lru.put(4, 4)        # evicts key 1
print(lru.get(1))    # -1
print(lru.get(3))    # 3
print(lru.get(4))    # 4

Question 5: Word Break

Problem: Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words.

Solution:

def word_break(s: str, word_dict: list) -> bool:
    """
    Dynamic Programming
    Time Complexity: O(n² × m) where n = len(s), m = avg word length
    Space Complexity: O(n)
    """
    word_set = set(word_dict)
    n = len(s)
    
    # dp[i] = True if s[0:i] can be segmented
    dp = [False] * (n + 1)
    dp[0] = True  # Empty string
    
    for i in range(1, n + 1):
        for j in range(i):
            if dp[j] and s[j:i] in word_set:
                dp[i] = True
                break
    
    return dp[n]

def word_break_with_paths(s: str, word_dict: list):
    """Also return all possible segmentations"""
    word_set = set(word_dict)
    n = len(s)
    dp = [[] for _ in range(n + 1)]
    dp[0] = [[]]  # Empty string has one empty segmentation
    
    for i in range(1, n + 1):
        for j in range(i):
            word = s[j:i]
            if dp[j] and word in word_set:
                for seg in dp[j]:
                    dp[i].append(seg + [word])
    
    return dp[n]

# Test
print(word_break("leetcode", ["leet", "code"]))              # True
print(word_break("applepenapple", ["apple", "pen"]))         # True
print(word_break("catsandog", ["cats", "dog", "sand", "and", "cat"]))  # False

print(word_break_with_paths("catsanddog", ["cat", "cats", "and", "sand", "dog"]))
# [['cat', 'sand', 'dog'], ['cats', 'and', 'dog']]

🎯 Interview Tips for Paytm

Understand Fintech: Demonstrate knowledge of digital payments, UPI, wallets, and financial regulations in India. Know about NPCI, RBI guidelines, and payment industry trends.
Scale Considerations: Paytm handles millions of transactions daily. Always discuss how your solutions scale and handle high concurrency.
Security Awareness: Payments require high security. Be prepared to discuss encryption, tokenization, fraud detection, and secure coding practices.
Java/Spring Expertise: Paytm's backend is heavily Java-based. Strong OOP concepts and Spring framework knowledge are valuable.
System Design Focus: Be ready to design payment systems, transaction processing, notification systems, and distributed architectures.
Product Thinking: Paytm values engineers who understand the business impact. Connect technical solutions to user experience and business outcomes.
Databases & Caching: Deep understanding of database design, indexing, query optimization, and caching strategies (Redis) is crucial.

❓ Frequently Asked Questions (FAQs)

Q1: What is the interview process at Paytm for freshers?

A: The process includes: Online Assessment (aptitude + coding) → Technical Interview I → Technical Interview II → Managerial Round → HR Discussion. Total duration is typically 2-3 weeks.

Q2: Which programming language should I use for Paytm interviews?

A: Java is preferred given Paytm's tech stack, but Python and C++ are also accepted. Choose the language you're most comfortable with for problem-solving.

Q3: Does Paytm hire through off-campus drives?

A: Yes, Paytm conducts off-campus hiring through their career portal, coding competitions, and hiring challenges on platforms like HackerEarth and CodeChef.

Q4: What is the work culture at Paytm?

A: Paytm has a fast-paced, high-ownership culture. Teams are empowered to make decisions, and there's significant emphasis on delivering results quickly.

Q5: What are the growth opportunities at Paytm?

A: Paytm offers clear career progression paths from Software Engineer → Senior Engineer → Staff Engineer → Principal Engineer. High performers can grow rapidly given the company's expansion.

All the best for your Paytm placement preparation! 🚀

Paytm Placement Papers 2026 | Freshers Exam Pattern, Syllabus & Questions

Paytm Placement Papers 2026 - Complete Preparation Guide

📋 Company Overview

🎯 Eligibility Criteria for Freshers 2026

💰 CTC Package for Freshers 2026

📊 Exam Pattern 2026

Stage 1: Online Assessment (OA)

Stage 2-5: Interview Rounds

🧮 Aptitude Questions with Solutions (15 Questions)

Question 1

Question 2

Question 3

Question 4

Question 5

Question 6

Question 7

Question 8

Question 9

Question 10

Question 11

Question 12

Question 13

Question 14

Question 15

💻 Technical/CS Questions with Solutions (10 Questions)

Question 1

Question 2

Question 3

Question 4

Question 5

Question 6

Question 7

Question 8

Question 9

Question 10

📝 Verbal/English Questions with Solutions (10 Questions)

Question 1

Question 2

Question 3

Question 4

Question 5

Question 6

Question 7

Question 8

Question 9

Question 10

👨‍💻 Coding Questions with Python Solutions (5 Questions)

Question 1: Climbing Stairs

Question 2: Maximum Subarray (Kadane's Algorithm)

Question 3: Find Duplicate Number

Question 4: LRU Cache

Question 5: Word Break

🎯 Interview Tips for Paytm

❓ Frequently Asked Questions (FAQs)

Q1: What is the interview process at Paytm for freshers?

Q2: Which programming language should I use for Paytm interviews?

Q3: Does Paytm hire through off-campus drives?

Q4: What is the work culture at Paytm?

Q5: What are the growth opportunities at Paytm?

Share this article: