Similar Collections

We are trying to list out the most frequently asked interview problems or the problem given in the coding rounds of IT giants.

questions

Title
Sieve of Eratosthenes is an ancient algorithm of finding prime numbers for any given range. It\'s actually about maintaining a Boolean table to check for corresponding prime no
You will be given a square matrix M and a positive integer power N. You will have to compute M raised to the power N
You are given an array A of integers of size N. You will be given Q queries where each query is represented by two integers L, R
You are given two prime numbers n and m of 4 digits each, you need to convert n into m in the minimum number of steps, in each step you can change one of the digits of the number n such that a resulting number is also a prime number
total questions: 4

Questions

4

Views

554

Best Answers

299

Points

5