InterviewBit Academy is now Scaler!
Learn Tech Skills from Scratch @ Scaler EDGE

Prime Numbers

Given a number N, find all prime numbers upto N ( N included ).


if N = 7,

all primes till 7 = {2, 3, 5, 7}

Make sure the returned array is sorted.

Problem Approach:

Complete code in the hint.

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.
Start solving Prime Numbers on Interview Code Editor
Sign Up
to access hints and editorial solutions for Prime Numbers


Click here to start solving coding interview questions