LeetCode 231 | Power of Two | 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
Check if n is greater than 0
Apply bit logic: n AND (n - 1) equals 0
If true, it is a power of two
Otherwise, return false

⏱ Time Complexity: O(1)
📦 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:

Classic bit manipulation problem
Uses property of powers of 2
Important for interviews

👍 Like | Comment | Subscribe for more LeetCode solutions!

Видео LeetCode 231 | Power of Two | Easy Problem | C++ Solution канала Vishwa Patel