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

Meta Placement Papers 2024

Overview

This page collects Meta 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 Meta patterns and the latest shifts.

Meta Online Assessment 2024 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 2024 - actual questions & solutions

This section contains practice questions styled on Meta 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: 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 2: 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 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: 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 5: 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 6: 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 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: Which data structure uses FIFO order?

Solution:

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

Answer: Queue

Question 9

Q9: Virtual memory is typically implemented using?

Solution:

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

Answer: Demand paging

Question 10

Q10: Worst-case time complexity of quicksort is?

Solution:

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

Answer: O(n²)

Question 11

Q11: Which normal form removes transitive dependency?

Solution:

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

Answer: 3NF

Hiring volume

  • Total Hires: 800+ freshers in India
  • E3: 600+ selections
  • E4: 200+ selections

Salary packages

  • E3: ₹50-65 LPA total compensation
  • E4: ₹80-100 LPA total compensation

Key insights from 2024 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

Meta 2024 interview experiences

Based on candidate experiences from 2024 Meta interviews:

2024 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

Common 2024 Interview Topics:

  • Coding: Arrays, strings, trees, graphs, valid parentheses, merge k sorted lists
  • 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

2024 Interview Questions Examples:

  • “Design Facebook News Feed” (System Design)
  • “Clone Graph” (Coding)
  • “Valid Parentheses” (Coding)
  • “Merge K Sorted Lists” (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
  • 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

Difficulty Rating: 3.2/5

For detailed interview experiences, visit Meta Interview Experience page.

Preparation tips for Meta 2024 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-2024 to understand 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 to make decisions

Comments & Suggestions

2025 papers

Coding questions

Interview experience

Preparation guide

Meta hub

Similar companies

Google · Amazon · Microsoft · Apple · Netflix · TCS