AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Apple
Compare
Filter interviews by
Apple Software Development Engineer Intern Interview Questions and Answers
Apple Software Development Engineer Intern Interview Experiences
1 interview found
Anonymous
There were 2 coding questions
(2 Questions)
- Q1. No of islands(graph)
- Ans.
Count the number of islands in a graph
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the graph
Mark visited nodes to avoid revisiting them
Each connected component represents an island
- Q2. Topological Sort
Skills evaluated in this interview
Interview questions from similar companies
Ayush Gupta
(2 Questions)
- Q1. Java Full stack Experience based discussion
- Q2. Docker, Kubernetes etc.
(2 Questions)
- Q1. Coding in Java, oops collection problem solving
- Q2. Sql salary related questions
(1 Question)
- Q1. Manager and behavior
(1 Question)
- Q1. Salary kitna loge bhai
Interview Preparation Tips
Software Engineer Interview Questions & Answers
Lenovo
Nitin The Living Magnet
posted on 15 Nov 2020
Interview Questionnaire
3 Questions
- Q1. What is operating system.
- Ans.
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
- Q2. How to follow the company policy?
- Ans.
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...
- Q3. Will you agree to work no time limit?
- Ans.
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.
Skills evaluated in this interview
Selected
I applied via Naukri.com and was interviewed in Jan 2023. There were 4 interview rounds.
Data structures, linq and .net core related questions
(1 Question)
- Q1. Angular and .net core related questions
(1 Question)
- Q1. About salary discussion
Vishal R
(2 Questions)
- Q1. Simple question on the datatypes, DSA,
- Q2. Basic full stack questions
Selected
I was interviewed before Oct 2022.
It was open coding contest called Ode 2 Code organised on hackerearth. Top 100 students got interview calls
(3 Questions)
- Q1. This was a 1:1 online technical interview.
- Q2. Basic question on web development, regarding projects in resume. 1 problem solving question and DSA basics
- Q3. I was asked to explain merge sort
- Ans.
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
Interview Preparation Tips
- Web Development
- Data Structures
- Algorithms
- Computer science
Skills evaluated in this interview
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.
(1 Question)
Round duration - 90 minutes
Round difficulty - Easy
This was MCQ+Coding round.
- Q1. How can you check if two strings are anagrams of each other?
- Ans.
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.
Interview Preparation Tips
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 interviewSelectedSkills evaluated in this interview
I was interviewed before Sep 2020.
(1 Question)
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.
- Q1.
Detect Cycle in a Directed Graph
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...
- Ans.
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.
(1 Question)
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
- Q1.
Next Smallest Palindrome Problem Statement
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
Explanation:
You are given a number in string format, a...
- Ans.
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.
(1 Question)
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 11:00 am. Interview went well.
- Q1.
Boundary Traversal of a Binary Tree
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.
Input:
The first line ... - Ans.
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
Interview Preparation Tips
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.
Skills evaluated in this interview
SAMKIT JAIN
I was interviewed in Aug 2017.
Interview Questionnaire
7 Questions
- Q1. Implement Merge Sort.
- Ans.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
- Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
- Ans.
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
- Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
- Ans.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
- Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
- Ans.
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
- Q5. Implement AVL Tree.
- Ans.
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
- Q6. Minimum number of squares whose sum equals to given number n.
- Ans.
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
- Q7. Insertion sort for a singly linked list.
- Ans.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
Interview Preparation Tips
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22
Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.
Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.
College Name: The LNM Institute Of Information Technology, Jaipur
Skills evaluated in this interview
Apple Interview FAQs
Tell us how to improve this page.
Apple Interviews By Designations
- Apple Software Engineer Interview Questions
- Apple Software Developer Interview Questions
- Apple Analyst Interview Questions
- Apple Senior Sdet Engineer Interview Questions
- Apple Data Scientist Interview Questions
- Apple Software Engineer Intern Interview Questions
- Apple Salesman Interview Questions
- Apple Intern Interview Questions
- Show more
Apple Software Development Engineer Intern Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
Fast track your campus placements
|
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
- Home >
- Interviews >
- Apple Interview Questions >
- Apple Software Development Engineer Intern Interview Questions
