Meta Placement Papers 2025

Overview

This page is a working set of Meta placement papers from 2025: from student reports questions, the 2025 online assessment pattern, and step-by-step solutions. Use it to see what Meta actually asked in the latest cycle, how hard the rounds were, and which themes (DSA, system design, aptitude, or role-specific topics) mattered most. Practice the problems below under timed conditions, then cross-check with the interview and preparation guides if you are targeting an upcoming Meta drive.

2025 Updates

The 2025 Meta OA maintains focus on DSA and system/product design with enhanced emphasis on optimal solutions.

Meta Online Assessment 2025 pattern

Section	Questions	Time	Difficulty	Focus Areas
Coding Problems	3-4	60-90 min	Medium-Hard	Arrays, strings, trees, graphs

Total: 3-4 problems, 60-90 minutes
Platform: Meta assessment platform
Languages Allowed: Python, C++, Java
Success Rate: ~15-20% cleared OA and advanced to interviews

Meta Placement Papers 2025 - actual questions & solutions

This section contains practice questions styled on Meta placement papers 2025 (recent-cycle 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: reverse a string

Show solution

Problem Statement: Given a string, return it reversed.

Example:

Input: "placement"
Output: "tnemecalp"

Solution (Java):

public String reverse(String s) {
    return new StringBuilder(s).reverse().toString();
}

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

Question 2: maximum subarray sum

Show solution

Problem Statement: Find the contiguous subarray with the largest sum.

Example:

Input: [-2, 1, -3, 4, -1, 2, 1, -5, 4]
Output: 6  // [4, -1, 2, 1]

Solution (Java):

public int maxSubArray(int[] nums) {
    int best = nums[0], cur = nums[0];
    for (int i = 1; i < nums.length; i++) {
        cur = Math.max(nums[i], cur + nums[i]);
        best = Math.max(best, cur);
    }
    return best;
}

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

Question 3: 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 4: 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 5: 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 6: longest common prefix

Show solution

Problem Statement: Find the longest common prefix string amongst an array of strings.

Example:

Input: ["flower","flow","flight"]
Output: "fl"

Solution (Java):

public String longestCommonPrefix(String[] strs) {
    if (strs.length == 0) return "";
    String pref = strs[0];
    for (int i = 1; i < strs.length; i++) {
        while (!strs[i].startsWith(pref)) {
            pref = pref.substring(0, pref.length() - 1);
            if (pref.isEmpty()) return "";
        }
    }
    return pref;
}

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

Question 7: check palindrome

Show solution

Problem Statement: Return true if the string reads the same forward and backward (ignore case).

Example:

Input: "Level"
Output: true

Solution (Java):

public boolean isPalindrome(String s) {
    s = s.toLowerCase();
    int i = 0, j = s.length() - 1;
    while (i < j) {
        if (s.charAt(i++) != s.charAt(j--)) return false;
    }
    return true;
}

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

Question 8

Q8: Virtual memory is typically implemented using?

Solution:

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

Answer: Demand paging

Question 9

Q9: Worst-case time complexity of quicksort is?

Solution:

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

Answer: O(n²)

Question 10

Q10: Time complexity of binary search on a sorted array of n elements is?

Solution:

Each step halves the search space → O(log n).

Answer: O(log n)

Question 11

Q11: Which data structure uses FIFO order?

Solution:

FIFO = First In First Out → Queue. Stack is LIFO.

Answer: Queue

Key insights from 2025 Meta Online Assessment

1. Coding Section is Critical: Must solve 3-4 coding problems correctly to advance
2. DSA Focus: Strong emphasis on arrays, strings, trees, and graphs
3. System Design: Heavy emphasis on system design for senior roles (E4+)
4. Move Fast Culture: Behavioral questions focus on “Move Fast and Break Things” mindset
5. Time Management: 60-90 minutes for 3-4 problems requires excellent speed
6. Difficulty Level: Meta interviews rated 3.2/5 difficulty
7. Success Rate: Only 15-20% cleared OA and advanced to interviews
8. Social Media Scale: Focus on problems related to social media scale and real-time systems
9. Data-Driven Decisions: Increased emphasis on data-driven decision making

Meta 2025 interview experiences

Based on recent candidate experiences from 2025 Meta interviews:

2025 Interview Process:

1. Online Assessment (60-90 minutes): 3-4 coding problems
2. Technical Phone Screen (45-60 minutes): Coding problems, algorithm discussions
3. Onsite Interviews (4-5 rounds, 45 minutes each):

• Coding rounds (2-3): Algorithms, data structures, problem-solving
• System Design round: Critical for senior roles (E4+) - social media scale
• Behavioral round: “Move Fast and Break Things” culture fit, data-driven decisions

2025 Interview Trends:

• Increased emphasis on data-driven decision making and metrics
• More focus on system design for social media scale
• Enhanced behavioral questions about fast iteration and learning from failures
• Questions about using data to persuade leadership

Common 2025 Interview Topics:

• Coding: Arrays, strings, trees, graphs, valid parentheses, merge k sorted lists, longest substring
• System Design: Facebook News Feed, social media systems, real-time systems, scalability
• Behavioral: Data-driven decision making, fast iteration, breaking things to learn
• Social Media Scale: Problems related to handling millions of users, real-time updates

2025 Interview Questions Examples:

• “Design Facebook News Feed” (System Design)
• “Clone Graph” (Coding)
• “Longest Substring Without Repeating Characters” (Coding)
• “Tell me about a time you used data to persuade leadership to change a decision” (Behavioral)

Success Tips:

• Strong coding performance is essential - solve problems optimally
• Practice system design for social media scale - critical for E4+ roles
• Prepare examples demonstrating data-driven decision making with metrics
• Show “Move Fast” mindset - rapid iteration and learning from failures
• Practice social media scale problems - millions of users, real-time systems
• Be ready to discuss breaking things to learn and improve
• Prepare examples showing how you used data to influence decisions

Difficulty Rating: 3.2/5

For detailed interview experiences from 2025, visit Meta Interview Experience page.

Preparation tips for Meta 2025 pattern

1. Master Coding Fundamentals: Focus on solving 3-4 coding problems correctly - arrays, strings, trees, graphs
2. Practice Previous Year Papers: Solve Meta OA papers from 2020-2025 to understand evolving patterns
3. Time Management: Practice completing 3-4 coding problems in 60-90 minutes
4. System Design Mastery: Heavy focus on system design for senior roles - social media scale
5. LeetCode Practice: Solve 200+ LeetCode problems focusing on Meta tag (medium-hard difficulty)
6. Social Media Systems: Practice designing systems for Facebook scale - News Feed, messaging, etc.
7. Behavioral Prep: Prepare examples demonstrating “Move Fast” culture and data-driven decisions
8. Mock Tests: Take timed practice tests to improve speed and accuracy
9. Real-time Systems: Learn about real-time systems and handling millions of concurrent users
10. Data-Driven Examples: Prepare examples showing how you used data and metrics to make decisions

Comments & Suggestions

Related resources

2024 papers→

Coding questions→

Interview experience→

Preparation guide→

Meta hub→

Similar companies

Google · Amazon · Microsoft · Apple · Netflix · TCS