Atlassian coding interview
questions, leaked.
73 problems reported across recent Atlassian interviews. Top patterns: array, hash table, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Atlassian's assessment leans hard on arrays and hash tables. Out of 73 problems in the reported set, 55 are array-based and 26 involve hash tables. The difficulty split is telling: 45 medium, 15 hard, and only 13 easy. You'll face design questions like Snake Game and All O'one Data Structure back to back with sorting and two-pointer work. If you blank mid-assessment, StealthCoder runs invisibly and surfaces a working solution in seconds. The real prep is drilling array patterns first, then hash-table combos.
Top problems at Atlassian
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Rank Teams by Votes | MEDIUM | 100.0 | 59% | Array · Hash Table · String |
| 02 | Design Snake Game | MEDIUM | 88.4 | 40% | Array · Hash Table · Design |
| 03 | Stock Price Fluctuation | MEDIUM | 86.6 | 48% | Hash Table · Design · Heap (Priority Queue) |
| 04 | All O`one Data Structure | HARD | 77.2 | 44% | Hash Table · Linked List · Design |
| 05 | High-Access Employees | MEDIUM | 71.2 | 46% | Array · Hash Table · String |
| 06 | Logger Rate Limiter | EASY | 71.2 | 77% | Hash Table · Design · Data Stream |
| 07 | Merge Intervals | MEDIUM | 61.9 | 49% | Array · Sorting |
| 08 | Meeting Rooms II | MEDIUM | 58.7 | 52% | Array · Two Pointers · Greedy |
| 09 | Find the Width of Columns of a Grid | EASY | 58.7 | 69% | Array · Matrix |
| 10 | Maximum Square Area by Removing Fences From a Field | MEDIUM | 58.7 | 24% | Array · Hash Table · Enumeration |
| 11 | Maximum Area of Longest Diagonal Rectangle | EASY | 58.7 | 37% | Array |
| 12 | Cherry Pickup | HARD | 58.7 | 38% | Array · Dynamic Programming · Matrix |
| 13 | Minimum Time to Visit a Cell In a Grid | HARD | 58.7 | 57% | Array · Breadth-First Search · Graph |
| 14 | Verbal Arithmetic Puzzle | HARD | 58.7 | 35% | Array · Math · String |
| 15 | Number of Possible Sets of Closing Branches | HARD | 58.7 | 48% | Bit Manipulation · Graph · Heap (Priority Queue) |
| 16 | Make Lexicographically Smallest Array by Swapping Elements | MEDIUM | 58.7 | 60% | Array · Union Find · Sorting |
| 17 | Minimum Cost to Convert String II | HARD | 58.7 | 26% | Array · String · Dynamic Programming |
| 18 | Smallest Missing Non-negative Integer After Operations | MEDIUM | 58.7 | 40% | Array · Hash Table · Math |
| 19 | Minimum Cost to Convert String I | MEDIUM | 58.7 | 58% | Array · String · Graph |
| 20 | Maximum Good Subarray Sum | MEDIUM | 58.7 | 20% | Array · Hash Table · Prefix Sum |
| 21 | Text Justification | HARD | 56.8 | 48% | Array · String · Simulation |
| 22 | Longest String Chain | MEDIUM | 56.8 | 62% | Array · Hash Table · Two Pointers |
| 23 | Group Anagrams | MEDIUM | 56.8 | 71% | Array · Hash Table · String |
| 24 | Design File System | MEDIUM | 56.8 | 64% | Hash Table · String · Design |
| 25 | Lowest Common Ancestor of a Binary Tree | MEDIUM | 54.6 | 67% | Tree · Depth-First Search · Binary Tree |
| 26 | Longest Increasing Subsequence | MEDIUM | 54.6 | 58% | Array · Binary Search · Dynamic Programming |
| 27 | Majority Element II | MEDIUM | 52.2 | 54% | Array · Hash Table · Sorting |
| 28 | Koko Eating Bananas | MEDIUM | 49.5 | 49% | Array · Binary Search |
| 29 | Best Time to Buy and Sell Stock | EASY | 49.5 | 55% | Array · Dynamic Programming |
| 30 | Can Place Flowers | EASY | 46.2 | 29% | Array · Greedy |
| 31 | Top K Frequent Elements | MEDIUM | 46.2 | 65% | Array · Hash Table · Divide and Conquer |
| 32 | The Time When the Network Becomes Idle | MEDIUM | 46.2 | 54% | Array · Breadth-First Search · Graph |
| 33 | Online Election | MEDIUM | 46.2 | 52% | Array · Hash Table · Binary Search |
| 34 | String Transformation | HARD | 46.2 | 25% | Math · String · Dynamic Programming |
| 35 | Russian Doll Envelopes | HARD | 42.2 | 37% | Array · Binary Search · Dynamic Programming |
| 36 | Word Search | MEDIUM | 42.2 | 45% | Array · String · Backtracking |
| 37 | Two Sum | EASY | 42.2 | 56% | Array · Hash Table |
| 38 | Longest Consecutive Sequence | MEDIUM | 42.2 | 47% | Array · Hash Table · Union Find |
| 39 | Longest Substring Without Repeating Characters | MEDIUM | 42.2 | 37% | Hash Table · String · Sliding Window |
| 40 | Nth Highest Salary | MEDIUM | 37.1 | 38% | Database |
| 41 | Integer to Roman | MEDIUM | 37.1 | 69% | Hash Table · Math · String |
| 42 | Crawler Log Folder | EASY | 37.1 | 72% | Array · String · Stack |
| 43 | Count Vowels Permutation | HARD | 37.1 | 61% | Dynamic Programming |
| 44 | Maximum Number of Occurrences of a Substring | MEDIUM | 37.1 | 53% | Hash Table · String · Sliding Window |
| 45 | Boats to Save People | MEDIUM | 37.1 | 60% | Array · Two Pointers · Greedy |
| 46 | Design Tic-Tac-Toe | MEDIUM | 37.1 | 59% | Array · Hash Table · Design |
| 47 | Merge Sorted Array | EASY | 37.1 | 53% | Array · Two Pointers · Sorting |
| 48 | Pairs of Songs With Total Durations Divisible by 60 | MEDIUM | 37.1 | 53% | Array · Hash Table · Counting |
| 49 | Jump Game II | MEDIUM | 37.1 | 42% | Array · Dynamic Programming · Greedy |
| 50 | Find First and Last Position of Element in Sorted Array | MEDIUM | 30.0 | 47% | Array · Binary Search |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Atlassian OA. The proctor cannot see it. Screen share cannot detect it. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know.
Get StealthCoder- array55 · 75%
- hash table26 · 36%
- string21 · 29%
- sorting17 · 23%
- dynamic programming15 · 21%
- design11 · 15%
- two pointers10 · 14%
- binary search10 · 14%
- heap priority queue9 · 12%
- greedy7 · 10%
Arrays dominate the signal here. Nearly 75 percent of problems touch arrays, and the medium-to-hard ratio (60 problems in those two bands) means you won't see gimmes. Sorting and hash tables are the secondary pillars, appearing in 17 and 26 problems respectively, often paired with arrays. Design problems like Stock Price Fluctuation and Logger Rate Limiter test whether you can think in data structures, not just algorithms. Dynamic programming and graph work are lower frequency but hard when they show. Start with array manipulation, then lock in hash-table patterns. Sorting and two-pointers are the tactical bridges. If you hit a design problem you haven't drilled and can't reason through fast, StealthCoder solves it live while the proctor sees nothing.
Companies with similar patterns
If you prepped for Atlassian, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Atlassian.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Atlassian interview FAQ
Should I prioritize arrays or hash tables for Atlassian?+
Arrays first. They appear in 55 of 73 problems, including most of the medium and hard tier. Hash tables are critical too at 26 problems, but many questions combine both. Master array traversal, partitioning, and range work before moving to hash-table design patterns.
How many design problems will I see?+
Design shows up in at least 11 problems in the reported set. Expect questions like Snake Game, Stock Price Fluctuation, and All O'one Data Structure. These require you to pick the right data structure and think through state management. Drill design patterns alongside your array and hash-table work.
Are dynamic programming and graph problems common in Atlassian interviews?+
Lower frequency compared to arrays and hashing. DP appears in 15 problems, graph in 6. They're usually the hard tier, so if you see Cherry Pickup or Minimum Time to Visit a Cell, expect to spend time. Study them last if you're short on time, but know the core patterns.
What's the hardest problem I should expect?+
Problems like All O'one Data Structure and Cherry Pickup represent the ceiling. All O'one requires doubly-linked lists and hash tables in concert. Cherry Pickup is a DP and matrix problem that's genuinely tricky. Both are hard tier. If you haven't solved similar ones, plan to see them cold.
How many problems should I solve before the assessment?+
The reported set has 73 problems. You can't drill all of them. Aim for 25 to 30 solid ones covering array manipulation, hash-table design, sorting, and two-pointers. Focus on medium difficulty. That covers the bulk of the signal. The rest is pattern recognition on the day.