INDMoney SDE Intern Interview Questions, Process, and Tips

Q1. What do you know about UNIS
Add your answer
Q2. What scope of work do you expect in this role
Add your answer

Q1. Merge two sorted arrays
Ans. 
Merging two sorted arrays into a single sorted array
• Create a new array to store the merged result

• Iterate through both arrays simultaneously, comparing elements and adding the smaller one to the result array

• Handle cases where one array is longer than the other by appending the remaining elements
Answered by AI
Add your answer
Q2. Put patch and post in api testing
Ans. 
Patch and post are HTTP methods used in API testing to update and create resources, respectively.
• PATCH method is used to update an existing resource in the API

• POST method is used to create a new resource in the API

• Both methods are commonly used in RESTful APIs for CRUD operations

• Example: PATCH /api/users/123 to update user with ID 123

• Example: POST /api/users to create a new user
Answered by AI
Add your answer
Q3. Explain your automation framework
Ans. 
My automation framework is a data-driven framework using Selenium WebDriver and TestNG for test execution and reporting.
• Uses Selenium WebDriver for interacting with web elements

• Utilizes TestNG for test execution and reporting

• Follows a data-driven approach for test data management
Answered by AI
Add your answer

Q1. Simple 3 questions of DSA with brute force to the optimal approach
Add your answer
Q2. 2 stacks, palindrome tricky, string question (simple)
Add your answer

Q1. 2 stacks with optinal approach
Ans. 
Implementing 2 stacks with optional approach
• Two stacks can be implemented in a single array by dividing it into two halves

• Optional approach can be implemented by using a third parameter to indicate which stack to use

• Push and pop operations can be performed on both stacks independently
Answered by AI
Add your answer
Q2. Some hr interview question
Add your answer

Q1. Marital status discussion
Add your answer
Q2. Future discusssions about what i want nd plans
Add your answer

Hackerrank - dp problems

Q1. Minimum number of jumps in the array.
Ans. 
Find minimum number of jumps required to reach the end of an array.
• Use dynamic programming approach to solve the problem.

• Maintain an array to store minimum number of jumps required to reach each index.

• Traverse the array and update the minimum number of jumps for each index.

• Return the minimum number of jumps required to reach the end of the array.
Answered by AI
Add your answer

Q1. What are ambitions and how I'll approach them
Add your answer
Q2. How do I see myself in 5 years
Add your answer

Q1. Find the missing number in an array, , given the array conatins numbers form 1 to n and one number is missing
Ans. 
Find the missing number in an array containing numbers from 1 to n.
• Iterate through the array and calculate the sum of all numbers from 1 to n.

• Calculate the sum of all numbers in the given array.

• Subtract the sum of array from the sum of all numbers to find the missing number.
Answered by AI
Add your answer
Q2. And question on resume
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Timings: it was late night. I started the test at 10 pm

Q1. Partial BST
Given a binary tree with N number of nodes, check if that input tree is Partial BST (Binary Search Tree) or not. If yes, return true, return false otherwise.
A binary search tree (BST) is sai...read more
Ans. 
Method 2 above runs slowly since it traverses over some parts of the tree many times. A better solution looks at each node only once. The trick is to write a utility helper function isBSTUtil(struct node* node, int min, int max) that traverses down the tree keeping track of the narrowing min and max allowed values as it goes, looking at each node only once. The initial values for min and max should be INT_MIN and INT_M
Answered by CodingNinjas
View 2 more answers

Round duration - 45 minutes
Round difficulty - Medium

It was the interviw round.
the environment was good.
the interviewer was very nice to me.

Q1. Merge two sorted linked lists
You are given two sorted linked lists. You have to merge them to produce a combined sorted linked list. You need to return the head of the final linked list.
Note:
The give...read more
Ans. 
Merge is one of those nice recursive problems where the recursive solution code is much cleaner than the iterative code. You probably wouldn’t want to use the recursive version for production code, however, because it will use stack space which is proportional to the length of the lists.
Answered by CodingNinjas
View 2 more answers

Aptitude test consists of DSA questions and theory questions on Java, SQL and object oriented programming

Q1. Explain Object oriented programming
Ans. 
Object oriented programming is a programming paradigm based on the concept of objects, which can contain data and code.
• OOP focuses on creating objects that interact with each other to solve problems

• Encapsulation, inheritance, and polymorphism are key principles of OOP

• Classes and objects are used to create reusable code and organize data

• Example: In a banking system, a 'Customer' object may have attributes like name and ...read more
Answered by AI
Add your answer
Q2. Explain Design principles
Ans. 
Design principles are fundamental concepts used to guide the process of designing products or systems.
• Design principles help ensure consistency, usability, and aesthetic appeal in the final product.

• They often include principles such as simplicity, consistency, hierarchy, balance, and emphasis.

• For example, the principle of simplicity in design aims to eliminate unnecessary elements and focus on the essential features.

• Co...read more
Answered by AI
Add your answer
Q3. Solve a dsa questions live
Add your answer