Filter interviews by
Implement a class-based graph structure using OOP principles and basic DSA techniques.
Define a Graph class with methods to add vertices and edges.
Use an adjacency list to represent the graph for efficient traversal.
Implement methods for depth-first search (DFS) and breadth-first search (BFS).
Example: Adding a vertex 'A' and an edge from 'A' to 'B'.
Consider edge cases like adding duplicate edges or vertices.
Heap memory is a region of a computer's memory that is used for dynamic memory allocation.
Heap memory is allocated at runtime and can be accessed randomly.
It is used for storing objects and data structures that need to be dynamically allocated and deallocated.
Heap memory is managed by the programmer and not automatically by the system.
Examples of heap memory usage include creating objects in Java using the 'new' k...
Train a Decision Tree based on provided dataset.
Preprocess the dataset by handling missing values and encoding categorical variables.
Split the dataset into training and testing sets.
Train the Decision Tree model on the training set.
Evaluate the model's performance on the testing set using metrics like accuracy or F1 score.
Feature selection can be done using techniques like filter methods, wrapper methods, and embedded methods.
Filter methods involve selecting features based on statistical measures like correlation, chi-squared test, etc.
Wrapper methods use a specific machine learning algorithm to evaluate the importance of features through iterative selection.
Embedded methods incorporate feature selection within the model training p...
Snake game involves controlling a snake to eat food and grow in size without hitting walls or itself.
Create a grid system to represent the game board
Implement logic for snake movement and growth
Generate food randomly on the board for the snake to eat
Handle collision detection for walls and snake body
Keep track of score and game over conditions
Snake game is a classic arcade game where a player controls a snake to eat food and grow longer while avoiding collisions with walls and itself.
Create a grid-based game board where the snake can move in four directions (up, down, left, right)
Generate food randomly on the board for the snake to eat and grow in length
Implement collision detection to check if the snake hits the walls or itself
Update the game state co...
Design and implement a simple Snake game where the player controls a snake to eat food and grow while avoiding collisions.
Use a 2D grid to represent the game area.
Implement snake movement using arrow keys.
Generate food at random positions on the grid.
Increase snake length when it eats food.
End the game if the snake collides with itself or the wall.
To resolve a DNS query, you can use various methods such as checking the DNS cache, querying authoritative DNS servers, and troubleshooting network connectivity.
Check the local DNS cache for a matching entry
Query the recursive DNS server configured on the device
If the recursive server doesn't have the answer, it queries authoritative DNS servers
Troubleshoot network connectivity issues if DNS resolution fails
Binary search algorithm can be used to find the left and right index of an element in a sorted array.
Initialize left and right pointers to 0 and length-1 respectively.
While left <= right, calculate mid index and compare element with array[mid].
If element is found, update left and right pointers accordingly for left and right index.
If element is not found, adjust left or right pointer based on comparison with array...
DFS and BFS are fundamental graph traversal algorithms used to explore nodes in a graph.
DFS (Depth First Search) explores as far as possible along each branch before backtracking. It uses a stack to keep track of nodes.
BFS (Breadth First Search) explores all the neighbor nodes at the present depth prior to moving on to the nodes at the next depth. It uses a queue to keep track of nodes.
Example: For a graph with no...
I appeared for an interview in Jul 2025, where I was asked the following questions.
I applied via Company Website and was interviewed in Oct 2024. There were 3 interview rounds.
The internet is a global network connecting millions of private, public, academic, business, and government networks.
Data travels in packets: Information is broken into smaller packets for efficient transmission.
Protocols: TCP/IP governs how data is sent and received over the internet.
Routers and switches: Devices that direct data packets to their destination.
Web browsers: Applications like Chrome or Firefox that allow...
Salary negotiations involve discussing compensation to reach a mutually beneficial agreement between employer and employee.
Research industry standards: Know the average salary for your role in your region.
Highlight your skills: Emphasize unique skills or experiences that add value.
Be flexible: Consider benefits, bonuses, and work-life balance in addition to salary.
Practice your pitch: Prepare a clear and confident expl...
I appeared for an interview in May 2025, where I was asked the following questions.
I have extensive experience with Java, focusing on its versatility in web and mobile applications, as well as backend development.
Developed a web application using Spring Boot, enhancing user experience with RESTful APIs.
Utilized JavaFX for creating a desktop application, showcasing my skills in GUI development.
Implemented multithreading in a Java application to improve performance and responsiveness.
Worked with Java C...
I have gained experience in data engineering through various projects and self-study, focusing on data pipelines and ETL processes.
Completed a course on Apache Spark, learning to process large datasets efficiently.
Built a data pipeline using Apache Kafka to stream real-time data for analytics.
Worked on a project involving data warehousing with Amazon Redshift, optimizing query performance.
Utilized Python and SQL for da...
Coding test on hackerrank
Questions I got were:
- -----
- -----
- -----
Create a Python class to manage and track content popularity on a fictional platform.
Define a class 'Content' with attributes like 'title', 'views', and 'likes'.
Implement methods to increment views and likes, e.g., 'increment_views()' and 'increment_likes()'.
Add a method 'popularity_score()' that calculates a score based on views and likes.
Consider using a dictionary to store multiple content items and their popularity...
During a group project in college, our team faced unexpected technical issues that delayed our progress.
Our team was working on a group project in college when we encountered unexpected technical issues.
The issues caused delays in our progress and required us to come up with alternative solutions.
Despite the setbacks, we were able to troubleshoot the problems and successfully complete the project on time.
I applied via LinkedIn and was interviewed in Nov 2024. There were 3 interview rounds.
Challenges on Leetcode that are classified as hard and can be coded using an IDE along with test cases.
Low level design of parking lot
Design a scalable distributed system to handle high traffic and ensure reliability and performance.
Use microservices architecture for modularity and scalability.
Implement load balancing to distribute traffic evenly across servers.
Utilize a distributed database like Cassandra or MongoDB for data storage.
Incorporate caching mechanisms (e.g., Redis, Memcached) to reduce latency.
Design for fault tolerance with redundancy a...
DSA round leetcode style question
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
I appeared for an interview in Oct 2024.
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
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.
Karat Interview for next filtering the candidate
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.
Dsa+cp type 3 questions
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
In a team project, I faced a conflict that required effective communication and collaboration to resolve.
Identified the root cause of the conflict through open discussions.
Encouraged team members to express their viewpoints to foster understanding.
Proposed a compromise that incorporated elements from both sides.
Followed up with the team to ensure the solution was effective and everyone felt heard.
Design Snake game LLD
Top trending discussions
Some of the top questions asked at the Atlassian interview -
The duration of Atlassian interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 88 interview experiences
Difficulty level
Duration
based on 137 reviews
Rating in categories
Software Engineer
271
salaries
| ₹34.2 L/yr - ₹63.8 L/yr |
Senior Software Engineer
224
salaries
| ₹45 L/yr - ₹80 L/yr |
Software Developer
115
salaries
| ₹36.4 L/yr - ₹62.2 L/yr |
Data Engineer
102
salaries
| ₹27.5 L/yr - ₹45 L/yr |
Senior Data Engineer
101
salaries
| ₹13.9 L/yr - ₹67.1 L/yr |
Salesforce
Amazon
Oracle