Atlassian interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Atlassian
upvote
share-icon
2 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 5 months
Topics: Data Structures, Algorithms, OOPS, OS, DBMS.
Tip
Tip

Tip 1 : Work on Competitive Programming skills. That is one thing most companies look out for during hiring. Solve at least 100 
questions from every topic.
Tip 2 : You should have at least 2 good projects on your resume. Only write the things that you are completely sure of.
Tip 3 : Work on CS fundamentals as well like -OOPS, OS, and DBMS. There will be MCQ questions from this in the coding round as well as in the 1:1 round

Application process
Where: Linkedin
Eligibility: No
Resume Tip
Resume tip

Tip 1 : Need at least 2 good projects on the resume. Write a short 2-3 lines summary of the project and the tech stack 
used.
Tip 2 : Resume should be 1 page only. Try to keep the Resume short with useful information only.
Tip 3 : Your Resume should clearly mention the skillset you have. Companies sometimes filter out Resume based on 
skillset only

Interview rounds

01
Round
Easy
Face to Face
Duration60 minutes
Interview date6 Jul 2021
Coding problem2

1. Smallest Window

Moderate
10m average time
90% success
0/80
Asked in companies
ArcesiumReliance Jio Infocomm LtdGoldman Sachs

You are given two strings S and X containing random characters. Your task is to find the smallest substring in S which contains all the characters present in X.

Example:

Let S = “abdd” and X = “bd”.

The windows in S which contain all the characters in X are: 'abdd', 'abd', 'bdd', 'bd'. 
Out of these, the smallest substring in S which contains all the characters present in X is 'bd'. 
All the other substring have a length larger than 'bd'.
Problem approach

Can be solved via a sliding window approach

 

Try solving now

2. N-th Node From The End

Easy
10m average time
90% success
0/40
Asked in companies
Thought WorksHikeAmazon

You are given a Singly Linked List of integers. You have to find the N-th node from end.

For Example
If the given list is (1 -> -2 -> 0 -> 4) and N=2:

example

Then the 2nd node from the end is 0.
Problem approach

it can be solved by counting number of elements in linked list or by slow pointer fast pointer approach

Try solving now
02
Round
Easy
Face to Face
Duration70 minutes
Interview date9 Jul 2021
Coding problem1

1. System Design Question

Design Netflix.

Problem approach

Tip 1 : Practice HLD and LLD on some commonly asked designs
Tip 2 : You should know about basics like Caching, CAP Theorem

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
5 rounds | 5 problems
Interviewed by Atlassian
5331 views
0 comments
0 upvotes
company logo
SDE - 1
1 rounds | 3 problems
Interviewed by Atlassian
3251 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 3 problems
Interviewed by Atlassian
1325 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Atlassian
2477 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114579 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57825 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34961 views
7 comments
0 upvotes