astkaasa

public class DeleteMiddleNode {

    public static void main( String[] args ) {
		LinkNode a = new LinkNode ( 5 );
		LinkNode b = new LinkNode ( 10 );
		LinkNode c = new LinkNode ( 9 );
		LinkNode d = new LinkNode ( 4 );
		LinkNode e = new LinkNode ( 7 );

		a.setNext( b );

astkaasa

public class KthToLast {

    public static void main( String[] args ) {
		LinkNode head = new LinkNode( 1 );
		head.append( new LinkNode( 10 ) );
		head.append( new LinkNode( 18 ) );
		head.append( new LinkNode( 5 ) );
		head.append( new LinkNode( 9 ) );
		head.append( new LinkNode( 100 ) );
		head.append( new LinkNode( 20 ) );

astkaasa

import java.util.HashSet;
import java.util.Set;

public class FindDuplicateLL {

	public static void main( String[] args ) {
		LinkNode head = new LinkNode( 1 );
		head.append( new LinkNode( 2 ) );
		head.append( new LinkNode( 3 ) );
		head.append( new LinkNode( 1 ) );

astkaasa

import java.util.*;

public class PermutationChar {

    public static void main( String[] args ) {
		String[] strArray = { "Guo Haoxuan", "Haoxuan Guo" };
		System.out.println( isPermutation ( strArray[0], strArray[1] ) );
	}	

astkaasa

import java.util.*;

public class UniqueChar {

    public static void main( String[] args ) {
		String[] strArray = { "abcdef", "dssfagagalglag" };
		for ( String str : strArray )
			System.out.println( isUniqueChar1( str ) );
		for ( String str : strArray )
			System.out.println( isUniqueChar2( str ) );

astkaasa

#include <iostream>
using namespace std;

void reverse(char* str){
    char* end = str;	
	char temp;
	while(*end != '\0'){
		end++;
	}
	end--;