Atlassian Placement Papers 2024

Overview

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

2024 Atlassian Pattern

The 2024 Atlassian placement process focused on technical skills and problem-solving. Understanding the 2024 pattern helps you prepare better for upcoming placements.

Download 2024 Placement Papers

Atlassian 2024 paper 1→

Complete Atlassian placement paper with coding questions and solutions

Atlassian 2024 paper 2→

Additional 2024 Atlassian paper with detailed solutions

Atlassian 2024 paper 3→

Another 2024 Atlassian paper with comprehensive solutions

Atlassian exam pattern 2024

Section	Questions	Time	Difficulty	Focus Areas
Coding/Programming	2-3	60-90 min	Medium-Hard	DSA, algorithms, problem-solving
Technical MCQs	15-20	30-40 min	Medium	CS fundamentals, OOP, DBMS
Aptitude	10-15	20-30 min	Easy-Medium	Quantitative, logical reasoning

Total: 30-50 questions, 90-120 minutes

Key Changes in 2024:

• Updated question patterns
• Increased focus on practical skills
• New evaluation criteria

Atlassian Placement Papers 2024 - actual questions & solutions

This section contains practice questions styled on Atlassian 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: 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: 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 3: 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 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: 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 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: 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 8

Q8: Which data structure uses FIFO order?

Solution:

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

Answer: Queue

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: Worst-case time complexity of quicksort is?

Solution:

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

Answer: O(n²)

Question 11

Q11: Which SQL clause filters grouped rows after GROUP BY?

Solution:

HAVING filters aggregates; WHERE filters rows before grouping.

Answer: HAVING

2024 hiring trends

Hiring volume

2024 Data: Atlassian hired 500-1000 candidates from top engineering colleges in 2024. The company conducted placement drives at 50+ colleges across India.

Salary packages

2024 Packages: ₹30-40 LPA for freshers

Process changes

2024 Updates: Updated online assessment platform, new interview formats

Key insights from 2024 Atlassian Online Assessment

1. Coding Section is Critical: Must solve 2-3 coding problems correctly to advance
2. Technical MCQs: Strong emphasis on CS fundamentals, OOP, system design, collaboration tools
3. Time Management: 2-3 coding problems in 60-90 minutes + 15-20 technical MCQs in 30-40 minutes + 10-15 aptitude in 20-30 minutes
4. Success Rate: Only 10-15% cleared OA and advanced to interviews
5. Platform: Atlassian’s assessment platform or HackerRank
6. Focus Areas: DSA, algorithms, system design, collaboration tools, developer productivity

Atlassian 2024 interview experiences

Based on candidate experiences from 2024 Atlassian interviews:

2024 Interview Process:

1. Online Assessment (90-120 minutes): Coding (2-3 problems) + Technical MCQs (15-20) + Aptitude (10-15)
2. Technical Phone Screen (45-60 minutes): Coding problems, algorithm discussions, system design
3. Onsite Interviews (4-5 rounds, 45-60 minutes each):

• Coding rounds (2-3): Algorithms, data structures, problem-solving
• System Design rounds: Collaboration tools, developer productivity platforms, scalable systems
• Behavioral rounds: Problem-solving approach, innovation, teamwork, developer empathy

Common 2024 Interview Topics:

• Coding: Arrays, strings, trees, graphs, dynamic programming, collaboration algorithms
• System Design: Collaboration tools, developer productivity platforms, scalable systems
• Behavioral: Problem-solving, innovation, teamwork, developer empathy
• Atlassian Technologies: Jira, Confluence, Bitbucket, collaboration tools, developer productivity

2024 Interview Questions Examples:

• Two Sum Problem
• Reverse Linked List
• Design a collaboration tool (System Design)
• Design a developer productivity platform (System Design)
• Collaboration and workflow algorithms

Success Tips:

• Strong coding performance is essential - solve problems optimally
• Understand collaboration tools and developer productivity concepts
• Practice system design for collaboration platforms and scalable systems
• Prepare examples demonstrating innovation and developer empathy
• Learn Atlassian’s products - Jira, Confluence, Bitbucket
• Practice explaining your thought process clearly

For detailed interview experiences, visit Atlassian Interview Experience page.

Preparation tips for Atlassian 2024 pattern

1. Master Coding Fundamentals: Focus on solving 2-3 coding problems correctly - arrays, trees, graphs, DP
2. System Design Mastery: Learn collaboration tool design, developer productivity platforms, scalable systems
3. Practice Previous Year Papers: Solve Atlassian OA papers from 2020-2024 to understand patterns
4. Time Management: Practice completing 2-3 coding problems in 60-90 minutes
5. Technical MCQs: Practice CS fundamentals, OOP, system design, collaboration concepts
6. LeetCode Practice: Solve 200+ LeetCode problems focusing on arrays, strings, trees, graphs (medium-hard difficulty)
7. Collaboration Tools: Understand collaboration platforms, workflow systems, developer productivity
8. Atlassian Technologies: Learn Jira, Confluence, Bitbucket, collaboration tools
9. Behavioral Preparation: Prepare examples using STAR format - innovation, developer empathy, problem-solving
10. Mock Tests: Take timed practice tests to improve speed and accuracy
11. Developer Focus: Understand developer workflows and productivity challenges

Comments & Suggestions

Related resources

2025 papers→

Coding questions→

Interview experience→

Preparation guide→

Atlassian hub→

Similar companies

Google · Microsoft · Amazon · Zoho · Freshworks · Salesforce