Razorpay SDE Interview Questions and Answers

Easy questions tbh and the interviewer was chill

Q1. Binary search to find the number of coins
Ans. 
Binary search can be used to efficiently find the number of coins in a sorted array.
• Start by setting low to 0 and high to the length of the array minus 1.

• While low is less than or equal to high, calculate the mid point.

• Compare the value at the mid point with the target number of coins and adjust low or high accordingly.

• Return the index of the target number of coins if found, otherwise return -1.
Answered by AI
Add your answer
Q2. Oops questions that too basic questions
Add your answer

ALL APTI,QUANT,TECH MCQs were there

2 easy questions were given in it

Q1. Palindrome check standard leetcode question pretty easy
Add your answer
Q2. Why Visa inc etc etc standard hr question
Add your answer

1 easy question based on string and core subjects amd project related questions

It consist of 3 questions on hackerrank

Q1. Dont remember the exact it was related to array manipulation
Add your answer
Q2. Dont remember the exact but it was string manipulation
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

I couldn't find an optimal approach to the first question, so she skipped that question and proceeded to next questions. Remaining questions I have answered satisfactorily.

Q1. 
Subset Sum Equal To K Problem Statement
Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Provide true if such a subset exists, otherwise r...read more
Ans. 
Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.
• Use dynamic programming to solve this problem efficiently

• Create a 2D array to store if a subset with a particular sum exists

• Iterate through the array and update the 2D array accordingly

• Check if the value at the end of the iteration is true for the given K
Answered by AI
Add your answer
Q2. 
BFS Traversal in a Graph
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...read more
Ans. 
BFS traversal in a disconnected graph starting from vertex 0.
• Implement BFS algorithm to traverse the graph starting from vertex 0.

• Use a queue to keep track of visited nodes and their neighbors.

• Ensure to print the traversal sequence in the correct order.

• Handle disconnected components by checking for unvisited nodes.

• Follow the BFS approach of exploring neighbors before moving to the next level.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

I told that my strength is problem solving and I can always find a way when there is a bottle-neck. Gave some examples of my experiences while doing my assignments.

Q1. 
Replace Spaces in a String
Given a string STR consisting of words separated by spaces, your task is to replace all spaces between words with the characters "@40".
Input:
The first line contains an integ...read more
Ans. 
Replace spaces in a string with '@40'.
• Iterate through each character in the string

• Replace spaces with '@40'

• Return the modified string
Answered by AI
Add your answer