Rakuten Software Engineer Level 1 Interview Questions and Answers

1 hour, 2 DSA questions. Easy

Q1. Data Structures and Algorithms round
Add your answer
Q2. Right view and bottom view of tree.
Ans. 
The right view of a tree shows the rightmost node at each level, while the bottom view shows the bottommost node at each horizontal distance.
• To find the right view, perform a level order traversal and keep track of the rightmost node at each level.

• To find the bottom view, perform a vertical order traversal and keep track of the bottommost node at each horizontal distance.

• Both views can be represented as arrays of strin...read more
Answered by AI
Add your answer
Q3. Merge intervals
Add your answer

Q1. Minimum number of runways required
Ans. 
The minimum number of runways required depends on the number of aircrafts and their arrival and departure times.
• Consider the number of aircrafts that will be arriving and departing at the same time.

• Calculate the maximum number of aircrafts that will be on the ground at any given time.

• Each aircraft requires a separate runway for landing and takeoff.

• The minimum number of runways required is equal to the maximum number of
Answered by AI
Add your answer
Q2. Some question related to binary tree
Add your answer

Q1. Asked about past projects. Leadership principle questions answered in STAR format
Add your answer

Q1. Basic array question
Add your answer

Q1. Find the first circular tour that visits all petrol pumps
Ans. 
The first circular tour that visits all petrol pumps can be found using the concept of a circular linked list.
• Create a circular linked list with each node representing a petrol pump

• Calculate the difference between petrol available at each pump and the distance to the next pump

• Start from a pump where the sum of differences is positive and traverse the circular linked list until completing the tour
Answered by AI
Add your answer

First round was a aptitude test of 25 question

Q1. Oops concept in java
Ans. 
Oops concept in Java refers to Object-Oriented Programming principles like inheritance, encapsulation, polymorphism, and abstraction.
• Inheritance allows a class to inherit properties and behavior from another class.

• Encapsulation involves bundling data and methods that operate on the data into a single unit.

• Polymorphism allows objects to be treated as instances of their parent class.

• Abstraction hides the implementation d...read more
Answered by AI
Add your answer
Q2. Basic multi threading questions
Add your answer

Q1. Code to make a pattern and explain each and every line of code
Ans. 
Code to create a pattern and explain each line of code
• Start by defining the number of rows and columns in the pattern

• Use nested loops to iterate through each row and column

• Decide the pattern you want to create and use conditional statements to determine the output for each position
Answered by AI
Add your answer
Q2. Puzzle: In how many minimum cut u can cut a cake in 8 piece
Add your answer

Q1. Basic SQL question.
Add your answer
Q2. Order of execution
Ans. 
The order of execution refers to the sequence in which instructions or operations are executed in a program.
• The order of execution is determined by the programming language and the specific code being executed.

• Generally, code is executed line by line from top to bottom.

• However, there are exceptions such as loops, conditionals, and function calls that can alter the order of execution.

• In some programming languages, there...read more
Answered by AI
Add your answer
Q3. Window functions
Add your answer
Q4. Aggregate functions
Add your answer

Q1. Level order tree traversal
Add your answer
Q2. Find the pair element from the array
Ans. 
Find the pair element from the array
• Iterate through the array and use a hashmap to store elements and their counts

• Check if the current element's complement exists in the hashmap

• Return the pair if found, otherwise return null
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This was MCQ+Coding round.

Q1. How can you check if two strings are anagrams of each other?
Ans. 
Check if two strings are anagrams by comparing the sorted versions of the strings.
• Sort both strings and compare if they are equal.

• Use a hashmap to store the frequency of characters in each string and compare the maps.

• Ignore spaces and punctuation when comparing the strings.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.