chlng27

Author: YuriSpiridonov

Challenges/2021/February-LeetCoding-Challenge.md

@@ -51,6 +51,7 @@ None
 |856.|[Score of Parentheses](https://leetcode.com/problems/score-of-parentheses/)|~~Python~~|Medium|
 |581.|[Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/)|[Python](/Medium/581.ShortestUnsortedContinuousSubarray.py)|Medium|
 |946.|[Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences/)|[Python](/Medium/946.ValidateStackSequences.py)|Medium|
+|29.|[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)|[Python](/Medium/29.DivideTwoIntegers.py)|Medium|
 
 ## License
 The code is open-source and licensed under the [MIT License](/LICENSE).

Medium/29.DivideTwoIntegers.py

@@ -0,0 +1,57 @@
+'''
+    Given two integers dividend and divisor, divide two 
+    integers without using multiplication, division, and 
+    mod operator.
+
+    Return the quotient after dividing dividend by divisor.
+
+    The integer division should truncate toward zero, which 
+    means losing its fractional part. For example, 
+    truncate(8.345) = 8 and truncate(-2.7335) = -2.
+
+    Note:
+        - Assume we are dealing with an environment that 
+          could only store integers within the 32-bit signed 
+          integer range: [−2^31,  2^31 − 1]. For this problem, 
+          assume that your function returns 2^31 − 1 when the 
+          division result overflows.
+
+    Example:
+    Input: dividend = 10, divisor = 3
+    Output: 3
+    Explanation: 10/3 = truncate(3.33333..) = 3.
+
+    Example:
+    Input: dividend = 7, divisor = -3
+    Output: -2
+    Explanation: 7/-3 = truncate(-2.33333..) = -2.
+
+    Example:
+    Input: dividend = 0, divisor = 1
+    Output: 0
+
+    Example:
+    Input: dividend = 1, divisor = 1
+    Output: 1
+
+    Constraints:
+        - -2^31 <= dividend, divisor <= 2^31 - 1
+        - divisor != 0
+'''
+#Difficulty: Medium
+#989 / 989 test cases passed.
+#Runtime: 28 ms
+#Memory Usage: 14.3 MB
+
+#Runtime: 28 ms, faster than 92.03% of Python3 online submissions for Divide Two Integers.
+#Memory Usage: 14.3 MB, less than 58.58% of Python3 online submissions for Divide Two Integers.
+
+class Solution:
+    def divide(self, dividend: int, divisor: int) -> int:
+        min_number = -2**31
+        max_number = 2**31 - 1
+        result = abs(dividend) // abs(divisor)
+        if (dividend > 0 and divisor > 0) or (dividend < 0 and divisor < 0):
+            return min(result, max_number)
+        else:
+             return max(-result, min_number)

README.md

@@ -20,7 +20,7 @@ In this repository provided my Python solutions of LeetCode problems.
 
 2021:
 - [January LeetCoding Challenge](/Challenges/2021/January-LeetCoding-Challenge.md) - 27/31
-- [February LeetCoding Challenge](/Challenges/2021/February-LeetCoding-Challenge.md) - 21/28
+- [February LeetCoding Challenge](/Challenges/2021/February-LeetCoding-Challenge.md) - 22/28
 <br><br>
 ## Solutions
 *P.S. If you like this, please leave me a star.* ★
@@ -49,6 +49,7 @@ In this repository provided my Python solutions of LeetCode problems.
 |25.|[Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/)|[Python](/Hard/25.ReverseNodesink-Group.py)|Hard|`Linked List`, `Stack`|
 |26.|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)|[Python](https://github.com/YuriSpiridonov/LeetCode/blob/master/Easy/26.RemoveDuplicatesfromSortedArray.py)|Easy|Several solutions in one file|
 |27.|[Remove Element](https://leetcode.com/problems/remove-element/)|[Python](https://github.com/YuriSpiridonov/LeetCode/blob/master/Easy/27.RemoveElement.py)|Easy|
+|29.|[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)|[Python](/Medium/29.DivideTwoIntegers.py)|Medium|
 |33.|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)|[Python](https://github.com/YuriSpiridonov/30-Day-LeetCoding-Challenge/blob/master/Week%203/SearchinRotatedSortedArray.py)|Medium|
 |34.|[Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)|[Python](/Medium/34.FindFirstandLastPositionofElementinSortedArray(BinarySearch).py)|Medium|`Binary Search`|
 |34.|[Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)|[Python](https://github.com/YuriSpiridonov/LeetCode/blob/master/Medium/34.FindFirstandLastPositionofElementinSortedArray.py)|Medium|