Three Divisors | LeetCode | C++ Explanation

📌 Title: Number of Ways to Buy Pens and Pencils | LeetCode | C++ Explanation 🔹 Problem: Three Divisors 🔗 LeetCode Problem: https://leetcode.com/problems/three-divisors/ 📌 Problem Explanation: In this problem, we are given an integer n and we need to determine whether it has exactly 3 divisors or not. A divisor is a number that divides n completely without leaving any remainder. 👉 Example: n = 4 Divisors of 4 → 1, 2, 4 Total divisors = 3 → Answer = true n = 2 Divisors of 2 → 1, 2 Total divisors = 2 → Answer = false The task is simply to count the number of divisors of n and check whether the count is equal to 3. --- 💡 Approach: * Initialize a variable count = 0 * Traverse from 1 to n * For every number i, check if n % i == 0 * If divisible, increment count * After traversal, check if count == 3 * Return true if exactly 3 divisors exist, otherwise return false 👉 Why this works: * Every divisor divides the number completely * Counting all divisors helps determine whether total divisors are exactly 3 * Simple brute force approach makes the logic easy to understand --- ⏱ Time Complexity: O(n) — traversing from 1 to n 💾 Space Complexity: O(1) — no extra space used --- 🧠 Key Concepts: * Divisors * Modulo operation * Brute force traversal --- 📝 Notes: * Beginner-friendly problem * Helps in understanding divisor counting * Good practice for loops and modulo operations --- 🔗 GitHub Repository: https://github.com/abdulhaque2005 🔗 LeetCode Profile: https://leetcode.com/u/pDjnXUuCp8/ 🔗 LinkedIn: https://www.linkedin.com/in/abdul-haque78/ --- 🚀 DSA Practice Journey: * 160+ LeetCode Questions * 40 YouTube Videos * C++ + STL based solutions --- #DSA #LeetCode #CPP #Coding #Programming #Math