August Monthly Leetcode Day-1 (codedecks-in#26)

Author: lokendra1704

Python/detect-capital.py

@@ -0,0 +1,37 @@
+#Submission: 95.83%
+'''
+Step 1) We will generate a array and fill it with 0 or 1
+ 0 If the letter at corresponding index in word is lower.
+ 1 if the letter at corresponding index in word is upper.
+Example: USA => 111
+ Is => 10
+ country => 0000000
+step 2) Word will be valid if:
+ a) When word starts with Capital and remaining all are small => Then the number for such word will be 10.....0
+ To make 10...0 we will do: 1<<(size-1)
+ b) When all are lower => Then the number will be 00...0
+ To make 00...0 we will do: 0<<(size-1)
+ c) When all are capital => Then the number will be 1....1
+ To make 1...1 we will do: (1<<size)-1
+Step 3) If the number generated in step 1 matches any of the valid numbers, Then the word is valid.
+'''
+'''
+Time Complexity: O(n)
+Space Complexity: O(1)
+'''
+class Solution:
+ def detectCapitalUse(self, word: str) -> bool:
+ num = 0
+ size = len(word)
+
+ #Generating the number
+ for i in range(size):
+ num = num*10
+ if word[i].isupper():
+ num+=1
+ num = int(str(num),2)
+
+ #Checking if it matches any of the valid number
+ if num==(1<<(size-1)) or num==(0<<(size-1)) or num==((1<<size)-1):
+ return True
+ return False

README.md

@@ -70,6 +70,7 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
 | 0136 | [Single Number](https://leetcode.com/problems/single-number/) | [Java](./Java/single-number.java) <br> [Python](./Python/single-number.py) | _O(n)_ | _O(1)_ | Easy | | Using XOR |
 | 0137 | [Single Number II](https://leetcode.com/problems/single-number-ii/) | | _O(n)_ | _O(1)_ | Medium | | |
 | 0260 | [Single Number III](https://leetcode.com/problems/single-number-iii/) | [Python](./Python/single-number-iii.py) | _O(n)_ | _O(1)_ | Medium | | |
+| 0520 | [Detect Capital Use](https://leetcode.com/problems/detect-capital/) | [Python](./Python/detect-capital.py) | _O(n)_ | _O(1)_ | Easy | | |
 
 <br/>
 <div align="right">