Geeksforgeeks Solution For " Find Prime numbers in a range "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- We Have to Generate all Prime Number Between Given Range By User 

Submit Your Solution :- Click Here 

Solution :- 


int main()
    int t;
    int num,i,count,min,max;

    for(num = min;num<=max;num++)
         count = 0;
         if(count==0 && num!= 1)
             printf("%d ",num);
   return 0;


Geeksforgeeks Solution For " Find Prime numbers in a range "

Previous Post
Next Post

post written by:

Hi, I’m Ghanendra Yadav, SEO Expert, Professional Blogger, Programmer, and UI Developer. Get a Solution of More Than 500+ Programming Problems, and Practice All Programs in C, C++, and Java Languages. Get a Competitive Website Solution also Ie. Hackerrank Solutions and Geeksforgeeks Solutions. If You Are Interested to Learn a C Programming Language and You Don't Have Experience in Any Programming, You Should Start with a C Programming Language, Read: List of Format Specifiers in C.
Follow Me