LinkedIn Mobile Engineer interview questions

3 Mobile Engineers have shared notes from their LinkedIn interviews, with the questions they were asked in each round. That is 1% of the 316 LinkedIn interview notes on Screna AI.

3 Mobile Engineer interview notes

LinkedIn·Mobile Engineer·Technical Phone Screen

Jul 2026
LinkedIn mobile engineer screen, about ten minutes focused entirely on iOS memory management. Pretty narrow scope but they went deep fast.
  • How does ARC work, and how is it different from garbage collection?
  • Walk me through strong, weak, and unowned references and when you'd choose each.
  • How do retain cycles form, and what are the main patterns you use to break them?
  • What are autorelease pools and when would you actually use one in modern iOS code?
  • What tools do you use to find memory leaks and how do you approach diagnosing them?

“Started okay, explained retain counts going to zero and deallocation happening synchronously.”

View Post

LinkedIn·Mobile Engineer·Technical Phone Screen

Jun 2026
LinkedIn mobile engineering interview with a coding problem that looked simple on the surface but had a specific constraint that tripped me up a bit. Binary search was the expected approach and they were pretty clear about the O(log n) requirement.
  • Given a positive integer, determine whether it is a perfect square without using any built-in square root functions. Your solution must run in O(log n) time.

“My first instinct was to just iterate from 1 upward and check each square, which obviously fails the time constraint.”

View Post

LinkedIn·Mobile Engineer·Technical Phone Screen

Jun 2026
LinkedIn mobile engineer interview with a weighted nested list problem. Pretty standard algorithmic round but the inverse-depth weighting twist made me second-guess myself more than I'd like to admit.
  • Given a nested list of integers where each element can be an integer or another nested list, compute a weighted sum where each integer's weight is (maxDepth - depth + 1). Deeper integers get lower weight.

“I initially coded the straightforward version where deeper elements get more weight, which is the classic problem.”

View Post