solves to lower case

Author: anishLearnsToCode

README.md

@@ -1,8 +1,8 @@
 # LeetCode Algorithms
 
-![problems-solved](https://img.shields.io/badge/Problems%20Solved-174/2081-1f425f.svg)
-![problems-solved-java](https://img.shields.io/badge/Java-174/2081-1abc9c.svg)
-![problems-solved-python](https://img.shields.io/badge/Python-174/2081-1abc9c.svg)
+![problems-solved](https://img.shields.io/badge/Problems%20Solved-175/2081-1f425f.svg)
+![problems-solved-java](https://img.shields.io/badge/Java-175/2081-1abc9c.svg)
+![problems-solved-python](https://img.shields.io/badge/Python-175   /2081-1abc9c.svg)
 [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](CONTRIBUTING.md)
 [![cp](https://img.shields.io/badge/also%20see-Competitve%20Programming-1f72ff.svg)](https://github.com/anishLearnsToCode/competitive-programming)
 
@@ -195,7 +195,7 @@
 | 704 | [Binary Search](https://leetcode.com/problems/binary-search) | [![Java](assets/java.png)](src/BinarySearch.java) [![Python](assets/python.png)](python/binary_search.py) |
 | 705 | [Design HashSet](https://leetcode.com/problems/design-hashset) | [![Java](assets/java.png)](src/DesignHashSet.java) [![Python](assets/python.png)](python/design_hash_set.py) |
 | 706 | [Design HashMap](https://leetcode.com/problems/design-hashmap) | [![Java](assets/java.png)](src/DesignHashMap.java) [![Python](assets/python.png)](python/design_hash_map.py) |
-| 709 | [To Lower Case](https://leetcode.com/problems/to-lower-case) | |
+| 709 | [To Lower Case](https://leetcode.com/problems/to-lower-case) | [![Java](assets/java.png)](src/ToLowerCase.java) [![Python](assets/python.png)](python/to_lower_case.py) |
 | 716 | [Max Stack](https://leetcode.com/problems/max-stack) | |
 | 717 | [1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters) | |
 | 720 | [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary) | |

python/to_lower_case.py

@@ -0,0 +1,15 @@
+class Solution:
+    def isAlphabet(self, character: str) -> bool:
+        return self.isUpperCase(character) or self.isLowerCase(character)
+
+    def isUpperCase(self, character: str) -> bool:
+        return 65 <= ord(character) <= 90
+
+    def isLowerCase(self, character: str) -> bool:
+        return 97 <= ord(character) <= 122
+
+    def toLowerCase(self, s: str) -> str:
+        result = ''
+        for character in s:
+            result += chr(ord(character) + 32) if self.isAlphabet(character) and self.isUpperCase(character) else character
+        return result

src/DesignHashSet.java

@@ -40,7 +40,7 @@ private void initializeBuckets() {
             }
         }
 
-        private static class Bucket {
+        private class Bucket {
             Queue<Integer> list = new LinkedList<>();
 
             public boolean contains(int element) {

src/ToLowerCase.java

@@ -0,0 +1,25 @@
+public class ToLowerCase {
+    public String toLowerCase(String s) {
+        StringBuilder result = new StringBuilder();
+        for (int index = 0 ; index < s.length() ; index++) {
+            result.append(toLowerCase(s.charAt(index)));
+        }
+        return result.toString();
+    }
+
+    private char toLowerCase(char character) {
+        return isUpperCase(character) && isAlphabet(character) ? (char) (character + 32) : character;
+    }
+
+    private boolean isAlphabet(char character) {
+        return isUpperCase(character) || isLowerCase(character);
+    }
+
+    private boolean isLowerCase(char character) {
+        return 97 <= character && character <= 122;
+    }
+
+    private boolean isUpperCase(char character) {
+        return 65 <= character && character <= 90;
+    }
+}