D. J.:

- Added the leetcode problem and solution for 231

Author: nobodyPerfecZ

README.md

@@ -208,6 +208,7 @@
 - [227 Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/description/)
 - [228 Summary Ranges](https://leetcode.com/problems/summary-ranges/description/)
 - [230 Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/description/)
+- [231 Power of Two](https://leetcode.com/problems/power-of-two/description/)
 - [236 Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/description/)
 - [238 Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/description/)
 - [242 Valid Anagram](https://leetcode.com/problems/valid-anagram/description/)

awesome_python_leetcode/_231_power_of_two.py

@@ -0,0 +1,15 @@
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def isPowerOfTwo(self, n: int) -> bool:
+        """
+        Given an integer n, return true if it is a power of two.
+        Otherwise, return false.
+
+        An integer n is a power of two, if there exists an integer x such that n == 2x.
+        """
+        num_ones = 0
+        while n > 0:
+            num_ones += n & 1  # Get the last bit
+            n >>= 1  # shift right
+        return num_ones == 1

tests/test_231_power_of_two.py

@@ -0,0 +1,17 @@
+import pytest
+
+from awesome_python_leetcode._231_power_of_two import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["n", "expected"],
+    argvalues=[
+        (1, True),
+        (16, True),
+        (3, False),
+    ],
+)
+def test_func(n: int, expected: bool):
+    """Tests the solution of a LeetCode problem."""
+    is_power_of_two = Solution().isPowerOfTwo(n)
+    assert is_power_of_two is expected