Problem database last updated: June 20, 2025

AAtlassian logo

Atlassian Coding Interview Questions

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

Rank Teams by Votes

Solve

In a special ranking system, each voter gives a rank from highest to lowest to all teams participating in the competition.

MediumVery Likely
arrayhash-tablestring

Stock Price Fluctuation

Solve

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.

MediumVery Likely
hash-tabledesignheap-priority-queue

All O`one Data Structure

Solve

Design a data structure to store the strings' count with the ability to return the strings with minimum and maximum counts.

HardVery Likely
hash-tablelinked-listdesign

High-Access Employees

Solve

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,...

MediumLikely
arrayhash-tablestring

Merge Intervals

Solve

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...

MediumLikely
arraysorting

Minimum Time to Visit a Cell In a Grid

Solve

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

Solve

You are given a 0-indexed array of positive integers nums and a positive integer limit.

MediumLikely
arrayunion-findsorting

Smallest Missing Non-negative Integer After Operations

Solve

You are given a 0-indexed integer array nums and an integer value.

MediumLikely
arrayhash-tablemath

Verbal Arithmetic Puzzle

Solve

Given an equation, represented by words on the left side and the result on the right side.

HardLikely
arraymathstring

Maximum Square Area by Removing Fences From a Field

Solve

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...

MediumLikely
arrayhash-tableenumeration

Maximum Area of Longest Diagonal Rectangle

Solve

You are given a 2D 0-indexed integer array dimensions.

EasyLikely
array

Maximum Good Subarray Sum

Solve

You are given an array nums of length n and a positive integer k.

MediumLikely
arrayhash-tableprefix-sum

Minimum Cost to Convert String I

Solve

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...

MediumLikely
arraystringgraph

Find the Width of Columns of a Grid

Solve

You are given a 0-indexed m x n integer matrix grid. The width of a column is the maximum length of its integers.

EasyLikely
arraymatrix

Minimum Cost to Convert String II

Solve

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...

HardLikely
arraystringdynamic-programming

Number of Possible Sets of Closing Branches

Solve

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...

HardLikely
bit-manipulationgraphheap-priority-queue

Cherry Pickup

Solve

You are given an n x n grid representing a field of cherries, each cell is one of three possible integers.

HardLikely
arraydynamic-programmingmatrix

Group Anagrams

Solve

Given an array of strings strs, group the anagrams together. You can return the answer in any order.

MediumLikely
arrayhash-tablestring

Longest String Chain

Solve

You are given an array of words where each word consists of lowercase English letters.

MediumLikely
arrayhash-tabletwo-pointers

Text Justification

Solve

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...

HardLikely
arraystringsimulation

Lowest Common Ancestor of a Binary Tree

Solve

Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

MediumLikely
treedepth-first-searchbinary-tree

Longest Increasing Subsequence

Solve

Given an integer array nums, return the length of the longest strictly increasing subsequence.

MediumLikely
arraybinary-searchdynamic-programming

Majority Element II

Solve

Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.

MediumLikely
arrayhash-tablesorting

Best Time to Buy and Sell Stock

Solve

You are given an array prices where prices[i] is the price of a given stock on the ith day.

EasySometimes
arraydynamic-programming

Koko Eating Bananas

Solve

Koko loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours.

MediumSometimes
arraybinary-search

Can Place Flowers

Solve

You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots.

EasySometimes
arraygreedy

Top K Frequent Elements

Solve

Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order.

MediumSometimes
arrayhash-tabledivide-and-conquer

String Transformation

Solve

You are given two strings s and t of equal length n. You can perform the following operation on the string s:

HardSometimes
mathstringdynamic-programming

Online Election

Solve

You are given two integer arrays persons and times. In an election, the ith vote was cast for persons[i] at time times[i].

MediumSometimes
arrayhash-tablebinary-search

The Time When the Network Becomes Idle

Solve

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...

MediumSometimes
arraybreadth-first-searchgraph

Russian Doll Envelopes

Solve

You are given a 2D array of integers envelopes where envelopes[i] = [wi, hi] represents the width and the height of an envelope.

HardSometimes
arraybinary-searchdynamic-programming

Word Search

Solve

Given an m x n grid of characters board and a string word, return true if word exists in the grid.

MediumSometimes
arraystringbacktracking

Two Sum

Solve

Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target.

EasySometimes
arrayhash-map

Longest Substring Without Repeating Characters

Solve

Given a string s, find the length of the longest substring without duplicate characters.

MediumSometimes
hash-tablestringsliding-window

Longest Consecutive Sequence

Solve

Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence.

MediumSometimes
arrayhash-tableunion-find

Integer to Roman

Solve

Seven different symbols represent Roman numerals with the following values:

MediumSometimes
hash-tablemathstring

Merge Sorted Array

Solve

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...

EasySometimes
arraytwo-pointerssorting

Jump Game II

Solve

You are given a 0-indexed array of integers nums of length n. You are initially positioned at index 0.

MediumSometimes
arraydynamic-programminggreedy

Pairs of Songs With Total Durations Divisible by 60

Solve

You are given a list of songs where the ith song has a duration of time[i] seconds.

MediumSometimes
arrayhash-tablecounting

Count Vowels Permutation

Solve

Given an integer n, your task is to count how many strings of length n can be formed under the following rules:

HardSometimes
dynamic-programming

Nth Highest Salary

Solve

Table: Employee

MediumSometimes
database

Crawler Log Folder

Solve

The Leetcode file system keeps a log each time some user performs a change folder operation.

EasySometimes
arraystringstack

Boats to Save People

Solve

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...

MediumSometimes
arraytwo-pointersgreedy

Maximum Number of Occurrences of a Substring

Solve

Given a string s, return the maximum number of occurrences of any substring under the following rules:

MediumSometimes
hash-tablestringsliding-window

Design a Food Rating System

Solve

Design a food rating system that can do the following:

MediumSometimes
arrayhash-tablestring

Unique Paths II

Solve

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...

MediumSometimes
arraydynamic-programmingmatrix

Trapping Rain Water

Solve

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

HardSometimes
arraytwo-pointersdynamic-programming

Coin Change

Solve

You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money.

MediumSometimes
arraydynamic-programmingbreadth-first-search

Find First and Last Position of Element in Sorted Array

Solve

Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value.

MediumSometimes
arraybinary-search

Assign Cookies

Solve

Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie.

EasySometimes
arraytwo-pointersgreedy

Container With Most Water

Solve

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]).

MediumSometimes
arraytwo-pointersgreedy

Valid Anagram

Solve

Given two strings s and t, return true if t is an anagram of s, and false otherwise.

EasySometimes
hash-tablestringsorting

Maximum Subarray

Solve

Given an integer array nums, find the subarray with the largest sum, and return its sum.

MediumSometimes
arraydivide-and-conquerdynamic-programming

3Sum

Solve

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.

MediumSometimes
arraytwo-pointerssorting

Single Element in a Sorted Array

Solve

You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once.

MediumSometimes
arraybinary-search

Last Day Where You Can Still Cross

Solve

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...

HardSometimes
arraybinary-searchdepth-first-search

Find Words That Can Be Formed by Characters

Solve

You are given an array of strings words and a string chars.

EasySometimes
arrayhash-tablestring

Count Vowel Strings in Ranges

Solve

You are given a 0-indexed array of strings words and a 2D array of integers queries.

MediumSometimes
arraystringprefix-sum

Design Add and Search Words Data Structure

Solve

Design a data structure that supports adding new words and finding if a string matches any previously added string.

MediumSometimes
stringdepth-first-searchdesign

Maximum Path Quality of a Graph

Solve

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...

HardSometimes
arraybacktrackinggraph

Tallest Billboard

Solve

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...

HardSometimes
arraydynamic-programming

Add Two Integers

Solve

Given two integers num1 and num2, return the sum of the two integers.

EasySometimes
math

Find K Closest Elements

Solve

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.

MediumSometimes
arraytwo-pointersbinary-search

Number of Digit One

Solve

Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n.

HardSometimes
mathdynamic-programmingrecursion

Kth Largest Element in a Stream

Solve

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...

EasySometimes
treedesignbinary-search-tree

Search Suggestions System

Solve

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.

Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.

Frequently Asked Questions

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.

Other companies to explore

Ready to ace your Atlassian interview?

Simulate a real Atlassian coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.

Simulate a Atlassian interview with AIarrow_forward