Premium Employer

i

This company page is being actively managed by Apple Team. If you also belong to the team, you can get access from here

Apple Verified Tick Work with us arrow

Compare button icon Compare button icon Compare

Filter interviews by

Apple Software Development Engineer Test Interview Questions and Answers

Updated 31 May 2022

Apple Software Development Engineer Test Interview Experiences

2 interviews found

Round 1 - Technical 

(8 Questions)

  • Q1. 1. Optimised algorithm to find given number in 2D array
  • Ans. 

    Optimised algorithm to find given number in 2D array

    • Use binary search for each row to find the number

    • Start from top-right or bottom-left corner for faster search

    • Divide and conquer approach can also be used

  • Answered by AI
  • Q2. 2. Write a code to return list of tuples where sum of tuple elements should be equal to given sum Ex: L = [1,2,3,4,5] S= 5 O/p [(2,3),(1,4)]
  • Ans. 

    Code to return list of tuples with elements summing up to given sum

    • Iterate through the list and check for pairs of elements whose sum equals the given sum

    • Add the pairs to a list of tuples and return the list

    • Use a nested loop to compare each element with all other elements in the list

  • Answered by AI
  • Q3. 3.write a code for balancing paranthesis
  • Ans. 

    Code to check if given string of parentheses is balanced or not.

    • Use a stack to keep track of opening parentheses

    • If a closing parenthesis is encountered, check if the top of stack is its corresponding opening parenthesis

    • If stack is empty or top of stack is not the corresponding opening parenthesis, return false

    • If all parentheses are balanced, return true

  • Answered by AI
  • Q4. 4. Testing tools related questions
  • Q5. 5. Git related questions
  • Q6. 6. Programming language (Python) related questions
  • Q7. 7. Testing related questions
  • Q8. 8. Situational based questions while working in Team

Interview Preparation Tips

Interview preparation tips for other job seekers - Should have good knowledge on your previous projects & tools and technologies

Should familiar in problem solving and coding

Skills evaluated in this interview

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 
Round 3 - Coding Test 
Round 4 - Coding Test 
Round 5 - Case Study 
Round 6 - Case Study 
Round 7 - HR 

(1 Question)

  • Q1. Salary discussion and other informations

Interview Preparation Tips

Interview preparation tips for other job seekers - N/A

Software Development Engineer Test Interview Questions Asked at Other Companies

Q1. Tell me about yourself What is Software What is Framework What ar ... read more
asked in Apple
Q2. Write code to return a list of tuples from a given list, where th ... read more
Q3. What is the main difference between a computer program and comput ... read more
asked in Cyware
Q4. Write a program to calculate the sum of digits of a number repeat ... read more
asked in Apple
Q5. Given a 2D array, what is an optimized algorithm to find a given ... read more

Top trending discussions

View All
Interview Tips & Stories
1w (edited)
a team lead
Why are women still asked such personal questions in interview?
I recently went for an interview… and honestly, m still trying to process what just happened. Instead of being asked about my skills, experience, or how I could add value to the company… the questions took a totally unexpected turn. The interviewer started asking things like When are you getting married? Are you engaged? And m sure, if I had said I was married, the next question would’ve been How long have you been married? What does my personal life have to do with the job m applying for? This is where I felt the gender discrimination hit hard. These types of questions are so casually thrown at women during interviews but are they ever asked to men? No one asks male candidates if they’re planning a wedding or how old their kids are. So why is it okay to ask women? Can we please stop normalising this kind of behaviour in interviews? Our careers shouldn’t be judged by our relationship status. Period.
Got a question about Apple?
Ask anonymously on communities.

Interview questions from similar companies

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 180 Minutes
Round difficulty - Medium

Round was held in the morning at 10 am.

  • Q1. 

    M - Coloring Problem Statement

    Given an undirected graph with 'N' nodes in the form of an adjacency matrix and an integer 'M', determine if it is possible to color the vertices of the graph using at most ...

  • Ans. 

    The problem involves determining if a given graph can be colored with at most 'M' colors without adjacent vertices sharing the same color.

    • Create a function that takes the adjacency matrix, number of nodes 'N', and maximum number of colors 'M' as input.

    • Implement a graph coloring algorithm such as backtracking or greedy coloring to check if the graph can be colored with at most 'M' colors.

    • Check if adjacent vertices have ...

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 40 Minutes
Round difficulty - Medium

The round was held in the evening

  • Q1. 

    Trie Data Structure Implementation

    Design and implement a Trie (prefix tree) to perform the following operations:

    • insert(word): Add a string "word" to the Trie.
    • search(word): Verify if the string "w...
  • Ans. 

    Implement a Trie data structure to insert, search, and check for prefixes in strings.

    • Create a TrieNode class with children and isEndOfWord attributes.

    • Implement insert, search, and startsWith methods in the Trie class.

    • Use a Trie to efficiently store and search for strings based on prefixes.

    • Example: insert 'apple', search 'apple' returns true, startsWith 'app' returns true, search 'app' returns false.

  • Answered by AI
Round 3 - HR 

Round duration - 10 Minutes
Round difficulty - Easy

Was held in the morning around 9 am

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from TIET - Thapar Institute of Engineering And Technology. I applied for the job as SDE - 1 in NoidaEligibility criteriaAbove 7 CGPASamsung interview preparation:Topics to prepare for the interview - OOPS, Algorithms, Operating System, DBMS, Data StructuresTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Focus on graphs, most questions are from this topic
Tip 2 : Prepare well about the projects you mention in your resume
Tip 3 : Do not fill the resume with too many things. Keep it simple

Application resume tips for other job seekers

Tip 1 : Have 2-3 projects on resume. But also be prepared to answer questions related to the projects.
Tip 2 : Do not mention too many things. Keep it short and simple

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 Minutes
Round difficulty - Medium

The round had 2 coding problems to solve with varying difficulty. Each candidate had a different set of questions. The round was around 2 pm. The webcam was turned on to keep an eye on candidates.

  • Q1. 

    Bursting Balloons Problem

    Given an array ARR of size N, where each element represents the height of a balloon. The task is to destroy all balloons by shooting arrows from left to right. When an arrow hits...

  • Q2. 

    Count Leaf Nodes in a Binary Tree

    Count the number of leaf nodes present in a given binary tree. A binary tree is a data structure where each node has at most two children, known as the left child and the...

Round 2 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 questions related to DSA. I was first asked to explain my approach with proper complexity analysis and then code the soution in any IDE that I prefer.

  • Q1. 

    Rod Cutting Problem Statement

    Given a rod of a certain length, the rod can be divided into different sizes, each with an associated cost. Your task is to determine the maximum cost that can be obtained by...

  • Ans. 

    The Rod Cutting Problem involves maximizing the profit obtained by cutting a rod into smaller pieces and selling them.

    • Use dynamic programming to solve this problem efficiently.

    • Create a table to store the maximum profit for each sub-length of the rod.

    • Iterate through the rod lengths and update the table with the maximum profit.

    • The final answer will be the maximum profit for the total length of the rod.

  • Answered by AI
  • Q2. 

    Count Subarrays with Given XOR Problem Statement

    You are given an array of integers ARR and an integer X. Your task is to determine the number of subarrays of ARR whose bitwise XOR is equal to X.

    Example...

Round 3 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 questions of DSA of Easy-Medium difficulty and at the end I was asked a Puzzle to check my general problem solving ability.

  • Q1. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Q2. 

    Detect and Remove Loop in Linked List

    For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.

    Expected Complexity:

    A...

  • Q3. You have two wires of different lengths that are both capable of burning for exactly one hour when ignited at both ends. How can you measure a time interval of 45 minutes using these two wires?
Round 4 - Face to Face 

(4 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This round had 2 Algorithmic questions wherein I was supposed to code both the problems after discussing their
approaches and respective time and space complexities . After that , I was grilled on some OOPS concepts related to C++.

  • Q1. 

    Longest Palindromic Substring Problem Statement

    You are provided with a string STR of length N. The task is to find the longest palindromic substring within STR. If there are several palindromic substring...

  • Q2. 

    Quick Sort Problem Statement

    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 ...

  • Q3. What are friend functions in C++?
  • Ans. 

    Friend functions in C++ are functions that are not members of a class but have access to its private and protected members.

    • Friend functions are declared inside a class with the keyword 'friend'.

    • They can access private and protected members of the class.

    • They are not member functions of the class, but have the same access rights as member functions.

    • Friend functions are useful for implementing operators that are not part ...

  • Answered by AI
  • Q4. What is the difference between Early Binding and Late Binding in C++?
  • Ans. 

    Early binding is resolved at compile time while late binding is resolved at runtime in C++.

    • Early binding is also known as static binding, where the function call is resolved at compile time based on the type of the object.

    • Late binding is also known as dynamic binding, where the function call is resolved at runtime based on the actual type of the object.

    • Early binding is faster as the function call is directly linked to ...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPASamsung interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

Round duration - 60 minutes
Round difficulty - Easy

This was coding round and was conducted on Cocubes platform. It is not IDE but kind of white board coding platform. C/C++, Java and Python were only allowed languages.

Round 2 - Coding Test 

Round duration - 30 minutes
Round difficulty - Easy

This was pen and paper round. Total 40 shortlisted candidates were grouped into 8 groups (each of 5). Each group was given a coding question which they have to solve on paper and explain it to the recruiter. 2 to 3 from each group were selected for the next round.

Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

This was general face to face Data Structures and Algorithms based round.

  • Q1. How do you perform a spiral order traversal of a binary tree? Please provide an explanation or code to print the binary tree in spiral order.
  • Ans. 

    Spiral order traversal of a binary tree involves printing nodes level by level alternating between left to right and right to left.

    • Start by pushing the root node into a queue.

    • While the queue is not empty, pop a node, print its value, and push its children into the queue.

    • For each level, alternate between printing nodes from left to right and right to left.

    • Repeat until all nodes are printed in spiral order.

  • Answered by AI
Round 4 - HR 

Round duration - 45 minutes
Round difficulty - Easy

It was the last round.

Interview Preparation Tips

Professional and academic backgroundI completed Electronics & Communication Engineering from Veermata Jijabai Technological Institute. I applied for the job as SDE - 1 in UlhasnagarEligibility criteriaCGPA above 7.5 Samsung interview preparation:Topics to prepare for the interview - Only Data Structures and Algorithms.Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Be real during the interview and don’t show off. Also, practice Data Structures and Algorithms based problems as only through practice you will be able to solve questions quickly during the interview. Also prepare for theory subjects like Object-Oriented Programming System, Database Management System, Computer networks, etc.

Application resume tips for other job seekers

Keep your resume simple. Prefer LaTeX. Don't use colourful templates. They are too common and very unprofessional. Keep it black and white and keep your content richer. Keep it of 1 page and 2 pages only if you have achieved a lot. Don’t use fillers. Any unwanted information on the resume leaves a bad impact on the interviewer.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

Round duration - 180 minutes
Round difficulty - Easy

This was Online Coding round on Samsung Software. There were 50 test cases and all test cases should be passed to get selected.

Round 2 - Face to Face 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

This was also Face to Face coding Interview totally based on Data Structures and Algorithms.

  • Q1. The Longest Increasing Subsequence (LIS) problem is to find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order.
  • Ans. 

    The Longest Increasing Subsequence (LIS) problem is to find the length of the longest subsequence of a given sequence with increasing order.

    • Use dynamic programming to solve the LIS problem efficiently.

    • Maintain an array to store the length of the LIS ending at each element.

    • Iterate through the array and update the LIS length based on previous elements.

    • Example: For input [10, 22, 9, 33, 21, 50, 41, 60, 80], the LIS is [10...

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

This Face to Face Interview was Based on coding and projects.

  • Q1. Implement the Depth First Search (DFS) algorithm for a graph.
  • Ans. 

    DFS is a graph traversal algorithm that explores as far as possible along each branch before backtracking.

    • Start at a node and explore as far as possible along each branch before backtracking

    • Use a stack to keep track of nodes to visit

    • Mark visited nodes to avoid revisiting them

    • Recursive implementation is common

  • Answered by AI
Round 4 - HR 

(1 Question)

Round duration - 15 minutes
Round difficulty - Easy

HR round was mainly based on questions about myself and my knowledge about the company.

  • Q1. Tell me about yourself and your family background.

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from SRM Institute of Science & Technology. I applied for the job as SDE - 1 in NoidaEligibility criteria Above 70 %Samsung interview preparation:Topics to prepare for the interview - Data Structures , Algorithms, C++ ,JAVATime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Always remember question-solving is not everything in the interview, its a part of interview. Communicating well with the interviewer is most important thing during the interview. Also practice lot of Data Structures and Algorithms based questions that I have practiced from Coding Ninjas and on other coding portals. 

Application resume tips for other job seekers

Mention good projects and only those skills in which you are confident.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Jan 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 120 Minutes
Round difficulty - Hard

This round had 3 preety good questions to be solved under 2 hours . The first question was from Graphs and DSU , the second question was related to DP and the third one was from Recursion.

  • Q1. 

    Most Stones Removed with Same Row or Column

    On a 2-D plane, there are ‘N’ stones placed at some integer coordinate points. Each coordinate point can have at most one stone. A stone can be removed if it sh...

  • Ans. 

    Given a 2-D plane with stones at integer coordinate points, find the maximum number of stones that can be removed by sharing the same row or column.

    • Iterate through the stones and create a graph where stones in the same row or column are connected.

    • Use depth-first search (DFS) to find connected components in the graph.

    • The maximum number of stones that can be removed is the total number of stones minus the number of conne...

  • Answered by AI
  • Q2. 

    Gold Mine Problem Statement

    You are provided with a gold mine, represented as a 2-dimensional matrix of size N x M with N rows and M columns. Each cell in this matrix contains a positive integer represent...

  • Q3. 

    All Possible Balanced Parentheses Problem Statement

    Given a positive integer N, generate all possible sequences of balanced parentheses using N pairs of parentheses.

    A sequence of brackets is called bala...

  • Ans. 

    Generate all possible sequences of balanced parentheses using N pairs of parentheses.

    • Use backtracking to generate all possible combinations of balanced parentheses.

    • Keep track of the number of opening and closing parentheses used.

    • Add opening parentheses if there are remaining, and add closing parentheses only if there are more opening parentheses than closing.

    • Recursively generate all valid combinations.

    • Return the list o...

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 questions from DSA. Both the questions were preety straightforward and were asked to check my implementation skills and how well do I handle Edge Cases for tricky problems.

  • Q1. 

    Stack using Two Queues Problem Statement

    Develop a Stack Data Structure to store integer values using two Queues internally.

    Your stack implementation should provide these public functions:

    Explanation:

    ...
  • Q2. 

    Rotate Matrix by 90 Degrees Problem Statement

    Given a square matrix 'MATRIX' of non-negative integers, rotate the matrix by 90 degrees in an anti-clockwise direction using only constant extra space.

    Inpu...

  • Ans. 

    Rotate a square matrix by 90 degrees in an anti-clockwise direction using constant extra space.

    • Iterate through each layer of the matrix and swap elements in groups of 4

    • Transpose the matrix and then reverse each row to achieve the rotation

    • Ensure to handle edge cases like odd-sized matrices

  • Answered by AI
Round 3 - Video Call 

(4 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round also had 2 questions related to DSA where I was first expected to explain my approaches and then discuss the time and space complexities of my solution. After that , I was asked some core concepts related to OOPS and OS.

  • Q1. 

    Triplets with Given Sum

    Given an array ARR consisting of N integers, find all distinct triplets in the array that add up to a given number K.

    Example:

    Input:
    T = 2
    N = 5
    ARR = [1, 2, 3, 4, 5]
    K = 9
    N = 4
    ...
  • Ans. 

    Find all distinct triplets in an array that add up to a given number.

    • Use three nested loops to iterate through all possible triplets.

    • Sort the array first to easily skip duplicates.

    • Use two-pointer technique to find the remaining element for each triplet.

    • Handle edge cases like empty list or no triplet summing up to K.

  • Answered by AI
  • Q2. 

    Trapping Rain Water Problem Statement

    You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...

  • Ans. 

    Calculate the total amount of rainwater that can be trapped between given elevations in an array.

    • Iterate through the array and calculate the maximum height on the left and right of each bar.

    • Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.

    • Sum up the trapped water at each bar to get the total trapped water for the entire array.

  • Answered by AI
  • Q3. What is the Diamond Problem in C++ and how can it be resolved?
  • Ans. 

    Diamond Problem is a multiple inheritance issue in C++ where a class inherits from two classes that have a common base class.

    • Diamond Problem occurs when a class inherits from two classes that have a common base class, leading to ambiguity in accessing members.

    • It can be resolved in C++ using virtual inheritance, where the common base class is inherited virtually to avoid duplicate copies of base class members.

    • Example: c...

  • Answered by AI
  • Q4. What is thrashing in operating systems?
Round 4 - HR 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Easy

This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to point and professional. The interview lasted for 30 minutes.

  • Q1. What is something about you that is not included in your resume?

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPASamsung interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Are these interview questions helpful?

I appeared for an interview before Jan 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 120 Minutes
Round difficulty - Medium

This was an online coding round where we had 3 questions to solve under 120 minutes. The questions were of medium to hard difficulty level.

  • Q1. 

    Minimum Time in Wormhole Network

    Determine the minimum time required to travel from a starting point to a destination point in a two-dimensional coordinate system, considering both direct movement and the...

  • Q2. 

    Substrings Differ by One Problem Statement

    Ninja needs help in a battle against the string man. Given two strings, 'S' and 'T', the task is to find the number of substrings in 'S' that differ from some su...

  • Ans. 

    The task is to find the number of substrings in 'S' that differ from some substrings of 'T' by exactly one character.

    • Iterate through all substrings of 'S' and 'T' and compare them character by character to find the ones that differ by exactly one character.

    • Use nested loops to generate all possible substrings of 'S' and 'T'.

    • Count the number of substrings that differ by exactly one character and return the total count.

  • Answered by AI
  • Q3. 

    Power of Two Problem Statement

    Determine whether a given integer N is a power of two. Return true if it is, otherwise return false.

    Explanation

    An integer 'N' is considered a power of two if it can be e...

Round 2 - Face to Face 

(4 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 questions related to DSA where I was first expected to explain my approaches and then discuss the time and space complexities of my solution. After that , I was asked some core concepts related to OS.

  • Q1. 

    Reverse Linked List Problem Statement

    Given a singly linked list of integers, return the head of the reversed linked list.

    Example:

    Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
    Reversed link...
  • Q2. 

    Cycle Detection in Undirected Graph Problem Statement

    You are provided with an undirected graph containing 'N' vertices and 'M' edges. The vertices are numbered from 1 to 'N'. Your objective is to determi...

  • Q3. What are the differences between a mutex and a semaphore?
  • Ans. 

    Mutex is used for exclusive access to a resource by only one thread at a time, while semaphore can allow multiple threads to access a resource simultaneously.

    • Mutex is binary semaphore with ownership, used for mutual exclusion.

    • Mutex is typically used to protect critical sections of code.

    • Semaphore is a signaling mechanism, used for synchronization between multiple threads.

    • Semaphore can have a count greater than 1, allowi...

  • Answered by AI
  • Q4. What is meant by multitasking and multithreading in operating systems?
  • Ans. 

    Multitasking refers to the ability of an operating system to run multiple tasks concurrently, while multithreading involves executing multiple threads within a single process.

    • Multitasking allows multiple processes to run simultaneously on a single processor, switching between them quickly to give the illusion of parallel execution.

    • Multithreading involves breaking a process into multiple threads that can be executed ind...

  • Answered by AI
Round 3 - Face to Face 

(4 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 Algorithmic questions wherein I was supposed to code both the problems after discussing their
approaches and respective time and space complexities . After that , I was grilled on some OOPS concepts related to C++.

  • Q1. 

    Trapping Rain Water Problem Statement

    You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...

  • Q2. 

    Find The Repeating And Missing Number Problem Statement

    You are provided with an array nums which contains the first N positive integers. In this array, one integer appears twice, and one integer is missi...

  • Q3. What is the Diamond Problem in C++ and how can it be resolved?
  • Q4. What are friend functions in C++?

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPASamsung interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. Multiple
  • Q2. Multiple.

Interview Preparation Tips

Round: Test
Experience: Graph problem.
First step was to formulate the question into graph problem.

Then solve using standard graph algo (Dijkstra, bellmen ford, e.tc).
Tips: Practice writing whole code without using standard library.
Duration: 3 hours
Total Questions: 1

Round: Technical Interview
Experience: Question related to dfs.
Asked about networking, OS and integers.

One puzzle.(available on geeksforgeeks)
Tips: Prepare for puzzle. Generally they go for standard puzzle.

Round: Technical Interview
Experience: It was mostly related to technical project and internship.

General discussion on machine learning.
Tips: Prepare for the projects mentioned on the resume

Round: HR Interview
Experience: He was testing me regarding how I will explain a technical project to a non-technical guy.. And also general HR questions like why u want to join Samsung and other similar questions.
Tips: Nothing new.

Skills: Basic programming stuff. , Algorithm, Graph Theory, Machine Learning, Problem Solving Skills
College Name: IIT Kharagpur

Software Developer Interview Questions & Answers

Samsung user image Gaurav Srikant Mokhasi

posted on 3 Dec 2015

Interview Preparation Tips

Round: PRE PLACEMENT OFFER
Experience: Interns (both CS and IT) were selected in my third year. Pre-placement offers were rolled out to 16 of us which was roughly a conversion ratio of 1:3. A couple of ECE hires were added when SRI-B visited campus later.

General Tips: If you're in CS or IT, this is the only format your resume should be in: -----
Take your internship seriously. Have fun and all but also get your project done. It's not the end of the world if you don't get a PPO. Campus placements are tension-filled, no doubt, but a lot of people get equally good if not better jobs after missing out on PPOs.
Make sure you talk to your manager about the PPO process. She will be the one giving you your final review. So ensure that she knows you want the job. Prepare a fancy presentation for the HR. By fancy, I mean slick and professional. Think Apple, not flashy Microsofty graphics and stupid word art.
Skill Tips: Google GSAT (Global Samsung Aptitude Test) a week before the test and make sure you practice some similar CAT type questions. Questions are of medium difficulty and time management is a real issue (most of us were unable to finish properly). - I didn't have to use these but I've heard good things about codechef/topCoder and books such as Cracking the Coding Interview by Gayle Laakmann McDowell.
Skills:
College Name: NIT Surathkal

Apple Interview FAQs

How many rounds are there in Apple Software Development Engineer Test interview?
Apple interview process usually has 4 rounds. The most common rounds in the Apple interview process are Coding Test, Case Study and Resume Shortlist.
How to prepare for Apple Software Development Engineer Test interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Apple. The most common topics and skills that interviewers at Apple expect are Python, Maven, Selenium, Manual Testing and Performance Testing.
What are the top questions asked in Apple Software Development Engineer Test interview?

Some of the top questions asked at the Apple Software Development Engineer Test interview -

  1. 2. Write a code to return list of tuples where sum of tuple elements should be ...read more
  2. 1. Optimised algorithm to find given number in 2D ar...read more
  3. 3.write a code for balancing paranthe...read more

Tell us how to improve this page.

Join Apple Join us. Be you.

Interview Questions from Similar Companies

Samsung Interview Questions
3.9
 • 577 Interviews
Dell Interview Questions
3.9
 • 407 Interviews
HARMAN Interview Questions
3.7
 • 278 Interviews
OPPO Interview Questions
3.9
 • 231 Interviews
LG Electronics Interview Questions
3.9
 • 230 Interviews
vivo Interview Questions
4.1
 • 211 Interviews
Philips Interview Questions
3.8
 • 169 Interviews
Samsung Research Interview Questions
3.1
 • 140 Interviews
View all
Apple Software Development Engineer Test Salary
based on 4 salaries
₹32 L/yr - ₹38 L/yr
190% more than the average Software Development Engineer Test Salary in India
View more details
Software Development Engineer in Test

Hyderabad / Secunderabad

8-10 Yrs

Not Disclosed

Software Development Engineer in Test - IS&T

Hyderabad / Secunderabad

2-7 Yrs

Not Disclosed

Software Development Engineer in Test - IS&T

Hyderabad / Secunderabad

2-5 Yrs

Not Disclosed

Explore more jobs
Software Engineer
214 salaries
unlock blur

₹33.5 L/yr - ₹55.4 L/yr

Software Developer
147 salaries
unlock blur

₹25.8 L/yr - ₹42 L/yr

Ipro
116 salaries
unlock blur

₹2 L/yr - ₹5 L/yr

Sales Executive
107 salaries
unlock blur

₹1.7 L/yr - ₹5.3 L/yr

Senior Software Engineer
80 salaries
unlock blur

₹28.5 L/yr - ₹60 L/yr

Explore more salaries
Compare Apple with

Google

4.4
Compare

Amazon

4.0
Compare

Microsoft Corporation

3.9
Compare

Samsung

3.9
Compare
write
Share an Interview