Tip 1 : You should know the activity lifecycle, fragment lifecycle in depth.
Tip 2 : You should the internal working of View Model, Recycler View and in depth concepts of Android components like livedata, flow, coroutines, data binding, and remaining Android Architecture Components.
Tip 3 : You should know OOPs concepts of Kotlin, they asked many questions from that topic.
Tip 4 : Your Projects should be well documented and having latest android architecture components.
Tip 1 : Your resume will be having at least two Android related development projects.
Tip 2 : Should be one column and design as simple as possible.
Show trending repos of GitHub in a RecyclerView using Github APIs. On click of Item, THE ROW SHOULD BE SELECTED, Position and Item Selection should be maintain on Orientation Change, Needful Android app Architecture to be followed(to be chosen by you as per your preference).
I searched for the GitHub developer documentation for API endpoint for Trending Repos.
Handling Orientation change using Bundles in Activity.
Use MVVM Architecture throughout the app.
I Can Search the repo from the local list using a search box on top which will filter the list, Maintain Selection after search as well, All relevant Error states to be handled in the app.
Using local caching so that I can fetch searched data without maintaining any variable in activity/viewmodel.
Timing: 2pm-3pm
Interviewer: Current Senior Android Developer of Lenskart
They asked me to explain the approach I have used in my first round Assessment (An Android application that shows GitHub trending repos).
I have explained all the steps including how I find that API for GitHub trending repos and explain the interviewer that I have used MVVM to manage configurational changes and used Data binding to remove boilerplate code from activity.
Timing: 2pm-3pm
Interviewer: Android team manager
First he asked me about the android concepts, How I will approach particular problem and then they asked me one recursion problem. Find the longest increasing subsequence of numbers in array.



[1, 2, 3, 4] is a strictly increasing array, while [2, 1, 4, 3] is not.
Firstly, I answered all the android related question.
Then, for that array question. I give them a simple recursive solution for that, I found the maximum LIS at index i and then interviewer asked me to optimise the solution, then I give the Dynamic Programming solution that contains Memoization and reduce the repeated recursive calls.
Timing: Not sure about timing but it was between 11 AM-3 PM
Previous company experience.
They asked me about my previous company CTC and my expected CTC.
I told them my previous round CTC and my expected CTC.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?