VISIT SDE-2 Interview Questions and Answers

Q1. Minimum cost to connect the ropes
Ans. 
The minimum cost to connect the ropes is calculated by repeatedly connecting the two smallest ropes until all ropes are connected.
• Sort the ropes in ascending order.

• Repeatedly connect the two smallest ropes.

• Add the cost of connecting the two ropes to the total cost.

• Continue this process until all ropes are connected.
Answered by AI
Add your answer
Q2. Max value of arr[i]+arr[j]+i-j
Ans. 
The question asks for the maximum value of arr[i]+arr[j]+i-j for given array arr.
• Iterate through all possible pairs of i and j in the array

• Calculate the value of arr[i]+arr[j]+i-j for each pair

• Keep track of the maximum value found
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
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?
Add your answer
Q2. Can you explain the fragment lifecycle in Android development?
Add your answer
Q3. Can you explain the MVVM pattern?
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

Q1. Manual testing concepts
Add your answer
Q2. Test scenarios and execution
Add your answer

Q1. Core java and code
Add your answer
Q2. Oops concepts and implementation
Ans. 
Oops concepts refer to object-oriented programming principles like inheritance, polymorphism, encapsulation, and abstraction.
• Inheritance: Allows a class to inherit properties and behavior from another class. Example: Parent class 'Animal' and child class 'Dog'.

• Polymorphism: Ability of an object to take on multiple forms. Example: Method overloading and overriding.

• Encapsulation: Bundling data and methods that operate on...read more
Answered by AI
Add your answer

Java interview question,coding problems,

Q1. Java collection and oops related interview question
Add your answer

Q1. Automation framework related question
Add your answer

2 question of DSA (easy, medium) in 60 minutes

Q1. Playlist Shuffle
Add your answer
Q2. Deletion in min heap
Ans. 
Deletion in min heap involves removing the root node and rearranging the heap to maintain the min heap property.
• To delete the root node in a min heap, swap it with the last node in the heap.

• Remove the last node and then heapify the heap starting from the root to maintain the min heap property.

• Example: If the min heap is [10, 20, 30, 25, 40], after deletion the heap becomes [20, 25, 30, 40].
Answered by AI
Add your answer