Bright Money Sdet Engineer Interview Questions and Answers

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.

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.