Bright Money Interview Questions, Process, and Tips

It was a simple assignment where you needed to implement a Django app from a well laid out documentation.

Q1. Binary Search Tree - Two nodes are swapped in a Binary Search tree and then fix them so that the tree becomes a valid BST
Ans. 
Fix two swapped nodes in a Binary Search Tree to make it valid
• Identify the two nodes that are swapped incorrectly

• Perform an inorder traversal to find the nodes that are not in ascending order

• Swap the values of the incorrectly swapped nodes to fix the BST
Answered by AI
Add your answer

Just some Excel questions like count, add, and etc. Intermediate questions.

Regular aptitude with numerical reasoning

Q1. Behaviourial question
Add your answer

Basics of python and sql asked

Q1. General things like HR round
Add your answer

Q1. 1. Printing all Prime Numbers from 1 to N
Ans. 
Printing all prime numbers from 1 to N.
• Iterate from 2 to N and check if each number is prime or not.

• Use a nested loop to check if a number is divisible by any number less than it.

• If a number is not divisible by any number less than it, it is a prime number.

• Print all prime numbers found.
Answered by AI
Add your answer
Q2. 2. Sorting the Array
Ans. 
Sorting an array involves arranging its elements in a specific order.
• There are various sorting algorithms like bubble sort, insertion sort, quicksort, etc.

• Sorting can be done in ascending or descending order.

• Sorting can be done based on different criteria like alphabetical order, numerical order, etc.
Answered by AI
Add your answer