An open API service indexing awesome lists of open source software.

https://github.com/muskanmi/arrayprocessing

A repository of few common coding problems which are based on Arrays coded using Java.
https://github.com/muskanmi/arrayprocessing

hacktoberfest java java-8 java-8-lambda java-library

Last synced: about 2 months ago
JSON representation

A repository of few common coding problems which are based on Arrays coded using Java.

Awesome Lists containing this project

README

          

# Code on Arrays:

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

## Programs

* [Anagrams](https://github.com/muskanmi/ArrayProcessing/blob/master/anagrams.java):

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

* [Armstrong](https://github.com/muskanmi/ArrayProcessing/blob/master/armstrong.java):

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

* [Factorial](https://github.com/muskanmi/ArrayProcessing/blob/master/factorial.java):

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

* [Fibonacci Series](https://github.com/muskanmi/ArrayProcessing/blob/master/fibonacci_series.java):

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

* [Pallindrome](https://github.com/muskanmi/ArrayProcessing/blob/master/pallindrome.java):

Java Code for checking a number is pallindrome or not.

* [Prime Number](https://github.com/muskanmi/ArrayProcessing/blob/master/prime_number.java):

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

* [Number of Primes](https://github.com/muskanmi/ArrayProcessing/blob/master/number_of_primes.java):

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