Atlassian Principal Engineer Onsite Interview Experience (2025)

Candidate Profile *

Experience: 13 Years (B.Tech, CSE) *

Target Role: Principal Engineer (Remote) *

Company: Atlassian *

Date: September 2025 *

Outcome: Offer down-leveled to S

Candidate Profile *

Experience: 13 Years (B.Tech, CSE) *

Target Role: Principal Engineer (Remote) *

Company: Atlassian *

Date: September 2025 *

Outcome: Offer down-leveled to Senior (P50) due to Round 6; Offer

rejected.

**

Round 1 Telephonic Screening (30 mins)** *

Focus: Experience, concepts, and high-level design. *

Problem 1 (Coding Concept): Discuss the approach to implement an LRU (Least Recently Used) cache. No coding required. *

Problem 2 (System Design): Design a Google Doc-style collaborative editor. * Solution focus: Handling conflicts and utilizing WebSockets for real-time updates. *

Problem 3 (System Design): Design a file storage and search system where files are retrieved by name or content keywords. * Solution focus: Utilize object storage for file persistence and Elasticsearch for content-based indexing and retrieval.

**

Round 2 Values (45 mins)** *

Focus: Situational questions centered on Atlassian's core values.

**

Round 3 Leadership Craft (1 hour)** *

Focus: Behavioral questions based on past leadership experiences and scenarios.

**

Round 4 System Design (1 hour)** *

Problem: Design a web scraping system to extract image URLs from a provided list of domain URLs. *

Required API Endpoints: 1. POST /jobs: Accepts a list of URLs (e.g., ["abc.com", "amazon.com"]) and returns a job_id. 2. GET /jobs/{job_id}/status:

Returns the count of completed and in-progress tasks. 3. GET /jobs/{job_id}/results:

Returns a map of source URLs to the extracted image URLs.

**

Round 5 Code Design (1 hour)** *

Problem: Implement a logic for a "Cinema Hall Manager" to determine if a new movie fits into an existing schedule without overlaps. *

Constraints: * Cinema operates from 10:00 AM to 11:00 PM (single-day schedule). * Start and end times are represented as minutes from midnight. *

Task: Implement the function boolean canSchedule(Movie movie, MovieSchedule schedule). *

Input Data: * Movie: Title and duration in minutes. * Screenings: List of existing movies with titles and start times (minutes from midnight).

**

Round 6 Data Structures (1 hour)** *

Problem: Given an employee directory structured as a hierarchy of groups and departments. *

Task: Identify the closest parent group or department for a given set of target employees. * Example: In a tree structure, if looking for "Alice" and "Lisa,"

return their immediate shared group (e.g., "Engineering"). *

Algorithmic Concept: The problem maps to finding the Lowest Common Ancestor (LCA) in a tree structure.