L7. Count Prime in a range L-R | Maths Playlist

[@aniketgupta8064]

hey striver, a request. As you upload videos, kindly also make the required updates in the A to Z sheet as well so that we wont have to find them out on YT.

[@RishabhDamle]

yes yes i also want to say this same thing

[@AratrikChandra]

can you please provide the link of the question?

[@sachinchoudhary4142]

Ya please anyone provide the link

[@adarshgupta1972]

@@sachinchoudhary4142 did you get it

[@bruvhellnah]

spoj prime1

[@tonylee1868]

great!
love your work ❤❤❤❤
Take rest bro
and Understood 🙂🙂

[@abhijeetbasfore6816]

Great explanation.

[@trailblazer555]

Great Bro; Understood well;

[@hritikminmuley1397]

Hey Striver, can you please provide the respective code in c++/java.

[@Anonymous-m3m]

class Solution {
public:
int count(int n) {
vector prime(n, 1);
int count = 0;
for(int i = 2; i * i < n; i++) {
if(prime[i] == 1) {
for(int j = i * i; j < n; j += i) {
prime[j] = 0;
}
}
}
for(int i = 2; i < n; i++) {
if(prime[i] == 1) {
count++;
}
}
return count;
}
bool isPrime(int n) {
if (n

[@kshitijchoudhary4680]

wont time complexity have another O(10^6) because seive function will take O(10^6) + O(10^6*loglog10^6) and then prefix sum takes O(10^6) as well

[@drishtirai864]

Understood :))

[@AkOp-bf9vm]

notes?

[@SaiKumar-mn1ee]

VIEDO ON OA???

[@HimanshuKumar-sg6hv]

can anyone explain me what is l = queries[i][0] and r = queries[i][1]

[@vipuljamod4119]

Queries store the list.
If Queries=3,
then three range given..,
So find primes for every range...,
To access l and r of first query,
l = Queries [i][0]
r = Queries [i][1]
Means if i=0 then it acces 0th l & r.
If i=1 then it access 1st L & R
And so on...,

[@techmatein]

Here queries can be seen as an array of array where the array the queries stores just have 2 indexes first for l(left) and r(right)
So the queries stores the l and r for each query

[@Ayushsharma-qc7qx]

Dimag ka bosda ho gaya bhai

[@45vinitthakkar56]

skill issue