Rcube Planet Interview Questions and Answers

Q1. Xl sheet and typing speed
Add your answer
Q2. How many years u hv experience in xl
Add your answer

Three fundamental questions related to Data Structures and Algorithms.

Assignment related to reconciliation.

Q1. Explain reconciliation assignment that you have done in first step.
Ans. 
Reconciliation assignment involves comparing and matching data from different sources.
• Identify sources of data to be reconciled

• Compare data from different sources

• Match data based on common identifiers

• Resolve discrepancies and errors

• Ensure accuracy and completeness of reconciled data
Answered by AI
Add your answer
Q2. Basic logic of python array, SQL operation.
Add your answer

Reconciliation of invoice and payment

Q1. Based on assignment and some other general question.
Add your answer

Q1. Introduce yourself
Ans. 
I am a software developer with 5 years of experience in Java, Python, and SQL.
• 5 years of experience in Java, Python, and SQL

• Worked on developing web applications using Java Spring framework

• Proficient in database management with SQL
Answered by AI
Add your answer
Q2. Brief about projects you have worked
Ans. 
Developed web application for online shopping platform with user authentication and payment gateway integration.
• Implemented user authentication using JWT tokens

• Integrated payment gateway APIs for secure transactions

• Designed responsive UI for seamless user experience
Answered by AI
Add your answer

Q1. Basic knowledge about loan
Add your answer

Q1. Situation based questions
Add your answer

Q1. Marketing related question
Add your answer

Q1. Challenging situation you have encountered
Add your answer

Q1. Describe the actions you took to address the chanllenge
Add your answer

Q1. 2Sum DSA leetcode problem
Ans. 
2Sum problem involves finding two numbers in an array that add up to a specific target.
• Use a hashmap to store the difference between the target and each element in the array.

• Iterate through the array and check if the current element's complement exists in the hashmap.

• Return the indices of the two numbers that add up to the target.
Answered by AI
Add your answer
Q2. Spiral traversal of a Binary tree
Ans. 
Spiral traversal of a Binary tree involves visiting nodes level by level alternating between left to right and right to left.
• Start by pushing the root node into a queue.

• While the queue is not empty, pop a node, print its value, and push its children into the queue.

• Alternate between popping nodes from the queue and printing their values in a spiral manner.
Answered by AI
Add your answer

Q1. A problem similar to coin change problem of leetcode
Add your answer
Q2. Aggressive cows problem
Ans. 
The aggressive cows problem involves finding the maximum distance between cows in a field while ensuring they are not too close to each other.
• Use binary search to find the maximum distance between cows.

• Sort the cows' positions and check if a certain distance is feasible.

• Consider the constraints of the problem such as the number of cows and the size of the field.
Answered by AI
Add your answer

Q1. Basic behavioural questions like why I am looking for a change and would I be able to handle the increased work pressure as I was shifting from MNC to a startup
Add your answer

Technical round 2 questions