Skip to contentSkip to footer

Lead Android Engineer Interview Questions

Salaries
Interviews

6,352 lead android engineer interview questions shared by candidates

Implement method oneEditApart that return boolean: true, if using one operations (insert or remove or replace) we can modify one string to get another. False otherwise. // Signature: boolean oneEditApart(String s1, String s2) // Allowing operations insert remove replace Example: oea("cat", "cut") => true // replace "u" -> "a" oea("cat", "cuts") => false // no operations oea("ca", "ca") => false // no operations oea("cats", "cat") => true // remove "s" oea("cat", "at") => true // insert "c" oea("cat", "cbat") => true // remove "b"
avatar

Software Engineer, Android

Interviewed at Meta

3.5★
Jun 4, 2014

Implement method oneEditApart that return boolean: true, if using one operations (insert or remove or replace) we can modify one string to get another. False otherwise. // Signature: boolean oneEditApart(String s1, String s2) // Allowing operations insert remove replace Example: oea("cat", "cut") => true // replace "u" -> "a" oea("cat", "cuts") => false // no operations oea("ca", "ca") => false // no operations oea("cats", "cat") => true // remove "s" oea("cat", "at") => true // insert "c" oea("cat", "cbat") => true // remove "b"

You have an Activity, and you implement push notification, when you receive a notification, and you tap on it, the PendingIntent launched point to your Activity. If you open a notification, and your Activity is visible in that moment, in which method of the activity you receive the intent with the information of the push message?
avatar

Android Developer

Interviewed at Globant

3.6★
Jul 2, 2015

You have an Activity, and you implement push notification, when you receive a notification, and you tap on it, the PendingIntent launched point to your Activity. If you open a notification, and your Activity is visible in that moment, in which method of the activity you receive the intent with the information of the push message?

Fibonacci Series: The Fibonacci Sequence is the series of numbers where the next number is found by adding up the two numbers before it. F(0) = 0 F(1) = 1 F(n) = F(n-1) + F(n-2) Which of the following is the correct and the most efficient implementation for fibonacci numbers. int fib(int n) { int f[n+1]; int i; f[0] = 0; f[1] = 1; for (i = 2; i <= n; i++) { f[i] = f[i-1] + f[i-2]; } return f[n]; } int fib(int n) { int f[n+1]; int i; if( n <= 1) return n; f[0] = 0; f[1] = 1; for (i = 2; i < n; i++) { f[i] = f[i-1] + f[i-2]; } return f[n]; } int fib(int n) { if (n <= 1) return n; return fib(n-1) + fib(n-2); } int fib(int n) { int a = 0, b = 1, c, i; if( n == 0) return a; for (i = 2; i <= n; i++) { c = a + b; a = b; b = c; } return b; }
avatar

Android Developer

Interviewed at Smartprix

3.4★
Aug 3, 2016

Fibonacci Series: The Fibonacci Sequence is the series of numbers where the next number is found by adding up the two numbers before it. F(0) = 0 F(1) = 1 F(n) = F(n-1) + F(n-2) Which of the following is the correct and the most efficient implementation for fibonacci numbers. int fib(int n) { int f[n+1]; int i; f[0] = 0; f[1] = 1; for (i = 2; i <= n; i++) { f[i] = f[i-1] + f[i-2]; } return f[n]; } int fib(int n) { int f[n+1]; int i; if( n <= 1) return n; f[0] = 0; f[1] = 1; for (i = 2; i < n; i++) { f[i] = f[i-1] + f[i-2]; } return f[n]; } int fib(int n) { if (n <= 1) return n; return fib(n-1) + fib(n-2); } int fib(int n) { int a = 0, b = 1, c, i; if( n == 0) return a; for (i = 2; i <= n; i++) { c = a + b; a = b; b = c; } return b; }

Viewing 21 - 30 interview questions

Glassdoor has 6,352 interview questions and reports from Lead android engineer interviews. Prepare for your interview. Get hired. Love your job.