AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
i
Rakuten
Compare
Filter interviews by
Clear (1)
Rakuten Golang Developer Interview Questions and Answers
Rakuten Golang Developer Interview Experiences
1 interview found
Anonymous
I applied via LinkedIn and was interviewed in May 2024. There was 1 interview round.
(2 Questions)
- Q1. All possible permutations of string
- Ans.
Generate all possible permutations of a given string
Use recursion to generate permutations
Swap characters to create different permutations
Store permutations in an array of strings
- Q2. SQL query to get employees coming to office
- Ans.
Use SQL query with WHERE clause to filter employees coming to office.
Use SELECT statement to retrieve data from the database.
Use WHERE clause to filter employees based on coming to office.
Consider using a column in the database that indicates whether an employee is coming to office or not.
Interview Preparation Tips
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
I was interviewed before Feb 2021.
(1 Question)
Round duration - 65 minutes
Round difficulty - Easy
There were 2 sections –
Aptitude and Logical Reasoning and MCQ based on Java question ,C++, coding for 20 min and 45 min respectively.
Section A- Not very difficult to clear this round although less time was a problem.
Section B- It contains 15 multiple choice question on c/c++,java and 4 simple coding questions
- Q1.
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's
nextpoints back to a previous node in the ... - Ans.
Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.
Traverse the linked list using two pointers, one moving at double the speed of the other.
If the two pointers meet at any point, there is a cycle in the linked list.
Use Floyd's Cycle Detection Algorithm for O(N) time complexity and O(1) space complexity.
(3 Questions)
Round duration - 75 minutes
Round difficulty - Medium
It was an online coding test in which 3 coding question were given.
- Q1.
Smallest Window Problem Statement
Given two strings,
SandX, your task is to find the smallest substring inSthat contains all the characters present inX.Example:
Input:
S = "abdd", X = "bd"
Outpu...
- Ans.
Find the smallest substring in string S that contains all characters in string X.
Iterate through string S and keep track of characters in X found in a window
Use two pointers to maintain the window and slide it to find the smallest window
Return the smallest window containing all characters in X
- Q2.
Smallest Integer Not Representable as Subset Sum
Given a non-decreasing sorted array
ARRofNpositive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from... - Ans.
Find the smallest positive integer that cannot be expressed as the sum of elements from any proper subset of a non-decreasing sorted array of positive numbers.
Start with the smallest possible integer that cannot be represented, which is 1.
Iterate through the array and update the smallest integer that cannot be represented.
If the current element is greater than the smallest integer that cannot be represented, return tha...
- Q3.
Minimum Steps for a Knight to Reach Target
Given a square chessboard of size 'N x N', determine the minimum number of moves a Knight requires to reach a specified target position from its initial position...
- Ans.
Calculate the minimum number of moves a Knight needs to reach a target position on a chessboard.
Implement a function that takes knight's starting position, target position, and chessboard size as input
Use breadth-first search algorithm to find the shortest path for the Knight
Consider all possible 8 movements of the Knight on the chessboard
Return the minimum number of moves required for the Knight to reach the target po
(4 Questions)
Round duration - 60 minutes
Round difficulty - Easy
It started with a discussion on the programs given in coding round. They asked me about my interest field after that they directly jumped into Networking, Linux and Ethical Hacking part looking my interest domain. They asked me various question on networking and linux.
Then they asked me to code a simple c program
- Q1.
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link... - Ans.
Reverse a singly linked list of integers and return the head of the reversed linked list.
Iterate through the linked list and reverse the pointers to point to the previous node.
Keep track of the current, previous, and next nodes while reversing the linked list.
Update the head of the reversed linked list as the last node encountered during reversal.
- Q2. What are the port numbers of protocols such as FTP and SMTP?
- Ans.
FTP uses port number 21 and SMTP uses port number 25.
FTP uses port 21 for data transfer and port 20 for control information.
SMTP uses port 25 for email communication.
Understanding port numbers is important for network communication.
- Q3. Can you explain the OSI Model?
- Ans.
The OSI Model is a conceptual framework that standardizes the functions of a telecommunication or computing system into seven layers.
The OSI Model stands for Open Systems Interconnection Model.
It consists of seven layers: Physical, Data Link, Network, Transport, Session, Presentation, and Application.
Each layer has specific functions and communicates with the adjacent layers.
Example: Layer 1 (Physical) deals with physi...
- Q4. How do you copy files in Linux?
- Ans.
To copy files in Linux, you can use the 'cp' command.
Use the 'cp' command followed by the source file and destination directory to copy a file.
To copy a directory and its contents, use the '-r' flag with the 'cp' command.
You can also use wildcards like '*' to copy multiple files at once.
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
Interview Questionnaire
8 Questions
- Q1. Find out the subset of an array of continuous positive numbers from a larger array whose sum of of the elements is larger in comparision to other subset. eg: {1,2 5 -7, 2 5} .The two subarrays are {1,2,5} ...
- Ans.
Find the subset of an array with the largest sum of continuous positive numbers.
Iterate through the array and keep track of the current sum and the maximum sum seen so far.
If the current element is positive, add it to the current sum. If it is negative, reset the current sum to 0.
Also keep track of the start and end indices of the maximum sum subset.
Return the subset using the start and end indices.
- Q2. Given two classes C1 and C2 which are almost same.(remember not exactly same). You want to choose best among these classes so that it can be use as key in hashmap. What question will you ask regarding two ...
- Q3. You are given two strings s1 and s2.Now, find the smallest substring in s1 containing all characters of s2
- Ans.
Find smallest substring in s1 containing all characters of s2.
Create a hash table of characters in s2
Use sliding window technique to find smallest substring in s1
Check if all characters in s2 are present in the substring
Update the smallest substring if a smaller one is found
- Q4. Questions on OOPS (almost all the concepts were covered like polymorphism, overriding, overloading, inheritance, concept of virtual fxns etc.)
- Q5. Write algo for reversing a linked list
- Ans.
Algorithm to reverse a linked list
Create a new empty linked list
Traverse the original linked list and insert each node at the beginning of the new list
Return the new list
- Q6. What is lazy loading? Advantages and disadvantages of the same?
- Ans.
Lazy loading is a technique used to defer the loading of non-critical resources until they are needed.
Advantages: faster initial page load, reduced bandwidth usage, improved user experience
Disadvantages: increased complexity, potential for slower subsequent page loads, difficulty with SEO
Examples: images, videos, and other media files can be loaded only when they are visible on the screen
- Q7. How ajax works? Difference between angular js and jquery?
- Ans.
Ajax is a technique for creating fast and dynamic web pages. AngularJS is a framework for building dynamic web applications, while jQuery is a library for simplifying HTML DOM traversal and manipulation.
Ajax stands for Asynchronous JavaScript and XML
It allows web pages to be updated asynchronously by exchanging data with a web server behind the scenes
AngularJS is a JavaScript framework that extends HTML with new attrib...
- Q8. Design a traffic light system?
- Ans.
A traffic light system controls the flow of traffic at intersections.
The system consists of three lights: red, yellow, and green.
Each light has a specific duration for which it stays on.
The system also includes sensors to detect the presence of vehicles and pedestrians.
The duration of each light can be adjusted based on traffic patterns.
The system can be connected to a central control system for remote monitoring and m
Interview Preparation Tips
College Name: na
Skills evaluated in this interview
I was interviewed before Feb 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical round with 3 problems based on DSA and Algorithms.
- Q1.
Smallest Integer Not Representable as Subset Sum
Given a non-decreasing sorted array
ARRofNpositive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from... - Ans.
Find the smallest positive integer that cannot be expressed as the sum of elements from any proper subset of a given array.
Sort the array in non-decreasing order.
Iterate through the array and keep track of the smallest sum that can be formed.
If the next element in the array is greater than the current sum + 1, then the answer is the current sum + 1.
Return the answer as the smallest integer not representable as a subset
- Q2.
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link... - Ans.
Reverse a singly linked list of integers and return the head of the reversed linked list.
Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.
Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.
Update the head of the reversed linked list to be the last node encountered during the reversal process.
- Q3.
Smallest Window Problem Statement
Given two strings
SandXcontaining random characters, the task is to find the smallest substring inSwhich contains all the characters present inX.Input:
The first... - Ans.
The task is to find the smallest substring in string S which contains all the characters present in string X.
Iterate through string S and keep track of characters in X using a hashmap
Use two pointers to maintain a sliding window and find the smallest window containing all characters in X
Return the smallest window found
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions based on OOPS and Angular.
- Q1. What are the different OOP concepts?
- Ans.
OOP concepts include inheritance, encapsulation, polymorphism, and abstraction.
Inheritance allows a class to inherit properties and behavior from another class.
Encapsulation restricts access to certain components of an object, protecting its integrity.
Polymorphism allows objects to be treated as instances of their parent class.
Abstraction hides the complex implementation details of an object and only shows the necessar
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Questions based on System Design, ajax, jquery were asked.
- Q1. How would you design a traffic light system?
- Ans.
Designing a traffic light system involves creating a system that controls the flow of traffic at intersections.
Divide the traffic light system into three main lights: red, yellow, and green.
Implement timers to control the duration of each light.
Include sensors to detect the presence of vehicles and pedestrians.
Consider implementing a pedestrian crossing signal.
Integrate a central control system to coordinate the timing
- Q2. How does AJAX work?
- Ans.
AJAX allows for asynchronous communication between client and server without needing to reload the entire page.
AJAX stands for Asynchronous JavaScript and XML.
It allows for sending and receiving data from a server without reloading the entire page.
AJAX uses XMLHttpRequest object to make requests to the server.
It can update parts of a web page without requiring a full page reload.
Commonly used in web applications to pro
- Q3. What is the difference between AngularJS and jQuery?
- Ans.
AngularJS is a full-fledged MVC framework for building dynamic web applications, while jQuery is a lightweight library for DOM manipulation and event handling.
AngularJS is a full-fledged MVC framework, providing features like two-way data binding, dependency injection, and routing.
jQuery is a lightweight library primarily used for DOM manipulation and event handling.
AngularJS is suitable for building single-page applic...
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
Interview Preparation Tips
Experience: GD was conducted for shortlisted candidates and candidates were divided into groups of 6 people.There were 3 topics and each topic was discussed for 2 minutes.No specific rules,like each person needs to speak,are to be followed during the GD.Anyone can initiate,intervene,etc. Finally we were asked to link all three topics and this discussion went on for another 2 minutes.
Round: HR Interview
Experience: Only a single round lasting about 40-45 minutes.There were only 4 people in the panel and technical as well as HR questions were asked. First I was asked to go through my own resume, “Introduce/Tell us about yourself?". E.g.:“Where have you shown leadership qualities?Have you led a
team?Size of team? What new initiatives did you take?”.Core questions starting form basics like “How does an airplane fly?” to specific questions about the different types of engines used in airplanes,their specifications, etc. were asked. HR questions were put up like"What was the most difficult decision in your life?" and grilled on my internship for 15-20 minutes which I did in Transocean. (Another oil field services company).
General Tips: You need to be very good in the basics of your
core courses and if you have done an internship in the oil industry,
you will definitely be grilled on that.Questions will be asked in quick succession.
Skill Tips: Highlight any intern in Oil industry or anything related to that in your resume.Any POR or any sport activity which shows your leadership qualities should me mentioned in your resume.
Skills: Leadership qualities, Athletic, Quick thinking, presence of mind
College Name: IIT MADRAS
Adithya H K Upadhya
Interview Preparation Tips
Experience: An aptitude test which was followed by three rounds of technical interviews and finally the HR interview.
Round: HR Interview
Experience: Snapdeal offered placements for 5 students (3 from CS and 2 from IT).
General Tips: Be extremely well prepared for any company. Research about the company's profile extensively before the company's interview. HR panel always looks for candidates who are well aware of the company in order to measure the candidate's interest. Data structures are absolutely necessary for any company. Improve coding skills through frequent participation in competitive programming arena such as codeForces, codeChef, HackerEarth etc. "Software development job profile was offered to me.
Unnecessary and irrelevant questions are to be avoided. We should raise questions only if we have some genuine questions. However any question related to job profile or location preference could be raised. "
"It was very grueling and tiring at first but the sweet taste of placement makes it all worth it.
Placements are a turning point in everybody's career."
Skill Tips: Snapdeal is more focussed on Data structures and object oriented technology.
For data structures, online materials such as GeeksforGeeks are excellent and in case of OOPS concepts, stronghold in either C++ or java programming language is necessary.
Skills:
College Name: NIT Surathkal
Aman Jain
Interview Preparation Tips
Experience: Algorithmic coding test was conducted on hackerank platform. Around 60 students gave online test. There were 4-5 algo questions to be done in 90 mins duration.
Tips: Try to do at least 2 questions.
Round: Technical Interview
Experience: First Interviewer asked me to introduce myself. Then he asked me questions on data structures & Algo. He asked me about tree data structures, why it is used, time complexities of various operations on tree, balancing of tree, AVL Tree. He asked me write AVL Tree insertion, deletion, update code. Then he jumps to BTree, B+Tree and asks me write code on paper for various operations. Questions were asked on indexing, various types of indexing, how it is used in databases, etc. Then he briefly asked about the project I done in my internship.
Round: Technical Interview
Experience: Interviewer asked me how was my 1st round, I said it was great. He first asked me introduce myself. Then he asked about my projects mentioned in my resume. I done a project in machine learning on spam webpage detection. He was interested in that. He asked me what language, libraries I used to implement that project. Then he gave me real time scenario to predict whether an item is explosive or not. Then I approached this problem and asked information related to problem. He was impressed by the approach I target the problem. He asked me what machine learning model will be best and what are their pros and cons. Then he asked me question that given 100 sorted linked lists, you have to merge them and return single sorted linked list. I gave 3-4 solutions with their time & space complexities.
Round: HR Interview
Experience: Interviewer asked me common HR questions like tell me about yourself, my family background, why do you want to join the company, what impact you can make in Snapdeal, why should we hire you. After that he congratulated me for the role of SDE at Snapdeal. I was very happy at that moment.
All the 5 students cleared this round.
Skills: SQL, ML, Algorithms And Data Structures, Python, Basic C/C++
College Name: IIT Guwahati
I was interviewed before Apr 2021.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Easy
There were 22 MCQ questions of aptitude and technical based while 3 questions were of coding type.
Tips: MCQ questions were not time consuming , so try to do that questions in less time , so you will get enough time for coding questions.
- Q1.
Balanced Parentheses Check
Given a string
STRconsisting solely of the characters '{', '}', '(', ')', '[', and ']', determine whether the parentheses are balanced.Input:
The first line contains an inte... - Ans.
Implement a function to check if parentheses in a string are balanced.
Use a stack to keep track of opening parentheses and pop when a closing parenthesis is encountered.
If the stack is empty when a closing parenthesis is encountered or if there are unmatched parentheses at the end, return 'NO'.
Ensure that all opening parentheses have a corresponding closing parenthesis in the correct order.
Return 'YES' if all parenthes...
- Q2.
Find the Next Greater Number with the Same Set of Digits
Given a string
Sthat represents a number, determine the smallest number that is strictly greater than the original number and has the same set of ... - Ans.
The task is to find the smallest number greater than the given number with the same set of digits.
Sort the digits of the number in descending order.
Find the first digit from the right that is smaller than the digit to its right.
Swap this digit with the smallest digit to its right that is greater than it.
Sort all the digits to the right of the swapped digit in ascending order to get the smallest number greater than the
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
My experience was very awesome , I answered all the questions , although in starting I was very nervous , so at starting interviewer help me get my confidence, interviewer was very helpful.
- Q1.
Maximum Level Sum in Binary Tree Problem Statement
Given an arbitrary binary tree consisting of N nodes, where each node is associated with a certain value, your task is to find the maximum sum for any le...
- Ans.
Find the maximum sum for any level in a binary tree.
Traverse the binary tree level by level and calculate the sum for each level.
Keep track of the maximum sum encountered so far.
Return the maximum sum found.
Example: For the input tree, the maximum level sum is 13 (5+6+2).
- Q2.
Find Top K Frequent Numbers in a Stream
Given an integer array
ARRand an integerK, your task is to find theKmost frequent elements inARR. Return the elements sorted in ascending order.Example:
Inp...
- Ans.
Find the K most frequent elements in an integer array and return them sorted in ascending order.
Use a hashmap to store the frequency of each element in the array.
Use a min heap to keep track of the K most frequent elements.
Return the elements from the min heap in ascending order.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
This round was based on DSA and questions on core subjects that I had studied throughout college.
- Q1.
Vertical Sum in a Binary Tree
Given a binary tree where each node has a positive integer value, compute the vertical sum of the nodes. The vertical sum is defined as the sum of all nodes aligned along the...
- Ans.
Compute the vertical sum of nodes in a binary tree aligned along the same vertical line.
Traverse the binary tree in a level order manner to calculate the vertical sum.
Use a hashmap to store the vertical sum at each vertical level.
Recursively traverse the tree and update the vertical sum in the hashmap.
Output the vertical sums in the required format for each test case.
- Q2. What is TCP/IP?
- Ans.
TCP/IP is a set of protocols that governs the way data is transmitted over the internet.
TCP/IP stands for Transmission Control Protocol/Internet Protocol.
It is a suite of communication protocols used to connect devices on the internet.
TCP ensures that data is reliably transmitted between devices.
IP is responsible for addressing and routing data packets across networks.
Examples of TCP/IP protocols include HTTP, FTP, and
Round duration - 30 minutes
Round difficulty - Easy
Experience : Keep confidence and show them good communication skills. Previous round's performance also matters in this rounds
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
Interview Questionnaire
1 Question
- Q1. Questions based on tree
Interview Preparation Tips
Experience: Keep your Calm
Tips: Practice matters
Duration: 90 minutes
Total Questions: 30
Round: Interview
Tips: They are not going to eat you.. they will help you out only...
So just go inside the interview room as some of your friends called you to ask some question..relax
Skills: Thinking Process
College Name: IIT GUWHATI
Piyush Raman
Interview Questionnaire
7 Questions
- Q1. Discussion on internship at IBM' Cloud Unit
- Q2. Find LCM of all numbers from 1 to n. Give an algorithm, then correctly estimate the time complexity
- Ans.
Algorithm to find LCM of all numbers from 1 to n and its time complexity
Find prime factors of all numbers from 1 to n
For each prime factor, find the highest power it appears in any number from 1 to n
Multiply all prime factors raised to their highest power to get LCM
Time complexity: O(n*log(log(n)))
- Q3. SQL vs NoSQL. Why NoSQL
- Ans.
NoSQL databases are flexible, scalable, and can handle large amounts of unstructured data.
NoSQL databases are schema-less, allowing for easy and flexible data modeling.
They can handle large amounts of unstructured data, making them suitable for big data applications.
NoSQL databases are highly scalable and can easily handle high traffic and large user bases.
They provide horizontal scalability by distributing data across...
- Q4. Some DBMS designing question relating to Snapdeal website
- Q5. JAVA-Spring and Hibernate
- Q6. Variation of -----/ Given a dictionary of words and a number n. Find count of all words in dictionary that can be formed by given number n
- Ans.
The question asks to find the count of words in a dictionary that can be formed by a given number.
Iterate through each word in the dictionary
Check if the characters in the word can be formed using the given number
Increment the count if the word can be formed
- Q7. Given an array of elements. We can perform following operation only- Increase an array element. Cost of operation is the amount of increment made per array element. Now for a given H, we need to make any H...
Interview Preparation Tips
Experience: I did both coding question ( 1 full and 2nd partial ) and 5 MCQ only and was shortlisted
Tips: Refer to interview sets on Geeksforgeeks.
Do solve both the coding questions first. Not necessary to pass all test cases for both.
Then go for C based o/p questions. At last aptitude.
Duration: 60 minutes
Total Questions: 23
Round: Technical Interview
Experience: I did not know JAVA and DBMS so could not answer any of the last 2 questions. I told him directly thati had no experience in JAVA / DBMS and justified. I had proficiency in Data Structure and Algorithms and I beleive the interviewer liked my internship work on Cloud / Virtualization
Tips: Focus on Data Strucure-Algorithms, JAVA, DBMS, Puzzles
Round: Test
Experience: All repeated questions from previous interviews.
Tips: Refer interview set from geeksforgeeks.org
Duration: 60 minutes
Total Questions: 3
Round: Technical Interview
Experience: For the first question, I started by exponential solution and reduced it to polynomial. We
discussed various approaches and tried a variety of methods and after
1-1.5 hrs of discussion finally ended up with an O(1) solution with some
pre-processing overhead. After achiveing O(1) time complexity, he asked
to further optimize the space complexity.
Usage of Trie / TST. Internal Implementation of Hashing structure and replacing the hashing mechanism using Trie / TST.
Tips: Focus on Tree, Stacks, Queue, Linked List, Hash Maps, Trie, Hashing, String Algorithms, Ternary Search Tree
Round: HR Interview
Experience: Typical HR
General Tips: Practice programming
Skill Tips: Focus on Data Structure-Algorithms and programming in either C++ / JAVA
Skills: Data Structure, Algorithms, Programing, JAVA, DBMS
College Name: Indian Institute of Information Technology, Design and Manufacturing, Jabalpur
Motivation: -
Funny Moments: -
Skills evaluated in this interview
Rakuten Interview FAQs
Recently Viewed
REVIEWS
Baxter International
No Reviews
SALARIES
Baxter International
No Salaries
REVIEWS
Baxter International
No Reviews
REVIEWS
Kansai Nerolac Paints
No Reviews
REVIEWS
Kansai Nerolac Paints
No Reviews
SALARIES
Baxter International
INTERVIEWS
Rakuten
No Interviews
REVIEWS
Baxter International
No Reviews
REVIEWS
Baxter International
No Reviews
SALARIES
Baxter International
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
- Gold Appraiser Interview Questions
- Gold Loan Officer Interview Questions
- Software Developer Interview Questions
- Gold Loan Executive Interview Questions
- Senior Gold Loan Officer Interview Questions
- Gold Loan Manager Interview Questions
- Java Developer Interview Questions
- Gold Inspector Interview Questions
- Show more
Rakuten Golang Developer Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
Fast track your campus placements
|
Senior Software Engineer
230
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Software Engineer
224
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Technical Lead
193
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Senior Software Engineer 2
135
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Devops Engineer
133
salaries
| ₹0 L/yr - ₹0 L/yr |
Amazon
eBay
Netflix
Flipkart
- Home >
- Interviews >
- Rakuten Interview Questions >
- Rakuten Golang Developer Interview Questions
