AppLovin Software Engineer interview questions

7 Software Engineers have shared notes from their AppLovin interviews, with the questions they were asked in each round. That is 78% of the 9 AppLovin interview notes on Screna AI.

7 Software Engineer interview notes

AppLovin·Software Engineer·Technical Phone Screen

Jun 2026
Applovin software engineer round, pretty straightforward coding problem. Nothing too wild, just grid traversal with a shortest path ask.
  • Given a 2D grid with a start cell and a target cell, find the shortest path between them. Some cells may be blocked. Return the path length, or indicate that the target is unreachable.

“Classic BFS setup.”

View Post

AppLovin·Software Engineer·Technical Phone Screen

Jun 2026
Second round at Applovin for a software engineer role, and they threw a mini compiler problem paired with topological sort. Not a ton to say but it was a solid technical round.
  • Implement a mini compiler or related parsing problem involving topological sort.

“Topological sort is one of those things I always feel fine about until I'm actually coding it under pressure.”

View Post

AppLovin·Software Engineer·Onsite - System Design / Architecture

Jun 2026
System design round at Applovin for a software engineer role. One question, video storage at scale, pretty much the whole session.
  • Design a system for storing and serving videos at scale, similar to YouTube.

“This is the kind of question where you think you know what to say and then realize mid-sentence you have no idea how transcoding actually works at scale.”

View Post

AppLovin·Software Engineer·Technical Phone Screen

May 2026
One round at Applovin for a software engineer role, just a single coding question that was basically an LRU cache variant dressed up as a job scheduler.
  • Design a job scheduler with behavior similar to an LRU cache.

“It's LRU but not quite.”

View Post

AppLovin·Software Engineer·Technical Phone Screen

May 2026
Had a coding round at Applovin that was basically a twist on a classic BST validation problem. Not a brutal interview but the variant caught me a little off guard since I'd only ever practiced the boolean version.
  • Given a binary tree, instead of just checking whether it's a valid BST, return the count of nodes that violate the BST property, meaning nodes whose values fall outside the valid range for their position during an in-order traversal.

“I knew the standard recursive approach with low/high bounds, so the structure came to me fast.”

View Post

AppLovin·Software Engineer·Technical Phone Screen

May 2026
Applovin software engineer interview with a grid path counting problem. Pretty standard dynamic programming territory but they pushed into follow-up territory that caught me a bit flat-footed.
  • Given a grid with a start cell, an end cell, and some blocked cells, count the number of distinct paths from start to end where you can only move right or down.
  • How would your approach change if movement were allowed in all four directions instead of just right and down?

“I went straight to DFS with memoization.”

View Post

AppLovin·Software Engineer·Onsite - System Design / Architecture

Apr 2026
System design round at Applovin focused entirely on designing Uber Pool. Pretty deep dive, they wanted specifics on matching, dispatch, routing, and ETA all in one go.
  • Design the Uber Pool (ride-share) feature with the goal of maximizing passengers picked up per trip without meaningfully increasing the original passenger's travel distance. Cover request matching, driver dispatch, route updates, ETA calculations, and the trade-offs in your matching algorithm at scale.

“This one sprawled fast.”

View Post