Charlie's Prime factors

[pratik-choudhari]

Feature ✅

Description

For a given number n, find the maximum number of distinct prime factors for numbers in range [1,n]

Example

Input: 100 Output: 3 Explanation: 30, 42 has 3 prime factors, no other number has more than 3 distinct prime factors in range [1, 100]

Contributors are supposed to mention their coding language while asking for assignment Charlie's doesn't mean anything, it's just to make the name of problem concise🤫

[VamsiMudaliar]

Sir, I would love to contribute to this in C++

[shubhamnag14]

could you please assign me this issue?? i would like to do the tasķ in python

[sushant19-99]

Kindly assign it to me , I would like do the task in Java.

[sushant19-99]

@pratik-choudhari kindly add ‘hacktoberfest-accepted’ label to the pull request once they are merged. According to the recent guidelines only then the requests will be considered valid for hacktober fest

[pratik-choudhari]

@sushant19-99 If you look at it again closely having hactoberfest labelled repository and a merged PR are also accepted. There is OR in between conditions.

[sushant19-99]

@pratik-choudhari Ohh okay. You are right. Thanks for clearing that out.