Tip 1 : Clear all the topics related to Android with deep details about every topics.
Tip 2 : Practice DSA and algorithms from GFG, CodeStudio daily.
Tip 3 : Dry run code before running the code.
Tip 1 : Have your projects in resume
Tip 2 : Have a single page resume
This is Technical Round Which was held on GoogleMeet . Interview asked about my previous company projects and about technical subjects like DS , OS and Networking. Aslo included System Design



The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Can you solve this problem in O(N) time and O(1) space complexity?
You have to explain the Fragment Lifecycle.
This is final Round , HR discussed about my last CTC and about relocation
Why do you want to join us?
What are your future plans?

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