Royal Bank Of Canada Software Engineer Interview Questions and Answers for Freshers

Q1. MVC , C#, ASP.net
Add your answer

Q1. Managerial question
Add your answer

The test carried 7 sections of aptitude with no negative markings and the questions were also easy with time duration of 1 hours which was to be used for the coding round also

Basic understanding was checked, if basics are clear of DSA and computer science fundamentals then very easy to crack

Q1. Questions about Resume
Add your answer
Q2. High Level Discussion about tools like Kafka, Redis, Mongo
Add your answer

Design a working nodejs portfolio platform with api's and some condition

Array problem related to

Q1. Basic of nodejs & explain how will you build stock portfolio system
Add your answer

What is the company role and what going on this company

What is the salary in this company

What is the coding test I don't know pls give me explain

Round duration - 100 minutes
Round difficulty - Easy

Test started at 04:00 PM sharp and complete the same by 06:00 PM.
The test duration is 1 hour 40 minutes.
Environment (Amcat) is user friendly.
Web cam and mic were enabled

Q1. Longest Palindromic Subsequence
You have been given a string ‘A’ consisting of lower case English letters. Your task is to find the length of the longest palindromic subsequence in ‘A’.
A subsequence is ...read more
Ans. Recursive Approach
The main idea behind this approach is to use recursion. The idea is to compare the first character of the string A[i..j] with its last character. There are two possibilities:
1. If the first character of the string is the same as the last character, we include first and last characters in the palindrome and do a recursive call for the remaining substring A[i + 1, j - 1].
2. If the last character of the string...read more
Answered by CodingNinjas
View 1 more answer
Q2. Ways To Make Coin Change
You are given an infinite supply of coins of each of denominations D = {D0, D1, D2, D3, ...... Dn-1}. You need to figure out the total number of ways W, in which you can make a cha...read more
Ans. Recursion
 
1. The idea is to use recursion.
2. For a particular coin, we have two options either include it or exclude it.
3. If we include that coin, then calculate the remaining number that we have to generate so recur for that remaining number.
4. If we exclude that coin, then recur for the same amount that we have to make.
5. Our final answer would be the total number of ways either by including or excluding.
6. There will be two edg...read more
Answered by CodingNinjas
View 3 more answers

Round duration - 45 minutes
Round difficulty - Hard

Interview stared at 11:00 am and went for 90 min.
Interview was held in zoom
Environment was very much user friendly

Q1. Maximum Sum of nodes in a binary tree such that no two nodes are adjacent
You have been given a binary tree with an integer value associated to each node. You are supposed to choose a subset of these nodes...read more
Ans. Using Memoization
Keeping in mind the fact that both node and its children can not be considered for the maximum sum at the same time, we know that if we take a node into our sum, then we will directly call recursively for its grandchildren, OR if we don't take the node into our consideration, we will call for its child nodes and finally consider the maximum sum from both these results.
 
Considering the above idea, ...read more
Answered by CodingNinjas
View 1 more answer
Q2. Basic Puzzles
There are 3 mislabeled jars, with apple and oranges in the first and second jar respectively. The third jar contains a mixture of apples and oranges. You can pick as many fruits as required to...read more
Add your answer