Filter interviews by
I applied via Referral and was interviewed in Jan 2024. There were 2 interview rounds.
Karet Interview :
5 back to back System design question, we don't need to explain each component but more like list as many as points. Need to finish all the question in 15min
1-2 problem solving question : It's not fency algorithm round with tough question. But true problem solving round using basic knowledge such as hashmap, heap
Design a file system to calculate total size and find top k collections in size.
Create a file system class with methods to add files and calculate total size.
Maintain a data structure to store the collections and their sizes.
Implement a method to find the top k collections based on size.
Consider using a priority queue or sorting the collections based on size.
Handle edge cases like empty collections or invalid input siz
Calculate the total size of an array of strings.
Iterate through the array and sum the length of each string.
Use the `length` property of each string to get its size.
Handle edge cases such as empty strings or null values.
The question is asking to find the top k collections.
Use a sorting algorithm to sort the collections in descending order based on a specific criteria.
Select the top k collections from the sorted list.
Return the selected collections as an array of strings.
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java, Python, and web development technologies
Strong problem-solving skills
Team player with excellent communication skills
I was motivated to move to this role because of my passion for coding and desire to work on challenging projects.
Passion for coding and technology
Desire to work on challenging projects
Opportunity for growth and learning
Interest in the company's products or services
Medium - Hard DSA Problem they ask
I applied via Referral and was interviewed before May 2023. There were 2 interview rounds.
They asked 3 easy medium leetcode coding questions
Atlassian interview questions for designations
I was interviewed before Sep 2020.
Round duration - 75 minutes
Round difficulty - Hard
Coding Test with 3 problems. 1 Easy , 1 Medium , 1 Very Hard
You are provided with a list of jobs, where each job has a specific deadline and profit. The goal is to schedule these jobs such that the total profit is maximized. Each job require...
Given a binary tree with N
nodes, your task is to output the Spiral Order traversal of the binary tree.
The input consists of a single line containing elem...
Goku has ‘N’ Dragon Balls, where each Dragon Ball is unique. The ith Dragon Ball has ‘i’ stars on it, meaning the first Dragon Ball has 1 star, the second ...
Round duration - 60 minutes
Round difficulty - Hard
In depth questions on Subjects like OOP , DBMS , OS , Javascript.
Round duration - 40 minutes
Round difficulty - Hard
Questions on my resume, projects, internship done. Interviewer was a bit harsh on me.
Tip 1 : Never leave any topic from any chapter / Subject
Tip 2 : Learn to explain your thoughts well
Tip 3 : Learn from previous experiences / interviews / problems asked.
Tip 4 : Atleast 4 projects in Resume
Tip 1 : Atleast 4 projects on Resume
Tip 2 : Do not write false things. You always get caught. Be genuine.
Get interview-ready with Top Atlassian Interview Questions
I was interviewed before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
Timing: 90 mins
Environment: Online coding round
No of questions: 3 Questions(225 marks) were asked.
You are provided with an array of integers. The task is to sort the array in ascending order using the quick sort algorithm.
Quick sort is a divide-and-conquer algorithm. It ...
You are given an encrypted string where repeated substrings are represented by the substring followed by its count. Your task is to find the K'th character of the d...
You have 'N' jobs, each with a start time, end time, and profit. Your task is to identify the maximum profit that can be earned by scheduling these jobs such that...
Round duration - 45 minutes
Round difficulty - Medium
Timing: evening
Environment: Virtual(remote)
Activity:
It was a resume screening + DSA round . There were 2 interviewers in this round. Initially , a brief introduction was given by them & later , they started with projects listed in my resume . They first asked me to explain about the projects , asked some questions related to its implementation & its actual use case in real world (where it can be used) .Later , they switched to DSA part , a total of 2 questions of easy medium difficulty level were asked . I only remember 1 question that was similar to Minimum platform problem.
After this , They asked me for favourite subjects. I said Operation Systems . Then , they asked for some concepts in OS , including CPU scheduling & its algos like Round robin , SJF etc and later asked which type of scheduling algorithm is used to design actual systems .
Your task is to determine the minimum number of platforms required at a railway station so that no train has to wait.
Given two arrays:
AT
- represent...Round duration - 50 minutes
Round difficulty - Medium
It was System design round.Though , it also started with a brief introduction & later , asked about projects . As my project was related to test classification . In that context , they asked me to design a low level Suggestion system(In any preferred language) .
You are provided with a list of strings, DICTIONARY[]
, representing the correct spellings of words, and a query string QUERY
that may contain misspelled words. Your task is...
Tip 1 : Practice a lot of problems from leetcode/coding ninjas or some other platform.
Tip 2 : Participate in daily contests on codeforces, leetcode, kickstart, etc.
Tip 3 : Include new topics while learning/solving Data structures problems like tries, BIT, etc.
Tip 1 : Mention your competitve programming skills and profiles in resume if possible.
Tip 2 : While mentioning things in resume: mention by numbers.
Tip 3 : Make a neet resume in some standard format(maybe by using LaTeX)
Tip 4 : Have atleast 2 projects(on which you are confident) in resume
Tip 5 : Don't put false positive on resume.
I applied via Campus Placement
Question related to operating system and computer network
Traverse all child nodes in a tree data structure
Use depth-first or breadth-first traversal algorithms
Recursively visit each child node starting from the root node
Consider using a stack or queue data structure for traversal
Example: Traverse all nodes in a binary tree
Written coding test
Basic coding questions
Only c c++
Easy level
I applied via Campus Placement and was interviewed in Oct 2024. There were 3 interview rounds.
In first round 4 coding question like 1 dsa 2 database and one is api and question is very simple . coding round was conducted in hackerrank
Again same but dsa question and oops concept in deep level
I applied via Campus Placement and was interviewed in Oct 2024. There was 1 interview round.
based on 6 interviews
1 Interview rounds
based on 9 reviews
Rating in categories
Software Engineer
166
salaries
| ₹16.5 L/yr - ₹43.6 L/yr |
Senior Software Engineer
109
salaries
| ₹21.7 L/yr - ₹85 L/yr |
Software Developer
105
salaries
| ₹20 L/yr - ₹85 L/yr |
Sde1
55
salaries
| ₹26 L/yr - ₹86 L/yr |
Software Development Engineer II
37
salaries
| ₹27.2 L/yr - ₹93 L/yr |
Salesforce
Amazon
Freshworks