Atlassian Interview Questions and Answers

DSA round leetcode style question

Q1. Design + Coding round for rate limiter
Ans. 
Rate limiter design using token bucket algorithm
• Use token bucket algorithm to limit the rate of requests

• Maintain a bucket with tokens that get refilled at a constant rate

• Each request consumes a token from the bucket, rejecting requests when no tokens are available
Answered by AI
Add your answer

Q1. File system implementation question
Add your answer
Q2. Implement method which returns total usage
Ans. 
Implement a method to return total usage
• Create a method that calculates the total usage by summing up individual usage values

• Ensure the method can handle different types of usage data (e.g. integers, floats)

• Consider implementing error handling for invalid input data

• Test the method with sample data to verify its accuracy
Answered by AI
Add your answer
Q3. A file will have special tag call container , list all the k container with max usgae
Ans. 
List all containers with max usage of the special tag 'container'.
• Identify all containers with the special tag 'container'.

• Calculate the usage of each container.

• Find the container(s) with the maximum usage.
Answered by AI
Add your answer

Karat Interview for next filtering the candidate

Q1. Design Snake Game (Nokia based)
Ans. 
Design a classic Snake game based on Nokia phones.
• Use a 2D array to represent the game board.

• Implement logic for snake movement and growth.

• Include collision detection with walls and itself.

• Add food items for the snake to eat and grow.

• Display the game on a grid-based interface.
Answered by AI
Add your answer
Q2. Ballot based voter
Add your answer

Dsa+cp type 3 questions

Q1. Dsa type with follow up like dp
Ans. 
Dynamic Programming is a common type of problem in Data Structures and Algorithms.
• DP is a method for solving complex problems by breaking them down into simpler subproblems

• It involves storing the results of subproblems to avoid redundant calculations

• Examples of DP problems include Fibonacci sequence, Longest Common Subsequence, and Knapsack problem
Answered by AI
Add your answer

Q1. Scenario based hr question
Add your answer

Design Snake game LLD

3 medium dsa questions on Hackerrank

Q1. Class based graph question of easy level implementation of oops and dsa
Add your answer

Q1. Many situational questions about projects.
Add your answer

Design a rate limiter api