In mathematics, the factorial of a non-negative integer n, denoted by n!, is the product of all positive integers less than or equal    to n. For example, The value of 0! is 1, according to the convention for an empty product.
e.g 5! = 120 i.e 5x4x3x2x1=120

In mathematics, the Fibonacci numbers, commonly denoted Fₙ, form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is, and for n > 1.

swap the input variables
input: a=10,b=20
output:a=20,b=10

The greatest common divisor (GCD) of two nonzero integers a and b is the greatest positive integer d such that d is a divisor of both a and b; that is, there are integers e and f such that a = de and b = df, and d is the largest such integer. The GCD of a and b is generally denoted gcd(a, b).

HCF of two numbers is the highest common number, which is available in both the numbers. ... Sometimes, it is also called the greatest common factor (GCF) or greatest common divisor (GCD). For example, the HCF of 2 and 4 is 2, because 2 is the number which is common to both 2 and 4.

In computer science, selection sort is an in-place comparison sorting algorithm. It has an O(n²) time complexity, which makes it inefficient on large lists, and generally performs worse than the similar

Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order. The pass through the list is repeated until the list is sorted.

A vowel is a syllabic speech sound pronounced without any stricture in the vocal tract. Vowels are one of the two principal classes of speech sounds, the other being the consonant. Vowels vary in quality, in loudness and also in quantity.
In  english language there are 5 vowels "a, e, i, o, u"

input : hello world
output: Hello World

prime: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41...
Alternate Prime: 2, 5, 11, 17, 23, 31, 41...

In mathematics, particularly in linear algebra, matrix multiplication is a binary operation that produces a matrix from two matrices. For matrix multiplication, the number of columns in the first matrix must be equal to the number of rows in the second matrix. The resulting matrix, known as the matrix product, has the number of rows of the first and the number of columns of the second matrix. The product of matrices A and B is denoted as AB

In computer science, a linear search or sequential search is a method for finding an element within a list. It sequentially checks each element of the list until a match is found or the whole list has been searched.

An Armstrong number is a number such that the sum  of its digits raised to the third power is equal to the number itself.
For example, 371 is an Armstrong number, since 3^3+7^3+1^3 = 371

There will be two arrays of integers. Determine all integers that satisfy the following two conditions:

- The elements of the first array are all factors of the integer being considered
- The integer being considered is a factor of all elements of the second array
These numbers are referred to as being between the two arrays. Determine how many such numbers exist.

Example

input:
a=[2,4]
b=[16,32,96]

output: 3

Given a vector array (A) and a rotation count(k) rotate the array K times,where rotation indicates shifting each element ofthe array 1 digit right, so after k rotationsgiven an index the program should return the element at that index (from the resulting array)

Given an array of size n, return the majority element.
The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.

Input :- [2,3,3,2,2]
Output :- 2

## [Sorting the Sentence](https://leetcode.com/problems/sorting-the-sentence/)