Atlassian Interview Experience | Karat Screening
- Posted
- 19 Mar 2025
Summary
I recently had a Karat screening interview for an Atlassian position, which involved solving two algorithmic challenges: one about finding words with specific letters from a dictionary and another about using DFS in a 2D array.
How it went
My interview experience began with a Karat screening for an Atlassian role. The session focused purely on algorithmic problem-solving. I was presented with two distinct coding problems. The first involved searching through a dictionary to identify words that encompassed all the letters of a given target word. The second challenge required me to implement a Depth-First Search (DFS) algorithm on a 2D array to locate specific target coordinates, and I only needed to provide one valid output.
Questions asked (2)
- 01
Find Word with All Target Letters
Data Structures & Algorithms
Given a dictionary of words and a target word, find a word present in the dictionary that contains all letters present in the target word. The order of letters does not matter, and duplicate letters in the target only need to be covered once in the dictionary word.
- 02
DFS on 2D Array to Find Target Coordinates
Data Structures & Algorithms
This was a Depth-First Search (DFS) based question. Given a 2D array and a target value, find and return one possible set of coordinates (row, column) where the target value is located within the array, using a DFS approach.