Prime Numbers Coding | Dataford Interview Questions

Virtusa's engineering tools may need small numeric utilities for validation and test-data generation. Write a function that finds every prime number in an inclusive integer range, including the standard range from 1 to 100.

A prime number is an integer greater than 1 with exactly two positive divisors: 1 and itself. Return the discovered primes in ascending order. The value 1 must not be included.

Formal Specification

Implement prime_numbers_between(start, end). The function receives two integers and returns a list containing every prime number x such that start <= x <= end.

For the extracted task, the expected call is prime_numbers_between(1, 100).

Constraints

1 <= start <= end <= 100
The range is inclusive
Return an empty list when no prime exists
Do not use a built-in prime-number generator

Function Signature

def prime_numbers_between(start, end):

Your question is Prime Numbers Coding. 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