2053. Kth Distinct String in an Array

Algorithms/python/AverageSalaryExcludingtheMinimumandMaximumSalary/Average-Salary-Excluding-the-Minimum-and-Maximum-Salary.py

@@ -0,0 +1,6 @@
+from typing import List
+
+
+class Solution:
+    def average(self, salary: List[int]) -> float:
+        return (sum(salary) - max(salary) - min(salary)) / (len(salary) - 2)

Algorithms/python/CountOddNumbersinanIntervalRange/Count-Odd-Numbers-in-an-Interval-Range.py

@@ -0,0 +1,8 @@
+class Solution(object):
+    def countOdds(self, low, high):
+        """
+        :type low: int
+        :type high: int
+        :rtype: int
+        """
+        return (high + 1) / 2 - low / 2

Algorithms/python/FindNearestPointThatHasTheSameXorYCoordinate/Find-Nearest-Point–That-Has-the-Same-X-or-Y-Coordinate.py

@@ -0,0 +1,15 @@
+from typing import List
+
+
+class Solution:
+    def nearestValidPoint(self, x: int, y: int, points: List[List[int]]) -> int:
+        dist = -1
+        index = -1
+        for i, j in enumerate(points):
+            xi, yi = j
+            if x == xi or y == yi:
+                temp = abs(x - xi) + abs(y - yi)
+                if dist == -1 or temp < dist:
+                    dist = temp
+                    index = i
+        return index

Algorithms/python/LongestSubstringWithoutRepeatingCharacters/Longest-Substring-Without-Repeating-Characters.py

@@ -0,0 +1,4 @@
+class Solution:
+    def lengthOfLongestSubstring(self, s: str) -> int:
+        s = set(s)
+        return len(s)

Algorithms/python/ShortEncodingofWords/Short-Encoding-of-Words.py

@@ -0,0 +1,17 @@
+import collections
+from functools import reduce
+from typing import List
+
+
+class Solution:
+    def minimumLengthEncoding(self, words: List[str]) -> int:
+        words = list(set(words))  # remove duplicates
+        Trie = lambda: collections.defaultdict(Trie)
+        trie = Trie()
+
+        nodes = [reduce(dict.__getitem__, word[::-1], trie)
+                 for word in words]
+
+        return sum(len(word) + 1
+                   for i, word in enumerate(words)
+                   if len(nodes[i]) == 0)

Contest/Pyhton/GreatestEnglishLetterinUpperandLowerCase/Greatest-English-Letter–in-Upper-and-Lower-Case.py

@@ -0,0 +1,18 @@
+
+
+class Solution:
+    def greatestLetter(self, s: str) -> str:
+        ans = []
+        for i in s:
+            if i.islower():
+                if i.upper() in s:
+                    ans.append(i.upper())
+            if i.isupper():
+                if i.lower() in s:
+                    ans.append(i.upper())
+        if len(ans):
+            return sorted(ans)[-1]
+        return ""
+
+sol = Solution()
+print(sol.greatestLetter("arRAzFif"))

Contest/Pyhton/SumofNumbersWithUnitsDigitK/Sum-of-Numbers-With-Units-Digit-K.py

@@ -0,0 +1,24 @@
+class Solution:
+    def minimumNumbers(self, num: int, k: int) -> int:
+        def check(unit_digit, X):
+            for times in range(1, 11):
+                digit = (X * times) % 10
+                if (digit == unit_digit):
+                    return times
+            return -1
+
+        unit_digit = num % 10
+        times = check(unit_digit, k)
+        if (times == -1):
+            return times
+        else:
+            if (num >= (times * k)):
+                return times
+            else:
+                return -1
+
+
+
+sol = Solution()
+x = sol.minimumNumbers(58, 9)
+print(x)