Rakuten India interview experience Real time questions & tips from candidates to crack your interview

SDE

Rakuten India
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Tip 1 : Have command on any one language and also maintain decent GPA
Tip 2 : Build a strong portfolio by practicing quality code and having good projects

Application process
Where: Campus
Eligibility: No criteria
Resume Tip
Resume tip

Tip 1 : Mention at least 2 Projects on your resume. 
Tip 2 : Never fake your resume.

Interview rounds

01
Round
Hard
Online Coding Test
Duration30 minutes
Interview date15 Jun 2022
Coding problem2

- Morning time
- Environment was good.
- No
- Interviewer was good

1. Idempotent Matrix

Easy
0/40
Asked in companies
MeeshoMr. CooperJio Platforms Limited

Given a N * N matrix and the task is to check matrix is idempotent matrix or not.

See the sample input.

Idempotent matrix M follows the following property :

M*M = M
Problem approach

s1 - Apply Idempotent matrix approach
s2 - Size N of the matrix, N + 1 : NXN elements of the matrix

Try solving now

2. Best Time to Buy and Sell Stock

Moderate
20m average time
80% success
0/80
Asked in companies
IntuitOptumOYO

You are given an array/list 'prices' where the elements of the array represent the prices of the stock as they were yesterday and indices of the array represent minutes. Your task is to find and return the maximum profit you can make by buying and selling the stock. You can buy and sell the stock only once.

Note:

You can’t sell without buying first.
For Example:
For the given array [ 2, 100, 150, 120],
The maximum profit can be achieved by buying the stock at minute 0 when its price is Rs. 2 and selling it at minute 2 when its price is Rs. 150.
So, the output will be 148.
Try solving now
02
Round
Medium
Video Call
Duration30 min
Interview date17 Jun 2022
Coding problem1

- Morning time
- Environment was good.
- No
- Interviewer was good

1. Ninja and Sorted List

Moderate
0/80
Asked in companies
LinkedInFacebookMicrosoft

There is a list of N files, and each file has a given file ID. Array ‘ARR’ contains the list of all file IDs.Ninja’s task is to tell whether a file with ID = ‘VAL’ exists in the list or not. So, to answer the query quickly, Ninja sorted the list. But, due to system error, the sorted array got rotated at an unknown pivot. Can you help Ninja with this problem?

You are given a rotated sorted array ‘ARR’ having ‘N’ elements and an integer ‘VAL’. You to check whether ‘VAL’ exists in the given array or not.

For Example
If the ARR is [4,6,9,11,1,2,2] and ‘VAL’ is 4, the answer will be ‘YES’ as 4 exist in ‘ARR’.
Try solving now
03
Round
Medium
Face to Face
Duration30 minutes
Interview date20 Jul 2022
Coding problem2

- Morning time
- Environment was good.
- No
- Interviewer was good

NOTE : It was a round with the senior engineering director of the team, where he tested my knowledge of OOPS, OS, Data structures and Algorithm

1. Find Slope

Easy
22m average time
88% success
0/40
Asked in companies
Morgan StanleyHSBCJungleworks

Given a linked list, whose nodes represent the coordinates of the cartesian plane. Find the minimum and the maximum slope of simultaneous points of coordinates.

Linked List : P1(X1, Y1) -> P2( X2, Y2) -> P3(X3, Y3).

Here P1(point1) corresponds to coordinates (X1, Y1), similarly P2(point2) corresponds to coordinates (X2, Y2).

Your task is to find the Maximum(Slope(P1, P2), Slope(P2, P3)) and Minimum(Slope(P1, P2), Slope(P2, P3)).

Note :
You only need to return the starting node for minimum and maximum slope. So if slope(P1, P2) is maximum, just return P1.

In case of more than one possible solution return the first occurring solution.
Problem approach

s1 - minimum and the maximum slope of simultaneous points of coordinates., Apply the Maximum(Slope(P1, P2), Slope(P2, P3)) and Minimum(Slope(P1, P2), Slope(P2, P3)).
s2 - Apply minimum algorithm

Try solving now

2. Operating System Questions

What are semaphores?
What is virtual memory?

Problem approach

Tip 1 : Read Galvin for OS thoroughly.
Tip 2 : Do practice for SQL queries.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 3 problems
Interviewed by Rakuten India
1626 views
0 comments
0 upvotes
company logo
SDE - 2
6 rounds | 10 problems
Interviewed by Rakuten India
1524 views
1 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Rakuten India
923 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Rakuten India
958 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE
4 rounds | 6 problems
Interviewed by HashedIn
713 views
0 comments
0 upvotes
company logo
SDE
2 rounds | 4 problems
Interviewed by HCL Technologies
997 views
0 comments
0 upvotes
company logo
SDE
2 rounds | 4 problems
Interviewed by HCL Technologies
0 views
0 comments
0 upvotes