Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Apple interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Apple
upvote
share-icon
4 rounds | 10 Coding problems

Interview preparation journey

expand-icon
Journey
Apple came for hiring in our college for the SDE role during our oncampus placement in month of novemeber.I applied it when notification came to our college for this job role though I had another offer in hand but I applied because of name of Apple and It contained one coding round along with 3 interviews after that.
Application story
Apple came for SDE hiring during our campus placement time in month of november in DTU, Where it was asked to apply both on portal of Apple for the job and on google form they circulated to all of the eligible candidates as it has around 8 gpa as filtering criterion.
Why selected/rejected for the role?
I got rejected as I believe they had to take only 1 Girl from our college as Apple had already hiried 10 candidates from DTU in earlier month for intern so may be they thought to give them PPO so only 1 girl selected as I was rejected in HR round.
Preparation
Duration: 10 months
Topics: DSA,Competitive,OOPS,DBMS,OS,System Design
Tip
Tip

Tip 1 : Be very focussed on solving some good problems each day, it will make your mind sharper
Tip 2 : Don't hopeless in interview as it only degrades your performance.
Tip 3 : DSA, atleast 1 good major projects are key for any SDE interview

Application process
Where: Campus
Eligibility: 8 gpa
Resume Tip
Resume tip

Tip 1: Only Mention those experiences and tech stacks that u own
Tip 2: Try to give good information about projects and make it berief so that it can fit in 1 page resume.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date17 Nov 2021
Coding problem2

It consisted of 9 mcqs and two coding problems

1. Gas Stations

Moderate
10m average time
90% success
0/80
Asked in companies
OlaFlipkartPhone Pe

You have been given a circular path. There are 'N' petrol pumps on this path that are numbered from 0 to N - 1 (Both inclusive). Each petrol pump has two values associated with it:

1)The amount of petrol that is available at this particular petrol pump.
2)The distance to reach the next petrol pump.

You are on a truck having an empty tank of infinite capacity. You can start the tour from any of the petrol pumps. Your task is to calculate the first petrol pump from where the truck will be able to complete the full circle or determine if it is impossible to do so.

You may assume that the truck will stop at every petrol pump and it will add the petrol from that pump to its tank. The truck will move one kilometre for each litre of petrol consumed.

Problem approach

It is greedy problem, so it was easy to solve by first calculating the sum of gas and sum of cost from all stations. and then I run a loop to check at any point if gas[i] < cost[i] with it's previous total too then we had to shift the index to i+1.

Try solving now

2. House Robber II

Moderate
15m average time
80% success
0/80
Asked in companies
GoogleIntuitMicrosoft

Mr. X is a professional robber planning to rob houses along a street. Each house has a certain amount of money hidden.


All houses along this street are arranged in a circle. That means the first house is the neighbour of the last one. Meanwhile, adjacent houses have a security system connected, and it will automatically contact the police if two adjacent houses are broken into on the same night.


You are given an array/list of non-negative integers 'ARR' representing the amount of money of each house. Your task is to return the maximum amount of money Mr. X can rob tonight without alerting the police.


Note:
It is possible for Mr. X to rob the same amount of money by looting two different sets of houses. Just print the maximum possible robbed amount, irrespective of sets of houses robbed.


For example:
(i) Given the input array arr[] = {2, 3, 2} the output will be 3 because Mr X cannot rob house 1 (money = 2) and then rob house 3 (money = 2), because they are adjacent houses. So, he’ll rob only house 2 (money = 3)

(ii) Given the input array arr[] = {1, 2, 3, 1} the output will be 4 because Mr X rob house 1 (money = 1) and then rob house 3 (money = 3).

(iii) Given the input array arr[] = {0} the output will be 0 because Mr. X has got nothing to rob.
Problem approach

It was done using DP on tree technique to save the answer by considering node and nonconsidering node at each node level for future.

Try solving now
02
Round
Hard
Video Call
Duration60 minutes
Interview date22 Nov 2021
Coding problem2

It consisted of 1 system design (LLD) question and 1 coding question along with some questions from my resume.

1. System Design

Inteviewer asked me to design car rental LowLevel Design.

Problem approach

Tip 1: Don't jump to make classes before clarifying all the requirements from interviewer.
Tip 2: Don't write full Working code if not asked as it only demands how u make relationships and understand the objects and their functionalities mainly.
Tip 3: Be calm and think wisely bottom up manner

2. DBMS Question

what is normalization, gave one example of whether it's in BCNF form or not.

Problem approach

Tip 1: Check delegantly start from 1st to top
Tip 2: listen interviewer carefully
Tip 3: have good grasp of these Questions on normalization

03
Round
Medium
Video Call
Duration30 minutes
Interview date22 Nov 2021
Coding problem2

It was managerial round he asked majorly on topics from my resume and one puzzle too.

1. Puzzle

2 eggs and 100 floors puzzle

Problem approach

Tip 1: think brute force first
Tip 2: Binary search was one of the approach
Tip 3: we start trying from 14'th floor. If Egg breaks on 14th floor
we one by one try remaining 13 floors, starting from 1st floor if egg doesn't break

2. DBMS Question

It was problem based on my project Social site and exam portal. He asked how can u make site scalable by choosing right database for your app and functionality about that project too.

Problem approach

Tip 1: start telling about your major project first and try to make him understand each thing.
 

04
Round
Easy
HR Round
Duration20 minutes
Interview date22 Nov 2021
Coding problem4

HR asked about some HR questions mainly.

1. Basic HR Question

Why you want to join this company?

Problem approach

Tip 1: U can tell about your future aim matching with that company.

2. Basic HR Question

What are your future plans.?

Problem approach

Tip 1: Don't tell that u might go for MS or masters.
 

3. Basic HR Question

Tell me something about Apple company u know.

Problem approach

Tip 1: u can research it on google. for it's upcoming products too.
 

4. Basic HR Question

How many questions u were able to solve in 1st coding round and what were the coding problems asking about can u give brief about that?

Problem approach

Tip 1: U must know what have u done correctly.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

How do you write a single-line comment in C++?

Choose another skill to practice
Start a Discussion
Similar interview experiences
company logo
SDE - 1
3 rounds | 4 problems
Interviewed by Apple
1857 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Apple
0 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Apple
1363 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
654 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
104644 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
49761 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
31029 views
6 comments
0 upvotes