Skip to contentSkip to footer

Android Software Developer Interview Questions

Salaries
Interviews

625 android software developer interview questions shared by candidates

1A. Given a sorted array of integers, make a binary search tree out of it. Solution is recursive. 1B. What if you're passed a sorted linked list instead of a sorted array? Make a binary search tree out of this now. Solution is recursive. 2. Compute the diameter (look up the definition) of a binary tree. Solution is recursive. 3. Architecture - design the news feed from an Android client point of view. 4. Given a dictionary of strings -> translations, translate an input string. Translations may overlap. For ex: 1->A, 11->B, 111->C. Solution is recursive and involves preprocessing the input dict. 5. Given a queue of jobs, their runtime, and a cool down town, return the total time to finish the jobs. Input could be: A->3,B->2,A->3,A->3 and cool down of 2 after each job. Solution is iterative (and quite simple). 6. Print a binary tree vertically aligned, where a node, it's right child's left child, and it's left child's right child are in the same group. Solution involves passing the groupId to each child. Right child will be curNode.groupId+1 and left child is curNode.groupId-1. Append in a hashtable<int, linkedlist> keyed by groupId.
avatar

Android Software Engineer

Interviewed at Meta

3.6★
May 10, 2017

1A. Given a sorted array of integers, make a binary search tree out of it. Solution is recursive. 1B. What if you're passed a sorted linked list instead of a sorted array? Make a binary search tree out of this now. Solution is recursive. 2. Compute the diameter (look up the definition) of a binary tree. Solution is recursive. 3. Architecture - design the news feed from an Android client point of view. 4. Given a dictionary of strings -> translations, translate an input string. Translations may overlap. For ex: 1->A, 11->B, 111->C. Solution is recursive and involves preprocessing the input dict. 5. Given a queue of jobs, their runtime, and a cool down town, return the total time to finish the jobs. Input could be: A->3,B->2,A->3,A->3 and cool down of 2 after each job. Solution is iterative (and quite simple). 6. Print a binary tree vertically aligned, where a node, it's right child's left child, and it's left child's right child are in the same group. Solution involves passing the groupId to each child. Right child will be curNode.groupId+1 and left child is curNode.groupId-1. Append in a hashtable<int, linkedlist> keyed by groupId.

Viewing 211 - 220 interview questions

Glassdoor has 625 interview questions and reports from Android software developer interviews. Prepare for your interview. Get hired. Love your job.