You need to write a simple Java program to check if a given String is palindrome or not. A Palindrome is a String which is equal to the reverse of itself, e.g., "Bob" is a palindrome because of the reverse of "Bob" is also "Bob." Solve using either recursive or iterative method.

Write a program to find repeated characters in a String. For example, if given input to the program is "Monitor", it should print all duplicates characters, i.e. characters appear more than once in String and their count e.g. o = 2 because character 'o' has appeared twice in String "Monitor"

The README.md file may have some typos or grammatical errors. Solve them to improve the file.

Create a README.md file for Armstrong number and the implementation to check whether a number is an Armstrong number or not.

Writing code for any one of the listed concept (check boxes symbolizes the concept topic).
You can do the same for more than one topic also as per your interest.

1. Lists

• Linked List

• Singly Linked List

• Doubly Linked List

• Circular Linked List

• Reversing Linked List

• Stack

• Using Arrays

• Using linked list

• Queue

• Using Arrays

• Using Linked List

• Priority Queues
  - [ ] Using Linked List
  - [ ] Using Heap

2. Trees

• Binary Tree
• Binary Search Tree
• Heaps
• Binomial Heap
• Fibonacci Heap
• Segmented Tree
• Binary Indexed Tree
• AVL Trees
• Multi Way Trees

3. Hash Tables and Hash Functions

Create a README.md file and implementation of Boyer Moore algorithm. The implementation can be done using Java or python.

Write a program to check if two given String is Anagram of each other. A string is said to be an anagram if it contains the same characters and same length, but in a different order.
Example: army and Mary are anagrams.

Create a CONTRIBUTING.md file with the general instructions to contribute to this repository.

Write a Java program to print all permutations of a given String. For example, if given String is "BAD" then your program should print all 6 permutations of this string, e.g. "BAD," "ABD," "ADB," "DAB," "DBA," and "BDA"

Write a code for finding the factorial of a given number.

Write a Java program to check if a given number is prime or not i.e. a number which is not divisible by any other number other than 1 and itself.

Give the code that prints any two numbers as output between 1-100 such that the two numbers when added yield a prime number less than 100.
Example:
Input: 71
output:(70,1)....

Input: 7
Output:(3,4),(6,1) etc
Any 1 pair as output will work.

Write a code that prints all the values divisible by 7 in the range of 1 to 100 in reverse order.

Write a program to calculate the square root of a number without using the Math.sqrt() function of JDK.

Create a file giving a brief about inheritance in Java.

Given two strings, find the longest common substring, if there is nothing in common, print an empty string.

Write the code for finding the Middle element of linked list in one pass.

Star the repository and give the code in any preferable language to print either of the following pattern:

$ $ $ $
$ $
$ $
$ $ $ $

A
A B
A B C
A B C D
A B C D E

One of the file named ObjectClone().java in this repository does not follow the naming convention of the file and has to be changed to ObjectClone.java.

Given two numbers a and b between 1 and 100, write a program that can print the even elements between a and b.
Example:
a=4, b= 17
Output: 6 8 10 12 14 16

Write a Java program to sort an array of integers using a quick sort algorithm. You cannot use any library method, e.g. JDK or a third party library, which means, you need to first implement the quicksort algorithm and then sort the array.

Write a Java code for post order traversal without using the recursive method.

Write a program to find if a given number is Palindrome or not.

Write a Java program to find if a given year is a leap year or not.

Write a Java code where a resource is accessed by multiple threads. You need to write code in such a way that no deadlock should occur.
Hint: The trick to solve this problem is acquiring resources in order and release them in reverse order, e.g. first acquire resource R1 and only if you have got R1 to go for R2. This way, you can avoid deadlock.

Write a program to implement the insertion sort algorithm in Java. The program should take an unsorted array and sort it using insertion sort algorithm.

Write a program to implement the bubble sort algorithm in Java.

A Travis config file has to be created with several bash files for checking syntax of the code submitted in PRs

1. A travis.yml file will be created in root. The purpose of this file would be to set up a basic Linux node on Travis and fetch all files that have been changed/created in the specific PR
2. Further, a directory "build_scripts" will be created that will contain a bash file for each language. The purpose of each file is to install the required compiler and dependencies and check syntax for a particular language

Travis CI will execute the desired file from "build_scripts" after inspecting the language of files present in the PR.