ixigo logo
ixigo· sde android developer

Ixigo interview Experience | SDE Android Developer

Result
Ongoing
Posted
9 Jun 2023
394 reads

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.

How it went

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.

Questions asked (7)

  1. 01

    Explain Android Activity Lifecycle

    Other

    Explain the complete lifecycle of an Android Activity, including its various states and callback methods.

  2. 02

    Activity Lifecycle on Starting New Activity

    Other

    Describe the sequence of activity lifecycle callback methods that are invoked when Activity A is started from Activity B.

  3. 03

    Android Activity Stack with SingleTop

    Other

    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?

  4. 04

    Android Activity Stack with SingleTask

    Other

    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?

  5. 05

    Purpose and Invocation of onNewIntent()

    Other

    Explain the function of onNewIntent() in Android activities and describe the scenarios in which it is called.

  6. 06

    Subarrays with Given Sum

    Data Structures & Algorithms · Medium

    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]

  7. 07

    25 Horses, 5 Tracks Puzzle

    Other · Hard

    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?

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at ixigo recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!