RubicoIT Node JS Developer Interview Questions and Answers

There were around 60 questions and negative marking was also there

Q1. Introduce yourself
Ans. 
I am a Full Stack Developer with experience in front-end and back-end technologies.
• Proficient in HTML, CSS, JavaScript for front-end development

• Skilled in Node.js, Express, MongoDB for back-end development

• Experience with React.js and Angular for building interactive web applications
Answered by AI
Add your answer
Q2. What is diamond problem
Ans. 
Diamond problem is a common issue in multiple inheritance where a class inherits from two classes that have a common ancestor.
• Occurs in languages that support multiple inheritance like C++

• Results in ambiguity when calling methods or accessing attributes from the common ancestor class

• Can be resolved using virtual inheritance or interfaces
Answered by AI
Add your answer
Q3. Run length encoding dsa problem
Ans. 
Run length encoding is a data compression technique that replaces repeated characters with a count and single character.
• Iterate through the input array of strings

• Count the number of consecutive characters in each string

• Replace consecutive characters with count and character
Answered by AI
Add your answer
Q4. Rotate an array by d times
Ans. 
Rotate an array of strings by d times
• Create a new array and copy elements from original array based on rotation index

• Use modulo operator to handle cases where d is greater than array length

• Handle edge cases like empty array or d being negative
Answered by AI
Add your answer

Dp
stirngs
sortings

Q1. Based on cn and dsa
Add your answer
Q2. Based on the os
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Timing was 12 PM. Interviewer was nice.

Q1. 
Reverse the String Problem Statement
You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.
Example:
Input:
STR = "abcde"
Output:
"e...read more
Ans. Optimal Solution
• Traverse the string and swap the first character with the last character, the second character with the second last character and so on.
• Basically, you need to swap the i-th character with the (N-i-1)-th character where N is the length of the string and 0-based indexing is considered.
Space Complexity: O(1)Explanation:
O(1).
 
In the worst case, only constant extra space is required.
Time Complexity: O(...read more
Answered Anonymously
Add your answer
Q2. 
Move Zeros to Left Problem Statement
Your task is to rearrange a given array ARR such that all zero elements appear at the beginning, followed by non-zero elements, while maintaining the relative order of...read more
Ans. Solution Using Extra space
The idea is to use an extra vector to store all the non-zero elements while maintaining their relative order. So we will first add all the non-zero elements to a vector and then iterate that vector backwards and start updating the array values from end. In the end we will set all the array values whose values were not updated to 0. 
Steps:
1. Let storeNonZero be the vector that stores non-zero...read more
Answered Anonymously
Add your answer
Q3. Write an SQL query to find the second highest salary from a table.
Add your answer