Leetcode - Sqrt(x) Solution — The Poor Coder

Given a non-negative integer x, compute and return the square root of x.

Since the return type is an integer, the decimal digits are truncated, and only the integer part of the result is returned.

Example 1:

Text

Input: x = 4
Output: 2

Example 2:

Text

Input: x = 8
Output: 2
Explanation: The square root of 8 is 2.82842..., and since the decimal part is truncated, 2 is returned.

Constraints:

0 <= x <= 2³¹ - 1

Solution in Python#

Python

class Solution:
    def mySqrt(self, x: int) -> int:
        return int(x**0.5)

May 112021

Leetcode - Number of Good Pairs Solution

Given an array of integers nums. A pair (i,j) is called good if nums[i] == nums[j] and i < j. Return the number of good pairs. Example 1: Example 2: Example 3: Constraints: 1 <= nums.length <= 100 1 <= nums[i] <= 100…

leetcode array Hash Table1 min read

May 062021

Leetcode - Maximum 69 Number Solution

Given a positive integer num consisting only of digits 6 and 9. Return the maximum number you can get by changing at most one digit (6 becomes 9, and 9 becomes 6). Example 1: Example 2: Example 3: Constraints: 1 <= num…

leetcode Math1 min read

May 032021

Leetcode - Subtract the Product and Sum of Digits of an Integer Solution

Given an integer number n, return the difference between the product of its digits and the sum of its digits. Example 1: Example 2: Constraints: 1 <= n <= 10^5 Solution in Python

leetcode Math1 min read

Solution in Python#

Related posts

Leetcode - Number of Good Pairs Solution

Leetcode - Maximum 69 Number Solution

Leetcode - Subtract the Product and Sum of Digits of an Integer Solution