Atlassian Software Engineer interview questions

48 Software Engineers have shared notes from their Atlassian interviews, with the questions they were asked in each round. That is 66% of the 73 Atlassian interview notes on Screna AI.

48 Software Engineer interview notes

Atlassian·Software Engineer·Onsite - System Design / Architecture

Jun 2026
System design round at Atlassian for a software engineer role. The whole thing was one big distributed systems question about building an async web crawler service, and it went pretty deep into territory I wasn't fully prepared for.
  • Design a REST API service where clients submit URLs and the service crawls each URL plus all its sublinks to extract image references. The API should support submitting a batch of URLs and polling for job status and results.
  • How would you architect the crawler itself? Walk through the worker pool, the URL frontier/queue, and how you'd deduplicate already-visited URLs.
  • How would you handle polite crawling, including rate limiting per domain and respecting robots.txt?
  • How do you know when a crawl job is fully complete? Specifically, how do you detect that all sublinks have been discovered and processed?
  • How would you handle failures, retries, and timeouts in the crawler?
  • How would you store intermediate crawl state so the system can recover if a worker crashes mid-job?

“I got the basic shape of it pretty quickly: POST to create a job, GET to poll status, return discovered images once done.”

View Post

Atlassian·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Atlassian system design round that went deep into graph theory pretty fast. The problem started as a classic LCA question but then they kept piling on mutations and concurrency until it was a full distributed systems conversation. Walked away feeling like I'd held my own on maybe 70% of it.
  • Given an organization modeled as a DAG where employees can belong to multiple orgs and orgs can have multiple parent orgs, design a system to find the 'lowest common organization' of two employees.
  • How would you extend the LCO system to support live mutations like adding or removing employees, re-parenting orgs, and changing org memberships while still answering queries efficiently?
  • What are the consistency guarantees your system provides between writes and LCO reads, and how do you handle concurrent mutations?
  • Given your expected query-to-update ratio, which data structure or architectural approach wins, and why?

“I jumped straight to the tree-based LCA solution and the interviewer let me finish before pointing out this is a DAG, not a tree.”

View Post

Atlassian·Software Engineer·Technical Phone Screen

Jun 2026
Atlassian software engineer interview with a tree-based algorithm problem. The question was well-scoped but they pushed on complexity analysis pretty hard afterward.
  • Given a company org chart represented as a tree (departments as internal nodes, employees as leaves), find the deepest department that contains two given employees. Analyze the time and space complexity of your solution.

“I went with a recursive approach pretty quickly, basically a lowest common ancestor problem on a tree.”

View Post

Atlassian·Software Engineer·Technical Phone Screen

Jun 2026
Atlassian technical phone screen that built on a previous org-tree problem, this time throwing in multi-membership to make things messier. The follow-up nature of it meant I felt like I was playing catch-up the whole time.
  • You have the org-tree LCA problem, but now an employee can belong to multiple organizations at once. Given two employees, find the deepest organization that contains both of them, accounting for all memberships. Walk through how the data structure changes, how you'd compute ancestor sets, and how you'd find the deepest common org. What's the time and space complexity?

“The multi-membership twist genuinely tripped me up at first.”

View Post

Atlassian·Software Engineer·Technical Phone Screen

Jun 2026
Atlassian technical phone screen that built on a previous org hierarchy problem, pushing it into DAG territory. The added complexity of multiple parent orgs made the LCA problem a lot messier than the tree version.
  • Given an organization structure that is a DAG (each org can have multiple parents), and two employees each belonging to one or more orgs, find the lowest common ancestor organization that contains both employees.

“The tree version of this problem feels pretty approachable but the DAG twist genuinely changes things.”

View Post

Atlassian·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Atlassian software engineer interview with a system design question focused on a content popularity tracker. Pretty classic design problem but the distributed scaling angle made it more interesting than I expected.
  • Design a system that tracks content popularity on a social media platform, supporting operations to increase a score, decrease a score, and retrieve the most popular content at any time. Walk through your data structure choices, time complexity trade-offs, and how you'd scale this across multiple servers.

“I went straight to a hash map plus a max-heap combo and felt pretty good about it until they pushed on the decrease operation.”

View Post

Atlassian·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Atlassian SWE interview that was basically one big OOD problem about a CI/CD release notification service. The question had enough moving parts that it felt more like a mini system design than a pure coding round, which I wasn't totally expecting.
  • Design an object-oriented model for a CI/CD release notification service. The service runs daily deployments and notifies each commit author when their change is successfully deployed. If a deployment fails and rolls forward to the next version, authors from the failed deployment must be carried over and included in the next version's notifications. Design the core classes (Deployment, Version, Author, Notifier), the rollover logic, and the notify() API.

“I started by sketching out the classes and immediately got tangled on the rollover part.”

View Post

Atlassian·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Atlassian system design round focused on load balancing for a collaborative document service. The question looked straightforward at first but kept unfolding into more edge cases than I expected.
  • You have a document-sharing platform where users can collaboratively edit and view docs. Requests go through a load balancer using round-robin. What breaks with this setup for this kind of workload?
  • Walk through how you'd fix each of those load balancing problems specifically for a collaborative editing service.

“I started with the obvious stuff like cache locality and uneven load, but the interviewer kept pushing and I realized I'd glossed over the WebSocket angle entirely.”

View Post

Atlassian·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Atlassian system design round for a software engineer role. The core problem was designing a data structure that handles four operations all in constant average time, which sounds manageable until you actually try to make getMaxKey and getMinKey work without scanning everything.
  • Design a data structure that supports inc(key), dec(key), getMaxKey(), and getMinKey() all in O(1) average time. Keys with a count of zero should be removed automatically.

“My first instinct was a heap and a hashmap, which is wrong the moment you think about dec() and removal.”

View Post

Atlassian·Software Engineer·Technical Phone Screen

Jun 2026
Atlassian software engineer interview with a pretty standard algorithmic question. Nothing too brutal, but also not a lot to go on in terms of what the full loop looks like.
  • Given two strings s and t, determine whether s is a subsequence of t.

“Two pointers, scan both strings once, done.”

View Post