Atlassian interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Atlassian
3 rounds | 7 Coding
problems
Rejected
Interview preparation journey
Preparation
Duration: 10 months
Topics: Operating System, DBMS, Data Structures and Algorithms , OOP , Computer Networks
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 process
Where: Campus
Eligibility: 8 CGPA
Tip 1 : Atleast 4 projects on Resume
Tip 2 : Do not write false things. You always get caught. Be genuine.
Interview rounds
01
Round
Hard
Online Coding Interview
Duration75 minutes
Interview date10 Aug 2020
Coding problem3
Coding Test with 3 problems. 1 Easy , 1 Medium , 1 Very Hard
1. Job Scheduling Problem
Moderate
15m average time
85% success
0/80
Asked in companies
You are given a list of ‘N’ jobs which has to be performed. Each job is associated with a deadline and a profit if the job is completed before the deadline. Each job takes one unit of time to complete.
You are required to schedule the jobs in such a way that total profit will be maximized. Only one job can be scheduled at a time, and jobs can be scheduled at only integer moments of time greater than or equal to one.
For example-
Let there be three jobs ‘A’, ‘B’, and ‘C’-
•Profit and deadline associated with job ‘A’ being 20 and 1.
•Profit and deadline associated with job ‘B’ being 30 and 2.
•Profit and deadline associated with job ‘C’ being 40 and 2.
We will perform job ‘C’ at time t = 1 and job ‘B’ at time t = 2. The total profit will be 70. There is no other sequence of jobs which can fetch us a better overall profit.
Problem approach
Solved with Greedy + DP
I had solved very similar problem before. So it was easy for me
2. Spiral Order Traversal of a Binary Tree
Easy
20m average time
75% success
0/40
Asked in companies
You have been given a binary tree of 'N' nodes. Print the Spiral Order traversal of this binary tree.
For example
For the given binary tree [1, 2, 3, -1, -1, 4, 5, -1, -1, -1, -1]
1
/ \
2 3
/ \
4 5
Output: 1 3 2 4 5
Problem approach
Solved using brute force. All test case passed. I had solved many problems with dfs on trees before.
3. Goku and Dragon Balls
Moderate
35m average time
55% success
0/80
Asked in companies
Goku has ‘N’ Dragon Balls. Each Dragon Ball is unique with the ith Dragon Ball having ‘i’ stars on it. For example, the first Dragon Ball has 1 star, the second Dragon Ball has 2 stars, and so on.
Goku gave a task to Gohan to arrange the ‘N’ Dragon Balls in a binary tree-like structure. While making the binary tree, he has to make sure that these conditions must be fulfilled:
The left subtree of any particular Dragon Ball ‘D’ will always contain Dragon Balls with the number of stars less than that of the Dragon Ball ‘D’.
The right subtree of any particular Dragon Ball ‘D’ will always contain Dragon Ball's with the number of stars greater than that of the Dragon Ball ‘D’.
Can you find out how many structurally unique binary trees Gohan can make by fulfilling these conditions?
Note:
The number of structurally unique binary trees can be very large, so return the number of structurally unique binary trees modulo 10^9 + 7.
Problem approach
I don't remember exact question, hard coded few visible test cases
02
Round
Hard
Video Call
Duration60 minutes
Interview date11 Aug 2020
Coding problem2
In depth questions on Subjects like OOP , DBMS , OS , Javascript.
1. Operating System
What is virtual memory. What are its uses. Different OS related problems, Indexing
Problem approach
Tip 1 : Be to the point
Tip 2 : Don't use book language
Tip 3 : Use examples
2. Java script
What is javascript, its uses, server client problems.
Problem approach
Tip 1 : Be to the point
Tip 2 : Don't use book language
Tip 3 : Use examples
03
Round
Hard
Video Call
Duration40 minutes
Interview date11 Aug 2020
Coding problem2
Questions on my resume, projects, internship done. Interviewer was a bit harsh on me.
1. System Design
Compiler design related questions, differences between Python and C in very depth.
Problem approach
Tip 1 : Be to the point
Tip 2 : Don't use book language
Tip 3 : Use examples
2. System Design
Low level vs High level language, kernel related questions
Problem approach
Tip 1 : Be to the point
Tip 2 : Don't use bookish language
Tip 3 : Use examples
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
Which operator is used for exponentiation in Python?
Choose another skill to practice
Similar interview experiences
SDE - 1
5 rounds | 5 problems
Interviewed by Atlassian
Selected 
4266 views
0 comments
0 upvotes
SDE - 1
1 rounds | 3 problems
Interviewed by Atlassian
Rejected
2193 views
0 comments
0 upvotes
SDE - 1
2 rounds | 3 problems
Interviewed by Atlassian
Rejected
1668 views
0 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by Atlassian
Rejected
1903 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 107484 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 51830 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 32109 views
6 comments
0 upvotes