Currently Empty: ₹0.00
Find All Prime Numbers in the Array
Find All Prime Numbers in the Array
Description:
Given an array arr[] of integers, write a program to find and return all prime numbers in the array with minimum time complexity.
Input: arr = {2, 6, 5, 17, 4, 11}
Output: Prime numbers in the array: {2, 5, 17, 11}
Explanation: The array is {2, 6, 5, 17, 4, 11}, and the prime numbers in the array are {2, 5, 17, 11}.
Constraints:
The array length |arr| is at least 1 and at most 10^5. Elements in the array are integers ranging from 2 to 10^6.
Java Code:
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class HackerAlgo {
// Find All Prime Numbers in the Array
public static List<Integer>findPrimes(int[] arr) {
List<Integer> primes = new ArrayList<>();
for (int num : arr) {
if (isPrime(num)) {
primes.add(num);
}
}
return primes;
}
// Helper method to check if a number is prime
private static booleanisPrime(int num) {
if (num< 2) {
return false;
}
for (int i = 2; i<= Math.sqrt(num); i++) {
if (num % i == 0) {
return false;
}
}
return true;
}
public static void main(String[] args) {
// Example for Find All Prime Numbers in the Array
int[] arr = {2, 6, 5, 17, 4, 11};
List<Integer> primes = findPrimes(arr);
System.out.println("Prime numbers in the array: " + primesPython Code:
# Find All Prime Numbers in the Array
def find_primes(arr):
primes = []
def is_prime(num):
if num< 2:
return False
for i in range(2, int(num**0.5) + 1):
if num % i == 0:
return False
return True
for num in arr:
if is_prime(num):
primes.append(num)
return primes
# Example usage
arr = [2, 6, 5, 17, 4, 11]
primes = find_primes(arr)
print("Prime numbers in the array:", primes)C++ Code:
#include <iostream>
#include <vector>
#include <cmath>
class HackerAlgo {
public:
// Find All Prime Numbers in the Array
static std::vector<int>findPrimes(const std::vector<int>&arr) {
std::vector<int> primes;
auto isPrime = [](int num) {
if (num< 2) {
return false;
}
for (int i = 2; i<= std::sqrt(num); i++) {
if (num % i == 0) {
return false;
}
}
return true;
};
for (int num : arr) {
if (isPrime(num)) {
primes.push_back(num);
}
}
return primes;
}
};
int main() {
// Example for Find All Prime Numbers in the Array
std::vector<int>arr = {2, 6, 5, 17, 4, 11};
std::vector<int> primes = HackerAlgo::findPrimes(arr);
std::cout<< "Prime numbers in the array: ";
for (int prime : primes) {
std::cout<< prime << " ";
}
std::cout<< std::endl;
return 0JavaScript Code:
class HackerAlgo {
// Find All Prime Numbers in the Array
static findPrimes(arr) {
const primes = [];
constisPrime = (num) => {
if (num< 2) {
return false;
}
for (let i = 2; i<= Math.sqrt(num); i++) {
if (num % i === 0) {
return false;
}
}
return true;
};
for (constnum of arr) {
if (isPrime(num)) {
primes.push(num);
}
}
return primes;
}
}
// Example usage
constarr = [2, 6, 5, 17, 4, 11];
const primes = HackerAlgo.findPrimes(arr);
console.log("Prime numbers in the array:", primes);