Find Primes Without Modulus | Dataford Interview Questions

Find the prime numbers in a range without using the modulus operator.

Asked in the technical interview stage. Implement find_primes(start, end) to return all prime integers from start through end, inclusive. Do not use % anywhere in the implementation.

Input and Output

Inputs are integers. Return a list of primes in ascending order.

Constraints

1 <= start <= end <= 100000
The range is inclusive
The implementation must not use the modulus operator %

Function Signature

def find_primes(start, end):

Your question is Find Primes Without Modulus. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem