Tata 1mg SDE-2 Interview Questions and Answers

It was a leetcode medium, related BFS,

Q1. Basic of android like fragment activity communication
Add your answer
Q2. Why ViewModel is necessary, how does it save state
Ans. 
ViewModel is necessary in Android development to save and manage UI-related data during configuration changes.
• ViewModel helps in retaining data during configuration changes like screen rotations

• It separates UI-related data from UI controller (Activity/Fragment)

• ViewModel survives configuration changes and can be shared between fragments

• It helps in maintaining data consistency and prevents memory leaks

• ViewModel is lifecy...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Timing was around 11 am
Environment was great, it intrigued me to join Blinkit.

Q1. 
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
...read more
Ans. 
First approach : Loop inside Loop to figure out the sum of two numbers are equal to a constant number. But the complexity is N2 

Second approach : i used Map to store numbers. Before storing we just check rhta constant number - current number exist in map or not.

Second solution is approved
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Timing 11 am
Interviewer had good knowledge

Q1. Can you explain the activity lifecycle in Android development?
Ans. 
Tip 1 : Remember important methods and what is the used of every method
Answered Anonymously
Add your answer
Q2. Can you explain the fragment lifecycle in Android development?
Ans. 
Tip 1 : Remember important methods and what is the used of every method
Answered Anonymously
Add your answer
Q3. Can you explain the MVVM pattern?
Ans. 
Tip 1 : must have knowledge about MVC, mvp,mvi,mvvm patterns.
Answered Anonymously
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This round is cultural fit round

Q1. Data Structures and Algorithms
Add your answer

Q1. Machine Coding round
Add your answer

Q1. What is clousers
Add your answer
Q2. What is promises
Add your answer

Q1. Explain javascript architecture
Add your answer
Q2. What is mvvm architecture
Add your answer

There were 2 questions in coding one with array and in string releated

Q1. About Selenium questions
Add your answer
Q2. Other basic questions related to testing
Add your answer
Q3. Management related question
Add your answer

Q1. One program to solve
Add your answer
Q2. Other questions in selenium
Add your answer

Q1. Given a string remove the vowels and make the first letter of each word of the string in capital letter/ uppercase.
Add your answer

Q1. Usual HR questions and salary discussion
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA.
Tip : Do variants of Binary Search.

Q1. 
Square Root of an Integer Challenge
Given an integer 'A', the objective is to find the largest non-negative integer whose square is less than or equal to 'A'.
The square of a number is defined as the pro...read more
Ans. 
The Simple Approach is to find the floor of the square root, try with all-natural numbers starting from 1. Continue incrementing the number until the square of that number is greater than the given number.

Algorithm : 
1. Create a variable (counter) i and take care of some base cases, i.e when the given number is 0 or 1.
2. Run a loop until i*i <= n , where n is the given number. Increment i by 1.
3. The floor of t...read more
Answered Anonymously
Add your answer
Q2. 
Find Minimum in Rotated Sorted Array
You are presented with a sorted array that has been rotated an unknown number of times. The nature of this rotation is such that each element shifts to the right with ...read more
Ans. 
The brute force solution is to traverse the entire array and find the minimum. Time Complexity : O(N)

The efficient approach is to use Binary Search. The following pattern can be observed : 
 
• The minimum element is the only element whose previous is greater than it. If there is no previous element, then there is no rotation (the first element is minimum). We check this condition for the middle element by comp...read more
Answered Anonymously
Add your answer