sinanduman

package teach;

public class FindBalance {
    /**
	 * write a recursion function that will state a given string has balanced
	 * parenthesis.
	 */
	public static void main(String[] args) {

		String[][] words = { 

sinanduman

package teach;

public class ProjectEulerProblem4 {

	/**
	 * A palindromic number reads the same both ways. The largest palindrome made 
	 * from the product of two 2-digit numbers is 9009 = 91 x 99.
	 * Find the largest palindrome made from the product of two 3-digit numbers.
	 */
	private static final int MAX = 999;

sinanduman

package teach;

import java.util.Arrays;

public class FindAnagram {
	/**
	 * Develop code that would match words as anagram. If they are anagram
	 * your code will change last element of each index from null to "T", else "F".
	 * And print the results.
	 * E.g. Tea and Eat, ate are anagram words.

sinanduman

public class FindReverse {

    public static void main(String[] args) {
        
        String longWord = "FourscoreandsevenyearsagoourfaathersbroughtforthonthiscontainentanewnationconceivedinzLibertyanddedicatedtothepropositionthatallmenarecreatedequalNowweareengagedinagreahtcivilwartestingwhetherthatnaptionoranynartionsoconceivedandsodedicatedcanlongendureWeareqmetonagreatbattlefiemldoftzhatwarWehavecometodedicpateaportionofthatfieldasafinalrestingplaceforthosewhoheregavetheirlivesthatthatnationmightliveItisaltogetherfangandproperthatweshoulddothisButinalargersensewecannotdedicatewecannotconsecratewecannothallowthisgroundThebravelmenlivinganddeadwhostruggledherehaveconsecrateditfaraboveourpoorponwertoaddordetractTgheworldadswfilllittlenotlenorlongrememberwhatwesayherebutitcanneverforgetwhattheydidhereItisforusthelivingrathertobededicatedheretotheulnfinishedworkwhichtheywhofoughtherehavethusfarsonoblyadvancedItisratherforustobeherededicatedtothegreattdafskremainingbeforeusthatfromthesehonoreddeadwetakeincr