Rivigo SDE-2 Interview Questions and Answers

I don't remember the ques

Q1. System design of notification system
Ans. 
Design a scalable notification system for sending real-time alerts to users.
• Use a distributed system to handle high volume of notifications.

• Implement message queues for asynchronous processing.

• Utilize push notifications for mobile devices.

• Include a user preference system for customizing notification settings.

• Consider implementing a notification history feature for users to view past alerts.
Answered by AI
Add your answer

Q1. System design of google pay
Ans. 
Google Pay is a digital wallet platform and online payment system developed by Google.
• Google Pay uses secure tokenization to protect user's payment information.

• It integrates with various payment methods like credit/debit cards, UPI, and NFC.

• The system handles transactions, user authentication, and merchant integrations.

• Google Pay leverages Google's infrastructure for scalability and reliability.

• It provides features lik
Answered by AI
Add your answer

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
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to return the list of all pairs of elements such that each sum of elements of each pair eq...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 by CodingNinjas
View 3 more answers

Round duration - 60 Minutes
Round difficulty - Medium

Timing 11 am
Interviewer had good knowledge

Q1. Technical Question
Activity lifecycle
Ans. 
Tip 1 : Remember important methods and what is the used of every method
Answered by CodingNinjas
Add your answer
Q2. Technical Question
Fragment lifecycle
Ans. 
Tip 1 : Remember important methods and what is the used of every method
Answered by CodingNinjas
Add your answer
Q3. System Design Question
Explain MVVM pattern
Ans. 
Tip 1 : must have knowledge about MVC, mvp,mvi,mvvm patterns.
Answered by CodingNinjas
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This round is cultural fit round

Q1. Basic HR Questions
1. Why Blinkit?
2. Salary discussion
Add your answer

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

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