LeetCode 2520 | Count Digits That Divide a Number | Easy Problem | C++ Solution

In this video, I explain the problem step-by-step, discuss the approach, and implement the solution live while coding.

🧠 Approach:

Read an integer n
Extract each digit of the number
Check if the digit divides n (n % digit == 0)
Count such digits
Return the count

⏱ Time Complexity: O(d)
📦 Space Complexity: O(1)

🔗 GitHub Repository:
https://github.com/VishwaPatel892/Lee

👨‍💻 LeetCode Profile:
https://leetcode.com/u/vishwa0102/

💼 LinkedIn:
https://www.linkedin.com/in/vishwa-patel-9bab9639a

📝 Notes:

Simple digit manipulation problem
Helps understand modulus % operator
Good beginner-friendly logic building question

👍 Like | 💬 Comment | 🔔 Subscribe for more LeetCode solutions!

Видео LeetCode 2520 | Count Digits That Divide a Number | Easy Problem | C++ Solution канала Vishwa Patel