AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
i
Rakuten
Work with us 
Compare
Filter interviews by
Rakuten Software Developer Interview Questions and Answers
6 Interview questions
Polymorphism in Java allows objects of different classes to be treated as objects of a common superclass.
Polymorphism is achieved through method overriding and method overloading.
Method overriding allows a subclass to provide a specific implementation of a method that is already provided by its superclass.
Method overloading allows multiple methods with the same name but different parameters in the same class.
Polym...
Method overriding in Java allows a subclass to provide a specific implementation of a method that is already provided by its superclass.
In method overriding, a subclass provides a specific implementation of a method that is already provided by its superclass.
The method in the subclass must have the same name, return type, and parameters as the method in the superclass.
Method overriding is used to achieve runtime p...
JVM stands for Java Virtual Machine, which is a virtual machine that enables a computer to run Java programs.
JVM is an abstract computing machine that enables a computer to run Java programs.
It provides a runtime environment in which Java bytecode can be executed.
JVM is platform-independent, meaning Java code can run on any device that has a JVM installed.
It manages memory, provides security, and facilitates garba...
Reverse a Stack Using Recursion
You are given a stack of integers. Your task is to reverse the stack using recursion without using any extra space other than the internal stack space used due to recursion....
Reverse a stack using recursion without using any extra space other than the internal stack space.
Use recursion to pop all elements from the original stack and store them in function call stack
Once the stack is empty, push the elements back in reverse order using recursion
Make use of auxiliary functions to handle the recursion process
Objects in JVM memory are created on the heap and managed by the garbage collector.
Objects are created on the heap memory in JVM.
Memory for objects is allocated using the 'new' keyword.
Objects are managed by the garbage collector to reclaim unused memory.
Garbage collector uses different algorithms like Mark-Sweep, G1, etc.
Example: 'String str = new String("Hello World");'
Merge Two Sorted Arrays Problem Statement
Given two sorted integer arrays ARR1 and ARR2 of size M and N, respectively, merge them into ARR1 as one sorted array. Assume that ARR1 has a size of M + N to hold...
Merge two sorted arrays into one sorted array in place.
Iterate from the end of both arrays and compare elements to merge in place
Use two pointers to keep track of the current position in each array
Handle cases where one array is fully merged before the other
Rakuten Software Developer Interview Experiences
4 interviews found
I applied via Referral and was interviewed in Dec 2024. There were 2 interview rounds.
Hld question and coding question
Web crawler assignment to crawl e-commerce websites
I applied via Campus Placement
Simple coding question based on strong manipulation.
(1 Question)
- Q1. SQL,project,oops and dsa
I appeared for an interview in Dec 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions on DSA.
- Q1.
Merge Two Sorted Arrays Problem Statement
Given two sorted integer arrays
ARR1andARR2of size M and N, respectively, merge them intoARR1as one sorted array. Assume thatARR1has a size of M + N to hol... - Ans.
Merge two sorted arrays into one sorted array in place.
Iterate from the end of both arrays and compare elements to merge in place
Use two pointers to keep track of the current position in each array
Handle cases where one array is fully merged before the other
- Q2.
Reverse a Stack Using Recursion
You are given a stack of integers. Your task is to reverse the stack using recursion without using any extra space other than the internal stack space used due to recursion...
- Ans.
Reverse a stack using recursion without using any extra space other than the internal stack space.
Use recursion to pop all elements from the original stack and store them in function call stack
Once the stack is empty, push the elements back in reverse order using recursion
Make use of auxiliary functions to handle the recursion process
(4 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with question on OOPS.
- Q1. What is the JVM?
- Ans.
JVM stands for Java Virtual Machine, which is a virtual machine that enables a computer to run Java programs.
JVM is an abstract computing machine that enables a computer to run Java programs.
It provides a runtime environment in which Java bytecode can be executed.
JVM is platform-independent, meaning Java code can run on any device that has a JVM installed.
It manages memory, provides security, and facilitates garbage co...
- Q2. How are objects created and managed in JVM memory?
- Ans.
Objects in JVM memory are created on the heap and managed by the garbage collector.
Objects are created on the heap memory in JVM.
Memory for objects is allocated using the 'new' keyword.
Objects are managed by the garbage collector to reclaim unused memory.
Garbage collector uses different algorithms like Mark-Sweep, G1, etc.
Example: 'String str = new String("Hello World");'
- Q3. What is polymorphism in Java?
- Ans.
Polymorphism in Java allows objects of different classes to be treated as objects of a common superclass.
Polymorphism is achieved through method overriding and method overloading.
Method overriding allows a subclass to provide a specific implementation of a method that is already provided by its superclass.
Method overloading allows multiple methods with the same name but different parameters in the same class.
Polymorphi...
- Q4. Can you explain method overriding in Java?
- Ans.
Method overriding in Java allows a subclass to provide a specific implementation of a method that is already provided by its superclass.
In method overriding, a subclass provides a specific implementation of a method that is already provided by its superclass.
The method in the subclass must have the same name, return type, and parameters as the method in the superclass.
Method overriding is used to achieve runtime polymo...
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I applied via Recruitment Consultant and was interviewed in Aug 2021. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. Good and basic
Interview Preparation Tips
Top trending discussions
Interview questions from similar companies
Software Developer Interview Questions & Answers
Bounteous x Accolite
Anonymous
posted on 11 Mar 2022
I appeared for an interview before Mar 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.
- Q1.
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
- 0 - representing an empty cell
- 1 - representing a fre...
- Ans.
Find the minimum time required to rot all fresh oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process
Track the time taken to rot all oranges and return -1 if any fresh oranges remain
Handle edge cases like no fresh oranges or all oranges already rotten
Consider using a queue to efficiently process adjacent oranges
- Q2.
Majority Element Problem Statement
Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.
Exampl...
- Ans.
Find the majority element in an array, return -1 if no majority element exists.
Iterate through the array and keep track of the count of each element using a hashmap.
Check if any element's count is greater than floor(N/2) to determine the majority element.
Return the majority element or -1 if no majority element exists.
- Q3.
Maximum Path Sum Between Two Leaves Problem Description
You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...
- Ans.
Find the maximum path sum between two leaf nodes in a binary tree.
Traverse the tree to find the maximum path sum between two leaf nodes.
Keep track of the maximum sum found so far.
Consider all possible paths between leaf nodes.
Handle cases where the tree has only a single leaf node.
Implement a recursive function to calculate the maximum path sum.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This was a technical round with DSA based questions.
- Q1.
N-th Node From The End Problem Statement
You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.
Example:
Input:
If the given list is (1 -> -2 -&g...
- Ans.
Find the N-th node from the end of a Singly Linked List of integers.
Traverse the list to find the length L of the list.
Calculate the position of the N-th node from the beginning as L - N + 1.
Traverse the list again to reach the calculated position and return the node's value.
- Q2.
LCA of Binary Tree Problem Statement
You are given a binary tree consisting of distinct integers and two nodes,
XandY. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes... - Ans.
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the LCA.
Handle cases where one node is an ancestor of the other or when one node is the LCA itself.
- Q3.
Reverse Words in a String: Problem Statement
You are given a string of length
N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o... - Ans.
Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.
Split the input string by spaces to get individual words
Reverse the list of words
Join the reversed words with a single space in between
Handle leading/trailing spaces by stripping them before and after reversing
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions based on DSA
- Q1.
Minimum Time To Solve The Problems
Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...
- Ans.
Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.
Sort subjects in descending order
Assign subjects to friends one by one until all subjects are assigned
The maximum workload will be the sum of problems assigned to the friend with the most problems
Return the maximum workload as the minimum time required
- Q2. What is grammar in the context of compiler design?
- Ans.
Grammar in compiler design defines the syntax and structure of a programming language.
Grammar specifies the rules for forming valid statements in a programming language.
It consists of a set of production rules that define how valid programs can be constructed.
There are different types of grammars such as context-free grammar, regular grammar, etc.
Example: In C programming language, the grammar specifies that a for loop...
- Q3. What is a token in compiler design?
- Ans.
A token in compiler design is a basic unit of syntax that the compiler can understand and process.
Tokens are the smallest units of a program that are meaningful to the compiler.
Examples of tokens include keywords, identifiers, operators, and punctuation symbols.
Tokens are generated by the lexical analysis phase of the compiler.
Tokens are used by the parser to build the abstract syntax tree of the program.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.
- Q1.
Sum Root to Leaf Numbers
You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...
- Ans.
Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.
Traverse the binary tree from root to leaf nodes, keeping track of the current path sum
Add the current path sum to the total sum when reaching a leaf node
Use modulo (10^9 + 7) to handle large outputs
- Q2. What is a regular language?
- Ans.
A regular language is a language that can be recognized by a finite automaton.
Regular languages can be described by regular expressions.
Regular languages are closed under union, concatenation, and Kleene star operations.
Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.
- Q3. What are NP and NP-Hard problems?
- Ans.
NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.
NP problems can be verified in polynomial time but not necessarily solved in polynomial time.
NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.
Examples of NP problems include the subset sum problem and the traveling salesm...
Round duration - 30 minutes
Round difficulty - Easy
That was the round for which I’ve been waiting for hours
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
We were supposed to give test in any time between 3 PM to 9 PM.
- Q1.
Total Unique Paths Problem Statement
You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...
- Ans.
The problem involves finding the total number of unique paths from the top-left to bottom-right cell of a matrix by moving only right or down.
Use dynamic programming to solve the problem efficiently.
Create a 2D array to store the number of unique paths at each cell.
Initialize the first row and first column with 1 as there is only one way to reach them.
For each cell (i, j), the number of unique paths is the sum of paths...
- Q2.
Subtree Node Count Problem
We are provided with a tree containing 'N' nodes, numbered from 0 to N-1. The objective is to determine the total number of nodes within each subtree of the provided tree. Speci...
- Ans.
Given a tree with N nodes, find the number of elements in each subtree rooted at every node.
Traverse the tree using Depth First Search (DFS) to calculate subtree sizes for each node.
Use an array to store subtree sizes for each node, starting with leaf nodes having size 1.
The subtree size of a node is the sum of subtree sizes of its children plus 1 for the node itself.
(1 Question)
Round duration - 120 minutes
Round difficulty - Medium
Pair Programming Interview( this round is similar to machine coding round) it started around 11 AM
Focus Areas: Problem solving and implementation of extensions.
The pair coding round is focused on OOPS concepts. You are paired with a TWer for this round. They let you code first for an hour and in the next hour they review your code and suggest changes which would improve the code structure, readability and make it modular and reusable and functional.
- Q1.
River Crossing: Help Ninja Cross Over
Ninja stands at the start of a wooden bridge over a river. Some segments of the bridge are damaged. The undamaged segments, marked as 'safe', are listed in an array
S... - Ans.
Check if Ninja can cross the river by jumping from one safe segment to another based on given constraints.
Iterate through the 'SAFE' array and check if Ninja can make the required jumps to reach the last safe segment.
Ensure that the next jump is either 'X' - 1, 'X', or 'X' + 1 units from the previous jump.
Return 'true' if Ninja can successfully cross the river, otherwise return 'false'.
(1 Question)
Round duration - 120 minutes
Round difficulty - Medium
Students who were shortlisted from Pair Programming round was selected for this round around 3 PM. In this round there were two interviewer.
- Q1.
Middle of a Linked List
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...
- Ans.
Return the middle element of a singly linked list, or the one farther from the head if there are even elements.
Traverse the linked list with two pointers, one moving twice as fast as the other
When the fast pointer reaches the end, the slow pointer will be at the middle
Return the element pointed to by the slow pointer
Interview Preparation Tips
Tip 1 : Have good grasp on OOPS since they have a round named Pair Programming round which is focused upon this.
Tip 2 : Write clean, modular and functional code.
Tip 3 : Practice Data Structures and Algorithms
Tip 4 : You should know breadth and depth of whatever is mentioned in your resume.
Tip 5 : Be loud and clear.
Tip 1 : Make single page resume.
Tip 2 : Mention relevant things on resume.
Tip 3 : Do not put any false things on resume. Projects, internships you are mentioning be ready to answer questions related to it regarding what you solved, idea, databases, design.
Tip 4 : Contribute in open source, participate in hackathons.
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Bounteous x Accolite
Anonymous
posted on 27 Jul 2022
I applied via Campus Placement and was interviewed before Jul 2021. There were 5 interview rounds.
Round 1 was about 60 mins long. Basic Aptitude questions along with Programming MCQ
Round 2 had 2 coding questions with a time limit of 60mins. Intermediate level problem solving
knowledge is neccessary.
(1 Question)
- Q1. Technical Round 1 was 1hr long. Detailed Insights about my project and a few programming questions in DSA
(1 Question)
- Q1. This Technical Round 2 was 1hr long and was mainly focused on problem solving skills and a few basic programming concepts.
(1 Question)
- Q1. Three Situational questions were asked .
Interview Preparation Tips
- Data Structures
- Algorithms
- CPP
- Problem Solving
I applied via Approached by Company and was interviewed before Mar 2021. There were 4 interview rounds.
DSA
About Social changes
(2 Questions)
- Q1. Tell me about yourself.
- Q2. Very basic questions
Interview Preparation Tips
- DSA
Software Developer Interview Questions & Answers
Bounteous x Accolite
Deepak Kumar
posted on 12 Jun 2021
I applied via Campus Placement and was interviewed in Dec 2020. There was 1 interview round.
Interview Questionnaire
2 Questions
- Q1. 1. If you given a no return its corresponding excel no.
- Ans.
Convert given no to corresponding excel no.
Excel no starts from 1 and goes up to 16384
Excel no is calculated using column and row numbers
For example, 1 corresponds to A, 27 corresponds to AA, 28 corresponds to AB, and so on
- Q2. 2. find unique character in a window of k size in a string
- Ans.
Find unique characters in a window of k size in a string.
Use a sliding window approach.
Maintain a hash table to keep track of character frequency.
Remove characters from hash table as the window slides.
Interview Preparation Tips
Skills evaluated in this interview
kalyani rathore
(1 Question)
- Q1. Interview was good but questions asked was very hard. You must have good technical knowledge.
Interview Preparation Tips
Rakuten Interview FAQs
Tell us how to improve this page.
Rakuten Interviews By Designations
- Rakuten Software Engineer Interview Questions
- Rakuten Senior Software Engineer 2 Interview Questions
- Rakuten Software Developer Interview Questions
- Rakuten Intern Interview Questions
- Rakuten Data Engineer Interview Questions
- Rakuten Associate Software Engineer Interview Questions
- Rakuten Software Engineer Level 1 Interview Questions
- Rakuten Data Scientist Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Java Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Application Developer Interview Questions
- Salesforce Developer Interview Questions
- Software Development Engineer Interview Questions
- Developer Interview Questions
- Show more
Overall Interview Experience Rating
based on 2 interview experiences
Difficulty level
Duration
Software Developer Interview Questions from Similar Companies
Rakuten Software Developer Reviews and Ratings
based on 8 reviews
Rating in categories
|
Software Engineer
269
salaries
|  ₹6 L/yr - ₹14 L/yr |
|
Senior Software Engineer
245
salaries
| ₹17.5 L/yr - ₹31 L/yr |
|
Technical Lead
218
salaries
| ₹27 L/yr - ₹44.1 L/yr |
|
Senior Software Engineer 2
152
salaries
| ₹22 L/yr - ₹39.5 L/yr |
|
Devops Engineer
148
salaries
| ₹3.8 L/yr - ₹31.7 L/yr |
Amazon
eBay
Netflix
Xoriant
- Home >
- Interviews >
- Rakuten Interview Questions
