Apple

Role: SDE

College: Not Specified

Interview Date: 2024

Interview Type: On-Campus

Result: Not Specified

Difficulty: Medium to Hard

Rounds: 4 rounds (Resume Shortlisting, Online Test, Technical Interview, Techno-Managerial Interview)

Topics Asked: Data Structures, Algorithms (Merge Sort, N-Queens Problem), DBMS, OS, OOPs, Problem Solving, Communication, Interpersonal Skills

Experience:

The candidate noted that Apple sought individuals with strong communication, interpersonal skills, and a proactive attitude towards problem-solving.

Round 1: Resume Shortlisting
Candidates were shortlisted based on their resumes, with a specific requirement of no backlogs.

Round 2: Online Test
This round included a coding question and 10 MCQs. The coding question was a LeetCode problem: "Imagine you're playing a game where you need to cross a sequence of stones to reach the final stone. Each stone has a number indicating the maximum steps you can jump forward. Starting from the first stone, determine whether you can reach the last stone. Return true if it's possible, otherwise false." (Example: Input:; Output: true). The MCQs covered core computer science topics like DBMS, OS, OOPs, and DSA. Approximately 50 candidates advanced to the next round. Tip: Practice LeetCode and MCQs on core CS subjects.

Round 3: Technical Interview (Eliminatory)
Conducted online via Webex and CoderPad for pair coding, this round was with a Senior Software Engineer. The interviewer asked for an implementation of Merge Sort, its time complexity analysis, and a discussion of edge cases.

Round 4: Techno-Managerial Interview
This online round was with a Senior Software Manager. The candidate was asked to jump straight into pair coding for a problem described vaguely but recognized as the N-Queens Problem. The candidate solved it in 25 minutes. Managerial questions included: "How do you manage conflict with your teammates?"