This repository consists of few common coding problems which are based on Arrays.

• Anagrams:

  Java Code for checking whether two given strings are anagrams of each other or not.

• Armstrong:

  Java Code for checking whether a number is an armstrong number.

• Factorial:

  Java Code for checking whether two given strings are anagrams of each other or not.

• Fibonacci Series:

  Java Code for checking whether two given strings are anagrams of each other or not.

• Pallindrome:

  Java Code for checking a number is pallindrome or not.

• Prime Number:

  Java Code to confirm if a given number is prime or not.

• Number of Primes:

  Java Code to check the number of prime factors of a number.