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

Byju's Placement Papers 2024

Overview

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

BYJU’S Online Assessment 2024 pattern

Section Questions Time Difficulty
Coding Problems 2-3 90 min Medium-Hard

BYJU’S Placement Papers 2024 - actual questions & solutions

This section contains practice questions styled on BYJU’S 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: 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 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: 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 4: 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 5: 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 6: 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 7: 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 8

Q8: Which normal form removes transitive dependency?

Solution:

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

Answer: 3NF

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 SQL clause filters grouped rows after GROUP BY?

Solution:

HAVING filters aggregates; WHERE filters rows before grouping.

Answer: HAVING

Key insights from 2024 BYJU’S Online Assessment

  1. Coding Section is Critical: Must solve 2-3 coding problems correctly to advance
  2. Ed-Tech Focus: Strong emphasis on ed-tech platform design, student progress tracking, learning systems
  3. Time Management: 2-3 problems in 90 minutes requires excellent speed and accuracy
  4. Success Rate: Only 10-15% cleared OA and advanced to interviews
  5. Platform: BYJU’S assessment platform or HackerRank
  6. Focus Areas: Arrays, trees, graphs, dynamic programming, ed-tech systems, student progress tracking

BYJU’S 2024 interview experiences

Based on candidate experiences from 2024 BYJU’S interviews:

2024 Interview Process:

  1. Online Assessment (90 minutes): 2-3 coding problems
  2. Technical Phone Screen (45-60 minutes): Coding problems, algorithm discussions, ed-tech concepts
  3. Onsite Interviews (4-5 rounds, 45-60 minutes each):
  • Coding rounds (2-3): Algorithms, data structures, problem-solving
  • System Design rounds: Ed-tech platforms, student progress tracking, learning systems, content delivery
  • Behavioral rounds: Problem-solving approach, education passion, impact

Common 2024 Interview Topics:

  • Coding: Arrays, strings, trees, graphs, dynamic programming, student progress algorithms
  • System Design: Ed-tech platforms, student progress tracking, learning systems, content delivery
  • Behavioral: Problem-solving, education passion, teamwork, impact
  • BYJU’S Technologies: Ed-tech platforms, student progress tracking, learning systems, content delivery

2024 Interview Questions Examples:

  • Student Progress Tracking
  • Design BYJU’S learning platform (System Design)
  • Design BYJU’S student progress tracking system (System Design)
  • Ed-tech and learning algorithms

Success Tips:

  • Strong coding performance is essential - solve problems optimally
  • Understand ed-tech concepts and learning systems
  • Practice system design for ed-tech platforms and student progress tracking
  • Prepare examples demonstrating problem-solving and education passion
  • Learn BYJU’S products and ed-tech technologies
  • Practice explaining your thought process clearly

For detailed interview experiences, visit BYJU’S Interview Experience page.

Preparation tips for BYJU’S 2024 pattern

  1. Master Coding Fundamentals: Focus on solving 2-3 coding problems correctly - arrays, trees, graphs, DP
  2. Ed-Tech Knowledge: Strong understanding of ed-tech systems, student progress tracking, learning platforms
  3. Practice Previous Year Papers: Solve BYJU’S 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. Ed-Tech Focus: Practice problems related to ed-tech systems and student progress tracking
  7. System Design Mastery: Learn ed-tech platform design, student progress tracking, learning systems
  8. BYJU’S Technologies: Learn ed-tech platforms, student progress tracking, learning systems, content delivery
  9. Behavioral Preparation: Prepare examples using STAR format - problem-solving, education passion, impact
  10. Mock Tests: Take timed practice tests to improve speed and accuracy

Comments & Suggestions

2025 papers

Coding questions

Interview experience

Preparation guide

BYJU'S hub

Similar companies

Unacademy · Amazon · Flipkart · Google · Microsoft · TCS