Rakuten India interview experience Real time questions & tips from candidates to crack your interview
Software Engineer Intern
Rakuten India
2 rounds | 2 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3 months
Topics: Data Structures, OOPS, Algorithms, SQL, Low Level Design
Tip 1 : Stay consistent for at least 90 days to build confidence with DSA.
Tip 2 : Practice Leetcode medium primarily.
Tip 3 : Make notes of every problem.
Application process
Where: Company Website
Eligibility: No criteria
Tip 1 : Keep it clean and simple.
Tip 2 : Have knowledge of everything written.
Interview rounds
01
Round
Medium
Face to Face
Duration40 minutes
Interview date25 Apr 2022
Coding problem1
It was Leetcode seen the question of medium level.
1. Jump Game
Moderate
25m average time
75% success
0/80
Asked in companies
There is an array 'JUMP' of size 'N' which is 1-indexed and you are currently at index 1. Your goal is to reach index 'N' (end).
When you are at index 'i', you can jump a maximum length of 'JUMP[i]' which means you can make a jump of size 1 to JUMP[i]. Return true if you can reach the end otherwise false.
Example:-
N = 5
JUMP = [1,2,3,4,5]
ANSWER:- The answer should be YES as you can jump from 1st index to 2nd index, from 2nd index to 4th index, and from 4th index to 5th index.
Problem approach
First I used recursion.
Then memoization to optimize a bit and finally DP. The interviewer was satisfied so I coded the solution.
02
Round
Medium
Face to Face
Duration40 minutes
Interview date25 Apr 2022
Coding problem1
It was in the afternoon. Interviewer was nice.
1. Generate all parenthesis
Moderate
30m average time
85% success
0/80
Asked in companies
You are given an integer 'N', your task is to generate all combinations of well-formed parenthesis having ‘N’ pairs.
A parenthesis is called well-formed if it is balanced i.e. each left parenthesis has a matching right parenthesis and the matched pairs are well nested.
For Example:
For ‘N’ = 3,
All possible combinations are:
((()))
(()())
(())()
()(())
()()()
Problem approach
The idea is intuitive. Use two integers to count the remaining left parenthesis (n) and the right parenthesis (m) to be added. At each function call add a left parenthesis if n >0 and add a right parenthesis if m>0. Append the result and terminate recursive calls when both m and n are zero.
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 the best case time complexity of Bubble Sort?
Choose another skill to practice
Similar interview experiences
SDE - 1
2 rounds | 6 problems
Interviewed by Rakuten India
Rejected
2355 views
0 comments
0 upvotes
SDE - Intern
4 rounds | 4 problems
Interviewed by Rakuten India
Selected 1250 views
0 comments
0 upvotes
Workday consultant
3 rounds | 3 problems
Interviewed by Rakuten India
Selected 995 views
0 comments
0 upvotes
Associate Software Engineer
3 rounds | 5 problems
Interviewed by Rakuten India
Selected 1001 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Engineer Intern
3 rounds | 9 problems
Interviewed by NCR Corporation
Selected 1286 views
0 comments
0 upvotes
Software Engineer Intern
2 rounds | 2 problems
Interviewed by CIS - Cyber Infrastructure
Selected 630 views
1 comments
0 upvotes