Interview Experience | Backend | π₯π₯ | Atlassian
2026 (Oct) Senior Backend Software Engineer @ Atlassian β Sydney, NSW β 2 rounds | π Neutral | Hard
Round 1 β Code Design
Any language, must run, write your own tests. He said it's about how you split the code, requirements keep coming.
Confluence inline comments. add(id, parentId, ts, text), null parent = new thread. render() prints threads, replies by time, indented.
Part 1: dict of children. His data had a reply arriving before its parent, KeyError. Added a pending map, attach when the parent shows up.
Part 2: search(word): show the hit, its replies, and the parent chain above it. Two hits on one chain added the chain twice; set, then filter in render order.
Part 3: resolve / unresolve, unresolvedCount(id) over the subtree, no dfs per call. Subtree counter per node, walk up on change, O(depth).
Part 4: move(id, newParent). Reject moving under its own descendant: walk up from newParent. I subtracted from the old chain then added to the new one, but the node itself got subtracted too. Caught it by printing a count in a test.
Last: deep threads, frequent moves, wants log n count. Said euler tour + BIT, he asked what happens to the ranges after a move. Mentioned link-cut tree, didn't write it.
Round 2 β Data Structures
Jira status history: (issueId, start, end) In Progress spans. Reopened issues have several spans, never overlapping each other.
First: which issues were In Progress at some point in [t1, t2]. Scan.
Then only the count, many queries. Sorted starts and ends, binary search. His case came out too high: an issue with two spans in range counted twice.
Took a while. For consecutive spans (a, b) of one issue, both counted iff a.end >= t1 and b.start <= t2. Answer = spans minus such pairs, 2D dominance counting. Offline, t1 descending, BIT on b.start.
Part 3: k-th smallest issueId. Binary search on id, he asked if the BIT needs to be persistent. Said persistent segment tree, wrote insert, query unfinished.
Last: spans and queries both online. Just started, time's up.