66 problems · 12 Easy, 39 Medium, 15 Hard · Ranked #38 of 458
Difficulty breakdown
12 Easy
18% · avg 23%
39 Medium
59% · avg 59%
15 Hard
23% · avg 18%
Top topics
array
77.3%
hash-table
30.3%
string
30.3%
sorting
24.2%1.7x
dynamic-programming
22.7%
binary-search
13.6%1.5x
Interview profile
Based on 66 reported problems, Atlassian interviews are slightly harder than average - 23% Hard vs 18% across all companies. The majority (59%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Atlassian puts unusual emphasis on shortest-path (6.1% of problems, 12.2x the industry average), data-stream (3% of problems, 4.6x the industry average), enumeration (3% of problems, 3.7x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (77.3%), hash-table (30.3%), string (30.3%), sorting (24.2%). Problems below are sorted by frequency, the ones at the top are asked most often.
All 66 problems
Problem
Difficulty
Frequency
Topics
Rank Teams by Votes
In a special ranking system, each voter gives a rank from highest to lowest to all teams participating in the competition.
You are given a stream of records about a particular stock. Each record contains a timestamp and the corresponding price of the stock at that timestamp.
You are given a 2D 0-indexed array of strings, accesstimes, with size n. For each i where 0 <= i <= n - 1, accesstimes[i][0] represents the name of an employee,...
Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove...
You are given a m x n matrix grid consisting of non-negative integers where grid[row][col] represents the minimum time required to be able to visit the cell (ro...
Maximum Square Area by Removing Fences From a Field
There is a large (m - 1) x (n - 1) rectangular field with corners at (1, 1) and (m, n) containing some horizontal and vertical fences given in arrays hFences an...
You are given two 0-indexed strings source and target, both of length n and consisting of lowercase English letters. You are also given two 0-indexed character...
You are given two 0-indexed strings source and target, both of length n and consisting of lowercase English characters. You are also given two 0-indexed string...
There is a company with n branches across the country, some of which are connected by roads. Initially, all branches are reachable from each other by traveling...
Given an array of strings words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right) justifie...
There is a network of n servers, labeled from 0 to n - 1. You are given a 2D integer array edges, where edges[i] = [ui, vi] indicates there is a message channel...
You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and num...
You are given an array people where people[i] is the weight of the ith person, and an infinite number of boats where each boat can carry a maximum weight of lim...
You are given an m x n integer array grid. There is a robot initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-r...
You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).
Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
There is a 1-based binary matrix where 0 represents land and 1 represents water. You are given integers row and col representing the number of rows and columns...
There is an undirected graph with n nodes numbered from 0 to n - 1 (inclusive). You are given a 0-indexed integer array values where values[i] is the value of t...
You are installing a billboard and want it to have the largest height. The billboard will have two steel supports, one on each side. Each steel support must be...
Given a sorted integer array arr, two integers k and x, return the k closest integers to x in the array. The result should also be sorted in ascending order.
You are part of a university admissions office and need to keep track of the kth highest test score from applicants in real-time. This helps to determine cut-of...
You are given a stream of records about a particular stock. Each record contains a timestamp and the corresponding price of the stock at that timestamp.
You are given a 2D 0-indexed array of strings, accesstimes, with size n. For each i where 0 <= i <= n - 1, accesstimes[i][0] represents the name of an employee,...
Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove...
You are given a m x n matrix grid consisting of non-negative integers where grid[row][col] represents the minimum time required to be able to visit the cell (ro...
HardLikely
arraybreadth-first-searchgraph
Make Lexicographically Smallest Array by Swapping Elements
There is a large (m - 1) x (n - 1) rectangular field with corners at (1, 1) and (m, n) containing some horizontal and vertical fences given in arrays hFences an...
You are given two 0-indexed strings source and target, both of length n and consisting of lowercase English letters. You are also given two 0-indexed character...
You are given two 0-indexed strings source and target, both of length n and consisting of lowercase English characters. You are also given two 0-indexed string...
There is a company with n branches across the country, some of which are connected by roads. Initially, all branches are reachable from each other by traveling...
Given an array of strings words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right) justifie...
There is a network of n servers, labeled from 0 to n - 1. You are given a 2D integer array edges, where edges[i] = [ui, vi] indicates there is a message channel...
You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and num...
You are given an array people where people[i] is the weight of the ith person, and an infinite number of boats where each boat can carry a maximum weight of lim...
You are given an m x n integer array grid. There is a robot initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-r...
You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).
Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
There is a 1-based binary matrix where 0 represents land and 1 represents water. You are given integers row and col representing the number of rows and columns...
There is an undirected graph with n nodes numbered from 0 to n - 1 (inclusive). You are given a 0-indexed integer array values where values[i] is the value of t...
You are installing a billboard and want it to have the largest height. The billboard will have two steel supports, one on each side. Each steel support must be...
Given a sorted integer array arr, two integers k and x, return the k closest integers to x in the array. The result should also be sorted in ascending order.
You are part of a university admissions office and need to keep track of the kth highest test score from applicants in real-time. This helps to determine cut-of...
You are given an array of strings products and a string searchWord.
MediumSometimes
arraystringbinary-search
How often are these problems asked?
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Atlassian interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Preparing for your Atlassian coding interview
Atlassian interviews focus heavily on array, hash-table, string problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Atlassian interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
What coding problems does Atlassian ask in interviews?add
Atlassian has been reported to ask 66 distinct coding problems. The most common topics are array, hash-table, string. 12 are Easy difficulty, 39 are Medium, and 15 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
How hard are Atlassian coding interviews?add
Based on 66 reported problems, Atlassian interviews are slightly harder than average - 23% Hard vs 18% across all companies. 59% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
How should I prepare for a Atlassian coding interview?add
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, hash-table, string. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Atlassian coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.