Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Apple nel mese di ott 2022
Colloquio
Breakdown: 1) Phone Interview Round 2) Onsite 5 Rounds were held and accepted 3) Director Round was difficult and was the last technical round. 4) Senior Director Round 5) Decision told by HR
Ho sostenuto un colloquio presso Apple (San Diego, CA)
Colloquio
Had one hour interview with two teams, RRC and NAS teams. They were one-hour interviews. Asked about past experiences, describe a project from your resume. Asked theoretical questions about cellular protocols
Domande di colloquio [1]
Domanda 1
Insert a country name in Alphabetical order (not using in-build string functions)---> optimized solution and choose a data structure Swap even and odd bits What is priority inversion, and how do you solve it? Whats memory leak, segmentation fault?
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Apple (Urbana, IL) nel mese di mag 2022
Colloquio
Interview consisted of an initial phone screen and a final round. Phone screen asked an easy/medium C question. Final round was 6 technical interviews of 45 mins each, back-to-back with 1 hour break for lunch.
Some technical interviews were required to be done in C, others allowed any language.
Interviews included leetcode style algorithm questions, C specific questions, and C knowledge questions.
Last round of the day was interview with hiring manager, going over resume and asking some C knowledge questions.
Stamina is very important for this interview, as it lasts a whole day (~7 hours).
Domande di colloquio [6]
Domanda 1
Design an algorithm to check if two words are anagrams.
We have a deck of cards in hand, where we take the top card off the deck, place it onto a table, then place the next top card onto the bottom of the deck. Repeat this process until deck in hand is empty, then take the deck from the table and place into hand. This is called one round.
How many rounds does it take for the deck to return to its original order? Design a class in C++ to model and solve this problem.