Special Numbers Loops Posted May 09, 2020

A Perfect square is a whole number which is produced by multiplying two equal integers. In other words, a number which has a square root as an integer is called a Perfect square. Examples are 1, 4, 9, 25, .. and such. For any given number, we would need to find if there is a number which multiplied by itself results in the same number.

This can be implemented in two ways: one by looping till half the number and check if at each iteration multiplying the counter with itself results in the number.

```
public static bool IsPerfectSquare(int n)
{
for (int i = 1; i <= n / 2; i++)
{
if (i * i == n)
{
return true;
}
}
return false;
}
```

Or by using the Math library and find the square root of the number. Then see if the obtained square root is an integer or not.

```
public static bool IsPerfectSquareBySqRoot(int n)
{
double root = Math.Sqrt(n);
if (root - Math.Floor(root) == 0)
{
return true;
}
return false;
}
```

Compute and generate a compressed string for a given string containing repetitions

Find all possible natural numbers below a given limit such that a3+b3 = c3+d3

Find all the pairs in a given ordered set of numbers whose sum is equal to a given input sum

Find all the pairs in a given unordered set of numbers whose sum is equal to a given input sum

Sort the given unordered set of Binary digits

Implementing stream based communication with gRPC and ASP.NET Core

Building a simple Client-Server Interaction with gRPC in ASP.NET Core

Role-based and Claims-based Authorization in ASP.NET Core using Policies - Hands on

Understanding How Antiforgerytoken works in ASP.NET Core MVC

Implementing Cognito User Login and Signup in ASP.NET Core using AWS SDK