The questions were about android development and what makes a high-quality codebase, and SE design patterns, and some important concepts of android development. Live coding: normal coding questions in leetcode & hackerrank, nothing too difficult
Android Engineer Interview Questions
10,446 android engineer interview questions shared by candidates
tells us about your experience? what does clean code means to you?
What is Dependency injection
NDA
Basic Aptitude, Coding.
Find kth min element in unsorted integer array.
How to reverse all words in a given sentence
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; }
Basic questions
Coding problem
Viewing 61 - 70 interview questions