Unknowns Mobile Engineer Interview Questions
The questions to prepare for a Unknowns Mobile Engineer interview. Questions from real interview reports rank first. Updated weekly.
Use DFS tree dynamic programming to compute the maximum path sum across any parent-child path in a binary tree.
UnknownsFind two action values that reach a target using a hash map in linear time.
UnknownsCheck whether a string is a palindrome using two pointers while ignoring case and non-alphanumeric characters.
UnknownsUse a sliding window and hash map to find the longest substring without repeated characters in a string.
UnknownsFind two Box file sizes that sum to a target using a hash map in O(n) time.
UnknownsTraverse a binary tree in inorder using DFS recursion and return node values from left, root, then right.
UnknownsTests ownership and communication in diagnosing and fixing a mobile memory leak with clear technical investigation and measurable impact.
UnknownsTests your product thinking and technical design for scalable search and filtering in mobile apps.
UnknownsSign up to see every question
Create a free account to unlock this list and practice real interview questions.