🔥 Challenge for JavaScript Ninjas:

Can you solve this?
➤ Write a function that returns true if a number is almost prime — i.e., has exactly two distinct prime factors.

✅ Try it out now → https://javascriptninjas.com/?page=6&order_by=&sort=&q=hard

---

🔹 2. Interactive Style (for dev.to, Hashnode, blogs)

💡 Can You Crack This?
Here’s a brain-tickler for JavaScript learners:

"Write a function that returns true if a number is almost prime — meaning it has exactly two distinct prime factors."

For example:

yamlCopyEditInput: 6 → Output: true   // (2 × 3)  
Input: 30 → Output: false  // (2 × 3 × 5) → 3 distinct  
Input: 21 → Output: true   // (3 × 7)

Solve it directly here: 👉 https://javascriptninjas.com/?page=6&order_by=&sort=&q=hard

---

🔹 3. Competition Announcement Style (for Facebook/LinkedIn posts)

🚀 Think you’re a JavaScript Ninja? Prove it.

This month’s challenge:
🧩 Write a function that returns true if a number is "almost prime" (has exactly 2 distinct prime factors).

📌 Example:
6 → true, 21 → true, 30 → false

Try the full challenge here:
🔗 https://javascriptninjas.com/?page=6&order_by=&sort=&q=hard

💰 We run monthly competitions — winners get prizes & shoutouts!

---

🔹 4. Gamified Format (for forums or gamified learning platforms)

🕹️ Mini-Boss Level: Almost Prime Check
Mission: Write a function to check if a number has exactly two distinct prime factors.

Input → 6, Output → true
Input → 30, Output → false
Input → 21, Output → true

🎯 Take the challenge here: https://javascriptninjas.com/?page=6&order_by=&sort=&q=hard

---

🔹 5. Plain Text for Email or WhatsApp Group

👋 Hey! Quick challenge for JavaScript lovers:

Can you write a function that returns true if a number is "almost prime" (i.e., has exactly two distinct prime factors)?

Try these:

• solve(6) → true

• solve(30) → false

• solve(21) → true

Solve this now & join our monthly contest at:
👉 https://javascriptninjas.com/?page=6&order_by=&sort=&q=hard