# Sqrt(x) Problem Solution [Leetcode]

Sqrt(x) Problem Solution: 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.

You are not allowed to use any built-in exponent function or operator, such as `pow(x, 0.5)` or `x ** 0.5`.

Example :

```Input: x = 4
Output: 2```

## Problem Solution In Python

``````class Solution:
def mySqrt(self, x: int) -> int:
return floor(sqrt(x))
``````

## Problem Solution In Java

``````public class Solution {
public int mySqrt(int x) {
int left=1,right =x, result=0;
while(left<right){
int mid = left + (right - left)/2;
if(mid<x/mid){
left = mid+1;
}else{
right = mid;
}
}
return (left==x/left)?left:left-1;
}
}
``````

## Problem Solution In C++

``````class Solution {
public:
int mySqrt(int x) {
int y = 1;
int n = x;
while (n > y) {
n = y +  (n - y) / 2;
y = x / n;
}
return n;
}
};
``````

## Problem Solution In C

``````long int mySqrt(int x){
long int i=1,rt;
if(x==0) return 0;
for(i;i*i<=x;i++)
{
rt=i;
}
return rt;
}``````