Apple

I had two phone interviews. The first interview was about basic C questions, such as volatile, static, and const. I was asked to code a C program to find the second-to-last element in a linked list. They also inquired about one of my projects listed

I received the first call after four days of applying. I had applied through LinkedIn. It was a 30-minute call with one of the recruiters. The second call was a phone interview with the test lead of the team.

Technical and personal questions. LeetCode style questions covering: * Binary search trees * Binary search * Converting linked lists Some questions on hash functions, such as returning the next letter in alphabetical order in a cyclic fashion.