i
Apple
Filter interviews by
I was interviewed in May 2021.
Round duration - 45 minutes
Round difficulty - Medium
This round was scheduled in the morning hours from 10:30 to 11:15 AM. I was informed about the round 2 days earlier through an e-mail and a phone call both.
Ninja, a boy from Ninjaland, receives 1 coin every morning from his mother. He wants to purchase exactly 'N' candies. Each candy usually costs 2 coins, but it is available for 1 ...
Calculate the earliest day on which Ninja can buy all candies given the number of candy types, special offers, and Ninja's candy preferences.
Iterate through each day and check if any special offers are available for the candies Ninja wants to buy.
Keep track of the remaining candies Ninja needs to buy and the coins he has each day.
Consider both regular price and sale price while making purchases.
Return the earliest day
Round duration - 45 minutes
Round difficulty - Hard
After the first round, some candidates were shortlisted and I was one of them which was scheduled 2 days later at the same time.
You are provided with ‘N’ types of umbrellas, where each umbrella type can shelter a certain number of people. Given an array UMBRELLA
that indicates the number of people each um...
Given 'N' types of umbrellas with different capacities, find the minimum number of umbrellas required to shelter exactly 'M' people.
Iterate through the umbrella capacities and try to cover 'M' people using the minimum number of umbrellas.
Keep track of the total number of people covered and the number of umbrellas used.
If it is not possible to cover 'M' people exactly, return -1.
Return the minimum number of umbrellas re
It's Christmas and Santa has 'K' gifts to distribute. There are 'N' children standing in a straight line in the park due to COVID restrictions. You are given an array distance
...
Find the minimum distance Santa must travel to distribute 'K' gifts to 'K' different children standing in a straight line.
Sort the array 'distance' to easily calculate the minimum distance Santa has to walk.
Calculate the difference between adjacent elements in the sorted array and sum the first 'K-1' differences to get the minimum distance.
Return the minimum distance Santa has to walk for each test case.
Round duration - 30 minutes
Round difficulty - Medium
It was a simple conversation, no shortlisting was done here, all of the students who passed the previous round were offered the role.
Tip 1 : Aptitude is must.
Tip 2 : Practice puzzle problems.
Tip 3 : Do atleast 2 projects.
Tip 1 : projects should be well mentioned
Tip 2 : also don't forget to mention your grades of all academic levels
I was interviewed in Mar 2021.
Round duration - 45 minutes
Round difficulty - Hard
Interview was conducted at zoom in the evening hours.
Given an array of positive integers, determine the Greatest Common Divisor (GCD) of a pair of elements such that it is the maximum among all possible pairs in the array. The...
Find the maximum GCD of a pair of elements in an array of positive integers.
Iterate through all pairs of elements in the array to find their GCD.
Keep track of the maximum GCD found so far.
Use Euclidean algorithm to calculate GCD efficiently.
Return the maximum GCD value found.
Kevin has 'N' buckets, each consisting of a certain number of fruits. Kevin wants to eat at least 'M' fruits. He is looking to set a marker as high as possible such ...
Find the marker value needed for Kevin to eat at least 'M' fruits from 'N' buckets.
Iterate through each test case and calculate the marker value needed based on the number of fruits in each bucket.
Subtract the marker value from the number of fruits in each bucket and check if the total is at least 'M'.
Return the highest possible marker value for each test case.
Round duration - 30 minutes
Round difficulty - Medium
This round was scheduled in the morning hours from 10:30 to 11 am. The interviewer was cool-minded and I really enjoyed talking to him.
Tip 1 : Data structures and algorithms are the most fundamental and important thing to prepare.
Tip 2 : Don't ignore OOPS.
Tip 3 : Solve DSA questions regularly.
Tip 1 : Avoid unnecessary details like hobbies, date of birth, parent's name, photo, etc., and keep it one-pager.
Tip 2 : Add a link to your GitHub, LinkedIn, website, phone number, etc.
posted on 15 Nov 2020
An operating system is a software that manages computer hardware and software resources and provides common services for computer programs.
Manages computer hardware and software resources
Provides common services for computer programs
Examples: Windows, macOS, Linux, Android, iOS
Kernel is the core component of an operating system
To follow the company policy, one must understand and familiarize themselves with the policy guidelines and procedures.
Read and thoroughly understand the company policy documentation
Adhere to the policies and procedures outlined in the documentation
Seek clarification from supervisors or HR if any doubts or questions arise
Regularly review and stay updated with any changes or updates to the policy
Ensure compliance with t...
No, I cannot agree to work with no time limit.
Working without a time limit can lead to burnout and decreased productivity.
Having a reasonable work-life balance is important for overall well-being.
Setting clear boundaries and having a structured schedule can help maintain productivity and prevent overworking.
I applied via Naukri.com and was interviewed in Jan 2023. There were 4 interview rounds.
Data structures, linq and .net core related questions
I was interviewed before Oct 2022.
It was open coding contest called Ode 2 Code organised on hackerearth. Top 100 students got interview calls
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half, and then merges the sorted halves.
Divide the array into two halves
Recursively sort each half
Merge the sorted halves back together
I applied via Naukri.com and was interviewed before Jul 2023. There were 2 interview rounds.
Aptitude duration One hours
Level moderate
Coding Test Duration 3 hours
Level moderate to hard
I was interviewed before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
This was MCQ+Coding round.
Check if two strings are anagrams by comparing the sorted versions of the strings.
Sort both strings and compare if they are equal.
Use a hashmap to store the frequency of characters in each string and compare the maps.
Ignore spaces and punctuation when comparing the strings.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.
Add projects and Internships if you have done any and add only those things which you really know.
Final outcome of the interviewSelectedI was interviewed before Sep 2020.
Round duration - 90 Minutes
Round difficulty - Medium
Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.
You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...
Detect cycle in a directed graph using depth-first search (DFS) algorithm.
Use DFS to traverse the graph and detect back edges indicating a cycle.
Maintain a visited array to keep track of visited nodes during traversal.
If a node is visited again during traversal and it is not the parent node, then a cycle exists.
Return true if a cycle is detected, false otherwise.
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
You are given a number in string format, a...
Find the next smallest palindrome greater than a given number represented as a string.
Convert the string to an integer, find the next greater palindrome, and convert it back to a string.
Handle cases where the number is a palindrome or has all digits as '9'.
Consider both odd and even length numbers when finding the next palindrome.
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 11:00 am. Interview went well.
Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.
The first line ...
Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.
Traverse the left boundary nodes in a top-down manner
Traverse the leaf nodes from left to right
Traverse the right boundary nodes in a bottom-up manner
Handle cases where duplicates occur in the boundary nodes
Implement the function without printing as printing is already managed
Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's. Learn them by heart.
Tip 2 : For Web.Development Try to learn full stack development. See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers. By doing this 1-2 projects will increase and cover all the major things which one should learn in their career/college.
Tip 1 : Always try to make it a single page
Tip 2 : Always make resume company specific. eg. Data Structures part more if you are applying for MNC's eg. Amazon, Google, DE Shaw, browserstack.
based on 1 review
Rating in categories
Software Engineer
166
salaries
| ₹0 L/yr - ₹0 L/yr |
Ipro
107
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
103
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
94
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
74
salaries
| ₹0 L/yr - ₹0 L/yr |
Amazon
Microsoft Corporation
Samsung