Ixigo interview Experience | SDE Android Developer
Summary
I interviewed for the SDE Android Developer position at Ixigo. The interview process primarily focused on Android core concepts, a significant data structures and algorithms challenge, and a logical puzzle.
Full Experience
I recently had my interview experience with Ixigo for the SDE Android Developer role. The interview round was quite comprehensive, testing my knowledge across various domains. It started with several in-depth questions about Android's fundamental components, particularly focusing on Activity lifecycle and launch modes. Following that, I was presented with a challenging Data Structures and Algorithms problem that required an optimized approach for finding subarrays with a specific sum. The interview concluded with a classic logical puzzle that tested my problem-solving skills.
Interview Questions (7)
Explain the complete lifecycle of an Android Activity, including its various states and callback methods.
Describe the sequence of activity lifecycle callback methods that are invoked when Activity A is started from Activity B.
Given an activity stack A/B/A/C (A on top), what will be the state of the stack if Activity A is started again using SingleTop launch mode?
Given an activity stack A/B/A/C (A on top), what will be the state of the stack if Activity A is started again using SingleTask launch mode?
Explain the function of onNewIntent() in Android activities and describe the scenarios in which it is called.
Given an array of integers and a target value, return all contiguous subarrays whose elements sum up to the target value. Optimize the approach to achieve a time complexity less than O(n^2).
Example:
Input: arr = [1,2,1,3,4,1,1,1,1,5], target = 4
Output:
[1,2,1]
[1,3]
[4]
[1,1,1,1]
You have 25 horses and a racetrack with 5 lanes. This means only 5 horses can race at a time. You do not have a stopwatch, so you can only tell the relative speeds of the horses in each race (i.e., which horse came in 1st, 2nd, 3rd, etc.). What is the minimum number of races required to find the 3 fastest horses?