Algorithms: Power set, Word break ,Permute String, Kadane's Algorithm, Max Subarray

Permute A String

	package com.tvidushi.string.skipletter;
	public class PermuteString {
	private static void permute(String prefix, String s){
	System.out.print("["+s+"] ,");
	int n=s.length();
	if (n==0){
	//System.out.println("-------------------------------"+prefix);
	}else
	{
	for(int i=0;i<n;i++){
	//System.out.println(" here I am "+prefix);
	permute(prefix + s.charAt(i), s.substring(0,i) + s.substring(i+1,n));
	}
	}
	}
	public static void permute(String s){
	permute("",s);
	}
	public static void main(String[] args) {
	//
	permute("ABC");
	}
	}

view raw PermuteString.java hosted with ❤ by GitHub