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.
We will iterate over all possible days, which will be between 1 to 2*(sum of all K[i]). Let our current day be ‘currDay’. We will check if any valid distribution is possible for the current day.
If we had several days for some type of candies, let's use the last one, it is always not worse than some of the previous days. Then let's iterate over all days from 1 to ‘ansd’ and do the following:
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.
Approach: The idea here is to try every possible option and consider the minimum ans.
We have two possible options: either we use the i-th umbrella to cover people or not.
So, the recurrence for the above problem is:
minNumberOfUmbrellas(i, M) = min(minNumberOfUmbrellas(i - 1, M), 1+ minNumberOfUmbrellas(i, M - UMBRELLA[i])).
minNumberOfUmbrellas(i, M) represents the minimum number of umbrellas...
We can note that it is always optimal to distribute gifts to ‘K’ children who are adjacent to each other.
For example, if the position of children are [2, 4, 7] and K = 2, it is optimal to give gifts to children with positions 2 and 4. If the positions were to be [2, 5, 7], it is optimal to give gifts to children at positions 5 and 7. In general, if the positions are [p1, p2, p3] where p1 < p2 ...
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.
Who is your role model.
Tell me about yourself.
Tip 1 : try to be practical whenever claiming something
Tip 2 : try to be honest and disciplined with your answers
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.
If a number is a divisor of two or more elements then it can be the GCD of the pair formed using those elements.
In this method, we will iterate over all the elements in the array and find the divisors of every element. We will also maintain a count array where the index represents the divisor and the value at that index is the number of elements in the given array having this as a divisor.
After t...
First, we should know that the marker can’t be negative and also it will not be greater than the maximum number of fruits in a particular bucket because if this happens then Kevin are not able to eat any of these fruits.
Therefore, the marker must be in the range of 0 to a maximum number of fruits in a particular bucket. So, the idea is to first calculate the maximum number of fruits in any partic...
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.
What is expectation from this job?
What are your hobbies?
Some puzzles.
his puzzle usually seems like a tough one to answer, but solving it once makes one realize that the procedure was actually simple. If the candidate pulls out 2 red balls, he replaces them with a blue ball.
On the other hand, if he draws one red and one blue, it is replaced with a red one. This implies that the red ball would always be in odd numbers, whether the candidate removes 2 together, or removes 1 while adding 1....
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.
Top trending discussions
Easy Binary search and tree questions were asked
Binary search on rotated array involves finding a target element in a sorted array that has been rotated.
Find the pivot point where the array is rotated
Determine which half of the array the target element lies in
Perform binary search on the appropriate half of the array
ACID is a set of properties that guarantee database transactions are processed reliably.
ACID stands for Atomicity, Consistency, Isolation, Durability.
Atomicity ensures that all operations in a transaction are completed successfully or none at all.
Consistency ensures that the database remains in a consistent state before and after the transaction.
Isolation ensures that multiple transactions can be executed concurrently ...
posted on 25 Nov 2024
I applied via Walk-in and was interviewed in Oct 2024. There was 1 interview round.
Easy to medium questions
A software for managing inventory in a retail store
Create a user-friendly interface for adding, updating, and deleting products
Include features for tracking sales, restocking inventory, and generating reports
Implement barcode scanning functionality for quick product lookup
I was interviewed in Mar 2024.
Aptitude and dsa questions
Find all permutations of palindromes in an array of strings.
Iterate through each string in the array.
For each string, generate all possible permutations.
Check if each permutation is a palindrome.
Return the list of palindromic permutations.
Toggle a bit in a binary number
Convert the number to binary representation
Identify the bit position to toggle
Toggle the bit using bitwise XOR operator
Convert the modified binary number back to decimal
Swapping numbers using bit operators.
Use XOR operator to swap two numbers without using a temporary variable
XORing a number with itself results in 0
Example: a = 5, b = 7. a ^= b; b ^= a; a ^= b; // a = 7, b = 5
I applied via Company Website and was interviewed before Feb 2022. There were 3 interview rounds.
I want to work here because of the company's reputation, the opportunity for growth, and the chance to work on innovative projects.
Company's reputation: The company has a strong reputation in the industry for its high-quality software development work.
Opportunity for growth: I believe that working here will provide me with ample opportunities to learn and grow as a software developer.
Innovative projects: I am excited a...
I am a software development intern with a passion for coding and problem-solving.
Currently pursuing a degree in Computer Science
Proficient in programming languages such as Java, C++, and Python
Experience with web development frameworks like React and Angular
Completed several projects including a mobile app for task management
Strong problem-solving and analytical skills
I was interviewed in Nov 2021.
Round duration - 70 minutes
Round difficulty - Medium
It was held at 7:00 pm. STL functions were not allowed. But STL containers like queues were allowed. One question was easy-medium, one was medium and one was hard. Everyone got different sets of questions. Make sure you solve all the questions from Samsung online Test, as they tend to repeat. Only 2 sample test cases were visible and Other Test Cases were hidden.
A simple solution would be to store all the node values to the list/array by traversing the whole Binary Tree and the problem now is that given a list of non-negative integers, arrange them such that they form the largest number. To solve this problem, sort the array in descending order, but sorting the list/array does not work here.
The idea is to use any of the comparison-based sorting algorithms.
The brute force approach to find all the bridges in a given graph is to check for every edge if it is a bridge or not, by first not considering current edge is not in given graph and then checking if the vertices that it was connecting are still connected or not, using DFS(DepthFirst Search). Given below is an algorithm that will find all bridges in a graph.
Algorithm :
Round duration - 60 minutes
Round difficulty - Easy
The interviewer was very friendly. It started at 10:00 AM and lasted for 60 minutes. It was the only technical interview and NO HR interview was there. The video was kept on with screen sharing.
The main idea is to do the sum of digits until it becomes less than 10.
Algorithm:
O(1).
We are using constant space to solve this.
Time Complexity: OtherExplanation:O(log10(...
If 'N' = 4. You need to ...
O(N), where ‘N’ is the given number.
Considering the recursive stack space.
Time Complexity: O(1)Explanation:O(N), where ‘N’ is...
class A{ int n; public : void fun(A *a){ if(n == a->n){ cout << "Both val...
I said No. But the answer to this question is Yes this code is will compile.
He was trying to ask that if a data member is private then if you declare 2 objects(let's say o1,o2) for that class. Then can you access the data member of a second object using the first object?
Tip 1 : Never mention anything in RESUME in which you're not confident
Tip 2 : For on-campus opportunities try to maintain a good CGPA. Try to maintain at least 7.5 CGPA
Tip 3 : While practicing questions please make sure you make notes if them, it will be mostly required if your interview is scheduled in 1-2 days.
Tip 4 : Never submit questions just for the sake of increasing the count on problems solved. Try to think of one problem from a different perspective.
Tip 5 : Please give timed contests it will be helpful in clearing ONLINE TESTS. Please note Interviews are easier than Online Tests and mostly standard questions are asked.
Tip 1 : Mention only those things you feel confident
Tip 2 : If you're DSA heavy mention ranking if any, the number of problems solved. And if you're development heavy include projects and 2-3 lines about each project.
posted on 15 Nov 2024
3h test with 1question
based on 1 review
Rating in categories
Software Engineer
169
salaries
| ₹16 L/yr - ₹61 L/yr |
Sales Executive
106
salaries
| ₹1.6 L/yr - ₹5 L/yr |
Ipro
105
salaries
| ₹2 L/yr - ₹4.6 L/yr |
Software Developer
77
salaries
| ₹11.1 L/yr - ₹46.6 L/yr |
Senior Software Engineer
65
salaries
| ₹14.8 L/yr - ₹63 L/yr |
Amazon
Microsoft Corporation
Samsung