CareerCup

/*
 Given a array of positive integers, find all possible triangle triplets that can be formed from this array. 
eg: 9 8 10 7 
ans: 9 8 10, 9 8 7, 9 10 7, 7 8 10 
Note : array not sorted
 */
public class TriangleTriplet {

	
	public void triangleTriplet(int a[])
	{
		int n=a.length;
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<n;j++)
			{
				for(int k=0;j<n;j++)
				{
					if(i!=j && j!=k && i!=k)
					if(a[i]+a[j]>a[k]  && a[j]+a[k]>a[i] && a[i]+a[k]>a[j])
					{
						System.out.println(a[i]+" "+a[j]+" "+a[k]);
					}
				}
			}
		}
	}
	
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		int a[]={9,8,7,10};
		
		new TriangleTriplet().triangleTriplet(a);

	}

}

/*
 Write an algorithm to convert the given input string to the expected output string. The input string shall be the length of few million characters. So the output has to be updated in the same string... 

Input String = "ABBCDEFGGGGGGGGHHXX..<20 more X>..XYY..." 
Expected output = "A1B2C1D1E1F1G8H2X23Y2..." 

Note: The count of each character has to be appended with the same character in the output string
 */
public class Problem1 {

	/**
	 * @param args
	 */
	
	
	public String appendFrequency(String s)
	{
		String result="";
		
		char c[]=s.toCharArray();
		
		
		int count=0;
		int i=0;
		char x=c[0];
		while(i<c.length)
		{
			count=0;
			   
			   x=c[i];
		   while(i<c.length && c[i]==x)
		   {
			   count++;
			   i++;
		   }
		   result=result+x+count;
		   
		
		}
		
		return result;
	}
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		System.out.println(new Problem1().appendFrequency("aabbbbbcccdd"));

	}

}

/*
Write an algorithm to convert the given input string to the expected output string. The input string shall be the length of few million characters. So the output has to be updated in the same string...

Input String = "ABBCDEFGGGGGGGGHHXX..<20 more X>..XYY..."
Expected output = "A1B2C1D1E1F1G8H2X23Y2..."

Note: The count of each character has to be appended with the same character in the output string
*/
public class Problem1 {

/**
* @param args
*/


public String appendFrequency(String s)
{
String result="";

char c[]=s.toCharArray();


int count=0;
int i=0;
char x=c[0];
while(i<c.length)
{
count=0;

x=c[i];
while(i<c.length && c[i]==x)
{
count++;
i++;
}
result=result+x+count;


}

return result;
}
public static void main(String[] args) {
// TODO Auto-generated method stub

System.out.println(new Problem1().appendFrequency("aabbbbbcccdd"));

}

}