Prime Check and Pattern Printing | Dataford Interview Questions

Write code to check whether a number is prime and print a pattern.

Implement prime_and_pattern(n). Return "Prime" or "Not Prime", followed by a newline-separated pattern containing rows of 1 through n asterisks. For n <= 0, return only the primality result. A positive input's returned pattern must end with a newline.

Function signature: def prime_and_pattern(n):

Constraints

-10^9 <= n <= 10^5
n is an integer
For n > 0, the pattern has exactly n rows

Function Signature

def prime_and_pattern(n):

Your question is Prime Check and Pattern Printing. 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

Write code to check whether a number is prime and print a pattern.

Function signature: def prime_and_pattern(n):

Constraints

-10^9 <= n <= 10^5
n is an integer
For n > 0, the pattern has exactly n rows

Function Signature

def prime_and_pattern(n):

Your question is Prime Check and Pattern Printing. 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.