For any given number we would need to return the number in reverse, with the starting place to the end place. For example, for an input of 1423 we would need to return 3241 which is its exact reverse. To achieve this, we would use the same principle we use for splitting the number; the Divisibility by 10 rule.

```
public static int GetReversedNumber(int n)
{
int r, sum = 0, input = n;
if (n < 10) return n;
while (n != 0)
{
r = n % 10;
sum = sum * 10 + r;
n = n / 10;
}
return sum;
}
```

**How it works:**

The logic starts in the same way as splitting the numbers, but for every time a remainder is obtained, it is added up on to a sum and before adding up the remainder the sum is multiplied with a 10 so that it grows in one place in the number.

```
For an input 1423:
sum = 0*10 + 3 = 3
sum = 3*10 + 2 = 32
sum = 32*10 + 4 = 324
sum = 324*10 + 1 = 3241
```

Loops • Added 8 months ago

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

Loops
Strings

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

Loops

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

Loops

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

Loops

Sort the given unordered set of Binary digits

Loops
Sorting

Role-based Access Control in AWS - Assuming Roles and accessing via ASP.NET Core

AWS
ASP.NET Core

Top 10 LINQ methods we use in our everyday C# Development

C# Concepts

Implementing a Worker Service in ASP.NET Core

ASP.NET Core

Understanding Time Complexity and Big O notation in Algorithms

Algorithms

Creating ASP.NET Core Microservices in AWS using SAM and CloudFormation

AWS
ASP.NET Core