Upload Button Icon Add office photos

Filter interviews by

Atlassian Software Developer Interview Questions, Process, and Tips

Updated 12 Nov 2024

Top Atlassian Software Developer Interview Questions and Answers

  • Q1. Structurally Unique Binary Trees of Dragon Balls Goku has ‘N’ Dragon Balls, where each Dragon Ball is unique. The ith Dragon Ball has ‘i’ stars on it, meaning the first ...read more
  • Q2. Find K'th Character of Decrypted String You are given an encrypted string where repeated substrings are represented by the substring followed by its count. Your task is ...read more
  • Q3. Quick Sort Problem Statement You are provided with an array of integers. The task is to sort the array in ascending order using the quick sort algorithm. Quick sort is a ...read more
View all 12 questions

Atlassian Software Developer Interview Experiences

6 interviews found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
-

I applied via Referral and was interviewed in Jan 2024. There were 2 interview rounds.

Round 1 - Coding Test 

Karet Interview :
5 back to back System design question, we don't need to explain each component but more like list as many as points. Need to finish all the question in 15min

1-2 problem solving question : It's not fency algorithm round with tough question. But true problem solving round using basic knowledge such as hashmap, heap

Round 2 - Technical 

(3 Questions)

  • Q1. Design File System : You have given file size and collection in input 1 : get total size 2 : find top k collections in size
  • Ans. 

    Design a file system to calculate total size and find top k collections in size.

    • Create a file system class with methods to add files and calculate total size.

    • Maintain a data structure to store the collections and their sizes.

    • Implement a method to find the top k collections based on size.

    • Consider using a priority queue or sorting the collections based on size.

    • Handle edge cases like empty collections or invalid input siz

  • Answered by AI
  • Q2. Find total size
  • Ans. 

    Calculate the total size of an array of strings.

    • Iterate through the array and sum the length of each string.

    • Use the `length` property of each string to get its size.

    • Handle edge cases such as empty strings or null values.

  • Answered by AI
  • Q3. Find Top k collections
  • Ans. 

    The question is asking to find the top k collections.

    • Use a sorting algorithm to sort the collections in descending order based on a specific criteria.

    • Select the top k collections from the sorted list.

    • Return the selected collections as an array of strings.

  • Answered by AI

Skills evaluated in this interview

Software Developer Interview Questions & Answers

user image Andrew Chang

posted on 17 Oct 2024

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(2 Questions)

  • Q1. Tell me about yourself
  • Ans. 

    I am a passionate software developer with experience in Java, Python, and web development.

    • Experienced in Java, Python, and web development technologies

    • Strong problem-solving skills

    • Team player with excellent communication skills

  • Answered by AI
  • Q2. Motivation behind the move
  • Ans. 

    I was motivated to move to this role because of my passion for coding and desire to work on challenging projects.

    • Passion for coding and technology

    • Desire to work on challenging projects

    • Opportunity for growth and learning

    • Interest in the company's products or services

  • Answered by AI

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Medium - Hard DSA Problem they ask

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
6-8 weeks
Result
Selected Selected

I applied via Referral and was interviewed before May 2023. There were 2 interview rounds.

Round 1 - Coding Test 

They asked 3 easy medium leetcode coding questions

Round 2 - Technical 

(1 Question)

  • Q1. Coding interview. Snake game

Atlassian interview questions for designations

 Software Developer Intern

 (5)

 Software Engineer

 (3)

 Software Engineer2

 (1)

 Senior Developer

 (1)

 Java Developer

 (1)

 Senior Software Engineer

 (9)

 Software Engineer Intern

 (5)

 Principal Software Engineer

 (2)

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 75 minutes
Round difficulty - Hard

Coding Test with 3 problems. 1 Easy , 1 Medium , 1 Very Hard

  • Q1. 

    Job Scheduling Problem

    You are provided with a list of jobs, where each job has a specific deadline and profit. The goal is to schedule these jobs such that the total profit is maximized. Each job require...

  • Ans. 

    The goal is to schedule jobs to maximize profit while meeting deadlines. Each job takes one unit of time and only one job can be scheduled at a time.

    • Sort the jobs in decreasing order of profit

    • Iterate through the sorted jobs and schedule them based on their deadlines

    • Keep track of the total profit achieved

    • Ensure each job is completed before its deadline

  • Answered by AI
  • Q2. 

    Spiral Order Traversal of a Binary Tree

    Given a binary tree with N nodes, your task is to output the Spiral Order traversal of the binary tree.

    Input:

    The input consists of a single line containing elem...
  • Ans. 

    Implement a function to return the spiral order traversal of a binary tree.

    • Traverse the binary tree level by level, alternating between left to right and right to left.

    • Use a queue to keep track of nodes at each level.

    • Append nodes to the result list in the order they are visited.

  • Answered by AI
  • Q3. 

    Structurally Unique Binary Trees of Dragon Balls

    Goku has ‘N’ Dragon Balls, where each Dragon Ball is unique. The ith Dragon Ball has ‘i’ stars on it, meaning the first Dragon Ball has 1 star, the second ...

  • Ans. 

    Count the number of structurally unique binary trees that can be constructed with given Dragon Balls.

    • Use dynamic programming to solve this problem efficiently.

    • The number of structurally unique binary trees can be calculated using Catalan numbers.

    • For each test case, calculate the number of structurally unique binary trees modulo 10^9 + 7.

    • Return the count of unique binary trees for each test case.

  • Answered by AI
Round 2 - Video Call 

Round duration - 60 minutes
Round difficulty - Hard

In depth questions on Subjects like OOP , DBMS , OS , Javascript.

Round 3 - Video Call 

(1 Question)

Round duration - 40 minutes
Round difficulty - Hard

Questions on my resume, projects, internship done. Interviewer was a bit harsh on me.

  • Q1. What are the differences between low-level and high-level programming languages, and can you explain some kernel-related questions?
  • Ans. 

    Low-level languages interact directly with hardware, while high-level languages are more abstract and easier to read/write.

    • Low-level languages are closer to machine code and hardware, while high-level languages are closer to human language.

    • Low-level languages require more manual memory management and are less portable, while high-level languages have automatic memory management and are more portable.

    • Examples of low-lev...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteria8 CGPAAltassian interview preparation:Topics to prepare for the interview - Operating System, DBMS, Data Structures and Algorithms , OOP , Computer NetworksTime required to prepare for the interview - 10 monthsInterview preparation tips for other job seekers

Tip 1 : Never leave any topic from any chapter / Subject
Tip 2 : Learn to explain your thoughts well
Tip 3 : Learn from previous experiences / interviews / problems asked.
Tip 4 : Atleast 4 projects in Resume

Application resume tips for other job seekers

Tip 1 : Atleast 4 projects on Resume
Tip 2 : Do not write false things. You always get caught. Be genuine.

Final outcome of the interviewRejected

Skills evaluated in this interview

Get interview-ready with Top Atlassian Interview Questions

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Timing: 90 mins
Environment: Online coding round
No of questions: 3 Questions(225 marks) were asked.

  • Q1. 

    Quick Sort Problem Statement

    You are provided with an array of integers. The task is to sort the array in ascending order using the quick sort algorithm.

    Quick sort is a divide-and-conquer algorithm. It ...

  • Ans. 

    Yes, the quick sort algorithm can be enhanced to achieve NlogN complexity in the worst case by using randomized quick sort or median of three pivot selection.

    • Use randomized quick sort to randomly select the pivot element, reducing the chances of worst-case scenarios.

    • Implement median of three pivot selection to choose a pivot that is closer to the median value, improving partitioning efficiency.

    • Consider using dual pivot...

  • Answered by AI
  • Q2. 

    Find K'th Character of Decrypted String

    You are given an encrypted string where repeated substrings are represented by the substring followed by its count. Your task is to find the K'th character of the d...

  • Ans. 

    Given an encrypted string with repeated substrings represented by counts, find the K'th character of the decrypted string.

    • Parse the encrypted string to extract substrings and their counts

    • Iterate through the substrings and counts to build the decrypted string

    • Track the position in the decrypted string to find the K'th character

  • Answered by AI
  • Q3. 

    Weighted Job Scheduling Problem Statement

    You have 'N' jobs, each with a start time, end time, and profit. Your task is to identify the maximum profit that can be earned by scheduling these jobs such that...

  • Ans. 

    The Weighted Job Scheduling problem involves maximizing profit by scheduling non-overlapping jobs with given start times, end times, and profits.

    • Sort the jobs by end time in ascending order.

    • Initialize an array 'dp' to store maximum profit at each job index.

    • For each job, find the latest non-overlapping job and update 'dp' with the maximum profit.

    • Return the maximum profit from 'dp'.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 45 minutes
Round difficulty - Medium

Timing: evening
Environment: Virtual(remote)
Activity:
It was a resume screening + DSA round . There were 2 interviewers in this round. Initially , a brief introduction was given by them & later , they started with projects listed in my resume . They first asked me to explain about the projects , asked some questions related to its implementation & its actual use case in real world (where it can be used) .Later , they switched to DSA part , a total of 2 questions of easy medium difficulty level were asked . I only remember 1 question that was similar to Minimum platform problem.

After this , They asked me for favourite subjects. I said Operation Systems . Then , they asked for some concepts in OS , including CPU scheduling & its algos like Round robin , SJF etc and later asked which type of scheduling algorithm is used to design actual systems .

  • Q1. 

    Minimum Number of Platforms Problem

    Your task is to determine the minimum number of platforms required at a railway station so that no train has to wait.

    Explanation:

    Given two arrays:

    • AT - represent...
  • Ans. 

    Determine the minimum number of platforms needed at a railway station so that no train has to wait.

    • Sort the arrival and departure times arrays in ascending order.

    • Use two pointers to iterate through the arrays and keep track of the number of platforms needed.

    • Increment the number of platforms needed when a train arrives and decrement it when a train departs.

    • Return the maximum number of platforms needed at any point.

    • Examp...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 50 minutes
Round difficulty - Medium

It was System design round.Though , it also started with a brief introduction & later , asked about projects . As my project was related to test classification . In that context , they asked me to design a low level Suggestion system(In any preferred language) .

  • Q1. 

    Spell Checker Problem Statement

    You are provided with a list of strings, DICTIONARY[], representing the correct spellings of words, and a query string QUERY that may contain misspelled words. Your task is...

  • Ans. 

    Given a list of correct spellings and a query string, return a list of suggested correct spellings if the query is misspelled.

    • Iterate through the dictionary to check for matching prefixes with the query string.

    • If a match is found, add the corresponding word to the list of suggestions.

    • Return the list of suggestions if the query is misspelled, otherwise return an empty list.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo CriteriaAtlassian interview preparation:Topics to prepare for the interview - Data Structures & Algorithms, Competitive programming, Operating systems, Object oriented programming, Database management systems, Computer NetworksTime required to prepare for the interview - 12 MonthsInterview preparation tips for other job seekers

Tip 1 : Practice a lot of problems from leetcode/coding ninjas or some other platform.
Tip 2 : Participate in daily contests on codeforces, leetcode, kickstart, etc.
Tip 3 : Include new topics while learning/solving Data structures problems like tries, BIT, etc.

Application resume tips for other job seekers

Tip 1 : Mention your competitve programming skills and profiles in resume if possible.
Tip 2 : While mentioning things in resume: mention by numbers.
Tip 3 : Make a neet resume in some standard format(maybe by using LaTeX)
Tip 4 : Have atleast 2 projects(on which you are confident) in resume
Tip 5 : Don't put false positive on resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview questions from similar companies

Interview Questionnaire 

1 Question

  • Q1. Spring Collections Difference between list and set What is sorted mean in hashed set java Serialization Exceptions How can you give an exception to caller method Unix- how to move a folder without g...
  • Ans. 

    Interview questions for Software Developer related to Spring, Collections, Serialization, Exceptions, Unix, Annotations, Json, Build tools, Restful services, and more.

    • List and Set are both collection interfaces in Java. List allows duplicates and maintains insertion order while Set doesn't allow duplicates and doesn't maintain any order.

    • Sorted in Hashed Set means that the elements are stored in a sorted order based on ...

  • Answered by AI

Skills evaluated in this interview

I appeared for an interview before Mar 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA.

  • Q1. 

    Reverse Words in a String: Problem Statement

    You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...

  • Ans. 

    Reverse words in a string while handling leading, trailing, and multiple spaces.

    • Split the input string by spaces to get individual words

    • Reverse the order of the words

    • Join the reversed words with a single space in between

    • Handle leading, trailing, and multiple spaces appropriately

  • Answered by AI
  • Q2. 

    Reverse a Stack Using Recursion

    You are given a stack of integers. Your task is to reverse the stack using recursion without using any extra space other than the internal stack space used due to recursion...

  • Ans. 

    Reverse a stack using recursion without using any extra space other than the internal stack space.

    • Use recursion to pop all elements from the original stack and store them in function call stack.

    • Once the stack is empty, push the elements back in reverse order.

    • Base case of recursion should be when the original stack is empty.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA.

  • Q1. 

    Convert a Binary Tree to its Mirror Tree

    Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mirror of a bin...

  • Ans. 

    Convert a binary tree to its mirror tree by interchanging left and right children of all non-leaf nodes.

    • Traverse the binary tree in a recursive manner.

    • Swap the left and right children of each non-leaf node.

    • Continue this process until all nodes have been processed.

  • Answered by AI
  • Q2. 

    Remove Nth Node from End of Linked List

    You are given a singly linked list with 'N' nodes, each containing integer data, and an integer 'K'. Your goal is to remove the 'K'th node counting from the end of ...

  • Ans. 

    Remove the Kth node from the end of a singly linked list.

    • Use two pointers approach to find the Kth node from the end.

    • Handle edge cases like removing the head node or removing the last node.

    • Update the pointers to remove the Kth node and reconnect the list.

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Typical Managerial round.

Interview Preparation Tips

Eligibility criteriaAbove 6 months of experience24/7 customer private limited interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Preparation Tips

General Tips: I asked my seniors about the interview process. Their guidelines were very helpful. Always try to bring the interviewer into your comfort zone. Also be confident and expressive while explaining. Explain your thought process while solving. Even though you don't get the solution the thought process might be very important for your selection.
College Name: NIT SURATHKAL

Interview Preparation Tips

Round: Test
Experience: Oracle had an online test which includes 3
Sections:
1. Programming: basic C++/java programming + data structure. One need to have good hand over oops
to score well in this section.

2. Aptitude: General Aptitude Questions

3. General Maths: Very simple maths problem (+2 level) but needs very very good speed.
Tips: Individual cutoff was not declared, but different cutoff for different profile is expected.
Oracle has no GD round.

Round: Interview
Experience: In 2nd round of interview, there was more programming, less resume based question and more emphasis on will I be comfortable in an IT sector. Some apti questions were also asked.

Round: Interview
Experience: 1st round was completely on resume based. Each and every project and intern is discussed in detail. Most of the extracurricular activities were also discussed. In the 1st interview, some basic program like fibonacci series by recursion, star pattern by loop etc were asked.

Round: Interview
Experience: Next round was HR. I was asked about the earlier 2 interviews and some basic HR questions.

College Name: IIT Roorkee

Atlassian Interview FAQs

How many rounds are there in Atlassian Software Developer interview?
Atlassian interview process usually has 1-2 rounds. The most common rounds in the Atlassian interview process are Coding Test, Technical and HR.
How to prepare for Atlassian Software Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Atlassian. The most common topics and skills that interviewers at Atlassian expect are AWS, Computer science, HR, Javascript and Python.
What are the top questions asked in Atlassian Software Developer interview?

Some of the top questions asked at the Atlassian Software Developer interview -

  1. Design File System : You have given file size and collection in input 1 : get ...read more
  2. Find Top k collecti...read more
  3. Find total s...read more

Tell us how to improve this page.

Atlassian Software Developer Interview Process

based on 6 interviews

1 Interview rounds

  • Coding Test Round
View more
Atlassian Software Developer Salary
based on 112 salaries
₹20 L/yr - ₹85 L/yr
477% more than the average Software Developer Salary in India
View more details

Atlassian Software Developer Reviews and Ratings

based on 9 reviews

3.8/5

Rating in categories

3.5

Skill development

3.7

Work-life balance

4.4

Salary

3.3

Job security

3.6

Company culture

3.3

Promotions

3.8

Work satisfaction

Explore 9 Reviews and Ratings
Software Engineer
184 salaries
unlock blur

₹16.5 L/yr - ₹60 L/yr

Senior Software Engineer
113 salaries
unlock blur

₹21.7 L/yr - ₹91 L/yr

Software Developer
112 salaries
unlock blur

₹20 L/yr - ₹85 L/yr

Sde1
57 salaries
unlock blur

₹28 L/yr - ₹86 L/yr

Software Development Engineer II
43 salaries
unlock blur

₹25 L/yr - ₹96 L/yr

Explore more salaries
Compare Atlassian with

Salesforce

4.0
Compare

Google

4.4
Compare

Amazon

4.1
Compare

Oracle

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview