Skip to content
Placement Papers - Free Placement Papers for Top CompaniesPlacement Papers - Free Placement Papers for Top CompaniesPlacement Papers

Phonepe Placement Papers 2024

Overview

This page collects PhonePe placement papers from 2024 with previous-year questions, solutions, and the 2024 exam pattern. It is useful when you want real drive history: what the OA looked like, which question types repeated, and how solutions were approached. Work through the papers below to build speed and accuracy, then compare against newer 2025 material so your prep matches both established PhonePe patterns and the latest shifts.

Phonepe Online Assessment 2024 pattern

Section Questions Time Difficulty Focus Areas
Coding Problems 2-3 90 min Medium-Hard Arrays, trees, graphs, DP

Total: 2-3 problems, 90 minutes

Platform: HackerRank or similar
Languages Allowed: Java, Python, C++, Go
Success Rate: ~15-20% cleared OA and advanced to interviews

Phonepe Placement Papers 2024 - actual questions & solutions

This section contains practice questions styled on PhonePe placement papers 2024 (previous-year pattern), with worked solutions. Use them as timed sectional drills - from student reports drives vary by college and role, so treat this as a high-signal practice bank, not an official paper dump.

Question 1: valid parentheses

Show solution

Problem Statement: Given a string of brackets, determine if it is valid.

Example:

Input: "()[]{}"
Output: true

Solution (Java):

public boolean isValid(String s) {
    Deque<Character> st = new ArrayDeque<>();
    Map<Character, Character> pair = Map.of(')', '(', ']', '[', '}', '{');
    for (char c : s.toCharArray()) {
        if (pair.containsValue(c)) st.push(c);
        else if (st.isEmpty() || st.pop() != pair.get(c)) return false;
    }
    return st.isEmpty();
}

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

Question 2: merge two sorted lists

Show solution

Problem Statement: Merge two sorted linked lists and return a new sorted list.

Example:

Input: 1→2→4 , 1→3→4
Output: 1→1→2→3→4→4

Solution (Java):

public ListNode mergeTwoLists(ListNode a, ListNode b) {
    ListNode dummy = new ListNode(0), cur = dummy;
    while (a != null && b != null) {
        if (a.val <= b.val) { cur.next = a; a = a.next; }
        else { cur.next = b; b = b.next; }
        cur = cur.next;
    }
    cur.next = (a != null) ? a : b;
    return dummy.next;
}

Time Complexity: O(n + m)
Space Complexity: O(1)

Question 3: detect cycle in linked list

Show solution

Problem Statement: Return true if the linked list has a cycle.

Example:

Input: 3→2→0→-4→(back to 2)
Output: true

Solution (Java):

public boolean hasCycle(ListNode head) {
    ListNode slow = head, fast = head;
    while (fast != null && fast.next != null) {
        slow = slow.next;
        fast = fast.next.next;
        if (slow == fast) return true;
    }
    return false;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 4: two sum

Show solution

Problem Statement: Given an array of integers and a target, return indices of two numbers that add up to target.

Example:

Input: nums = [2, 7, 11, 15], target = 9
Output: [0, 1]

Solution (Java):

public int[] twoSum(int[] nums, int target) {
    Map<Integer, Integer> map = new HashMap<>();
    for (int i = 0; i < nums.length; i++) {
        int need = target - nums[i];
        if (map.containsKey(need)) return new int[]{map.get(need), i};
        map.put(nums[i], i);
    }
    return new int[]{};
}

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

Question 5: rotate array right by k

Show solution

Problem Statement: Rotate the array to the right by k steps.

Example:

Input: [1,2,3,4,5,6,7], k = 3
Output: [5,6,7,1,2,3,4]

Solution (Java):

public void rotate(int[] nums, int k) {
    k %= nums.length;
    reverse(nums, 0, nums.length - 1);
    reverse(nums, 0, k - 1);
    reverse(nums, k, nums.length - 1);
}
void reverse(int[] a, int l, int r) {
    while (l < r) { int t = a[l]; a[l++] = a[r]; a[r--] = t; }
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 6: binary tree level order

Show solution

Problem Statement: Return the level-order traversal of a binary tree.

Example:

Input: [3,9,20,null,null,15,7]
Output: [[3],[9,20],[15,7]]

Solution (Java):

public List<List<Integer>> levelOrder(TreeNode root) {
    List<List<Integer>> res = new ArrayList<>();
    if (root == null) return res;
    Queue<TreeNode> q = new ArrayDeque<>();
    q.add(root);
    while (!q.isEmpty()) {
        int sz = q.size();
        List<Integer> level = new ArrayList<>();
        for (int i = 0; i < sz; i++) {
            TreeNode n = q.poll();
            level.add(n.val);
            if (n.left != null) q.add(n.left);
            if (n.right != null) q.add(n.right);
        }
        res.add(level);
    }
    return res;
}

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

Question 7: climbing stairs

Show solution

Problem Statement: You can climb 1 or 2 steps. How many distinct ways to climb n stairs?

Example:

Input: n = 4
Output: 5

Solution (Java):

public int climbStairs(int n) {
    if (n <= 2) return n;
    int a = 1, b = 2;
    for (int i = 3; i <= n; i++) {
        int c = a + b; a = b; b = c;
    }
    return b;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 8

Q8: Worst-case time complexity of quicksort is?

Solution:

Unbalanced partitions (already sorted with bad pivot) → O(n²).

Answer: O(n²)

Question 9

Q9: Which normal form removes transitive dependency?

Solution:

1NF: atomic values. 2NF: no partial dependency. 3NF: no transitive dependency.

Answer: 3NF

Question 10

Q10: Virtual memory is typically implemented using?

Solution:

OS uses demand paging (and sometimes segmentation) to implement virtual memory.

Answer: Demand paging

Question 11

Q11: Which protocol is connection-oriented at the transport layer?

Solution:

TCP is connection-oriented; UDP is connectionless.

Answer: TCP

Hiring volume

  • Total Hires: 200+ freshers in India
  • Software Engineer: 180+ selections

Salary packages

  • Software Engineer: ₹18-25 LPA total compensation

Key insights from 2024 Phonepe Online Assessment

  1. Coding Section is Critical: Must solve 2-3 coding problems correctly to advance
  2. DSA Focus: Strong emphasis on arrays, strings, trees, graphs, and dynamic programming
  3. Time Management: 2-3 problems in 90 minutes requires excellent speed and accuracy
  4. Payment System Focus: Problems often relate to payment systems, UPI, transactions, security
  5. System Design: Asked for SDE-1/2 roles, payment system design for fintech roles
  6. Success Rate: Only 15-20% cleared OA and advanced to interviews
  7. Platform: HackerRank or PhonePe’s internal platform
  8. Focus Areas: Arrays, trees, graphs, dynamic programming, payment systems, UPI

Phonepe 2024 interview experiences

Based on candidate experiences from 2024 PhonePe interviews:

2024 Interview Process:

  1. Online Assessment (90 minutes): 2-3 coding problems
  2. Technical Phone Screen (45-60 minutes): Coding problems, algorithm discussions, UPI/payment concepts
  3. Onsite Interviews (4-5 rounds, 45-60 minutes each):
  • Coding rounds (2-3): Algorithms, data structures, problem-solving
  • System Design rounds: UPI systems, payment processing, transaction systems, security
  • Behavioral rounds: Problem-solving approach, security mindset, impact

Common 2024 Interview Topics:

  • Coding: Arrays, strings, trees, graphs, dynamic programming, payment algorithms
  • System Design: UPI systems, payment processing, transaction systems, security, fintech architecture
  • Behavioral: Problem-solving, security mindset, teamwork, impact
  • PhonePe Technologies: UPI, payment systems, transaction processing, security, fintech platforms

2024 Interview Questions Examples:

  • Longest Palindromic Substring
  • Design PhonePe’s UPI system (System Design)
  • Design PhonePe’s payment processing system (System Design)
  • Security-related coding problems

Success Tips:

  • Strong coding performance is essential - solve problems optimally
  • Understand UPI and payment processing concepts
  • Practice system design for UPI systems and payment processing
  • Prepare examples demonstrating problem-solving and security mindset
  • Learn PhonePe’s products and UPI technologies
  • Practice explaining your thought process clearly

For detailed interview experiences, visit PhonePe Interview Experience page.

Preparation tips for Phonepe 2024 pattern

  1. Master Coding Fundamentals: Focus on solving 2-3 coding problems correctly - arrays, trees, graphs, DP
  2. UPI/Payment Knowledge: Strong understanding of UPI, payment processing, transaction systems, security
  3. Practice Previous Year Papers: Solve PhonePe OA papers from 2020-2024 to understand patterns
  4. Time Management: Practice completing 2-3 coding problems in 90 minutes
  5. LeetCode Practice: Solve 200+ LeetCode problems focusing on arrays, strings, trees, graphs (medium-hard difficulty)
  6. Fintech Focus: Practice problems related to payment systems, UPI, and transactions
  7. System Design Mastery: Learn UPI system design, payment processing, transaction systems, security
  8. Security Knowledge: Understand security best practices for payment systems and UPI
  9. Behavioral Preparation: Prepare examples using STAR format - problem-solving, security mindset, impact
  10. Mock Tests: Take timed practice tests to improve speed and accuracy

Comments & Suggestions

2025 papers

Coding questions

Interview experience

Preparation guide

PhonePe hub

Similar companies

Paytm · Razorpay · Flipkart · Zomato · Swiggy · Google