LeetCode 1952 - Three Divisors | Math Observation | C++ Full Solution

📌 Problem Statement:
Given an integer n, return true if n has exactly three positive divisors. Otherwise, return false.

🧩 What You'll Learn:
✔ Important divisor properties
✔ Why only square of prime numbers have exactly 3 divisors
✔ Prime number checking technique
✔ Time Complexity: O(square root of n)

🛠️ Approach - Step by Step:
STEP 1 → Understand divisor pattern
STEP 2 → A number with exactly 3 divisors must be square of a prime
STEP 3 → Compute square root of n
STEP 4 → Check if square root multiplied by itself equals n
STEP 5 → Verify square root value is prime
STEP 6 → Return true if both conditions are satisfied

💡 Example:
n = 4

Divisors:
1, 2, 4

Exactly 3 divisors → Answer is true

⏱️ Timestamps:
0:00 - Problem Statement
1:00 - Divisor Basics
2:30 - Mathematical Observation
4:30 - Prime Checking Logic
6:30 - C++ Code
8:00 - Dry Run Examples
9:30 - Complexity Analysis

💻 Difficulty: Easy
🏷️ Topics: Math, Number Theory

📢 LIKE 👍 SHARE 🔗 SUBSCRIBE 🔔 for daily LeetCode solutions!

#LeetCode #LeetCode1952 #ThreeDivisors #Math #CPlusPlus #DSA #CodingInterview

Видео LeetCode 1952 - Three Divisors | Math Observation | C++ Full Solution канала JALAK PALAN