HackerRank: Bot saves princess

Here is the link of the question : Click Here

Download Code: Click Here
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
/* Head ends here */
static void displayPathtoPrincess(int n, String [] grid){
int pos=0;

// System.out.println("n= "+n+" S length = "+grid[1]);
String newArray[] = new String[n*n];
//System.out.println(grid.length);
/*for(int j=0;j{
System.out.println(grid[j]);
}*/
//System.out.println("---------------");
for(int i=0,k=0;i{
for(int j=0;j {
newArray[k] = ""+grid[i].charAt(j);
// System.out.println(grid[i]);
k++;
}
}
// for(int i =0;i // System.out.println(i+" "+newArray[i]);
if(newArray[0].equals("p"))
pos = 0;
else if(newArray[n-1].equals("p"))
pos = n-1;
else if(newArray[n*(n-1)].equals("p"))
pos = n*(n-1);
else if(newArray[n*(n-1) + (n-1)].equals("p"))
pos = (n*(n-1) + (n-1));

int m = ((n*n)+1)/2 -1 ;


m = (n+1)/2;
if(pos==0)
{
for(int i=0;i {
System.out.println("LEFT");
}
for(int i=0;i {
System.out.println("UP");
}
}
if(pos==n-1)
{
for(int i=0;i {
System.out.println("RIGHT");
}

for(int i=0;i {
System.out.println("UP");
}
}
if(pos==n*(n-1))
{
for(int i=0;i {
System.out.println("LEFT");
}

for(int i=0;i {
System.out.println("DOWN");
}
}
if(pos==(n*(n-1) + (n-1)))
{
for(int i=0;i {
System.out.println("RIGHT");
}

for(int i=0;i {
System.out.println("DOWN");
}
}
}
/* Tail starts here */
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int m;
m = in.nextInt();
String grid[] = new String[m];
for(int i = 0; i < m; i++) {
grid[i] = in.next();
}

displayPathtoPrincess(m,grid);
}
}

Download Code: Click Here

TechGig Solution - May Edition 2013 - Easy Level - Partition Problem

Partition Problem:
Hi,
I am providing the solution of Partition Problem here. My score in the contest is 100 in java, if you have any better solution of this problem, feel free to share it.

Download Link : Code
Download link : Code
public class Partition {

/**
* @param args
*/
public static final String yes = "Yes";
public static final String no = "No";
public static final String invalid = "Invalid";
public static void main(String[] args) {
// TODO Auto-generated method stub
int arr[] = {1, 5, 11,5};

System.out.println(findPartiion(arr,4));

}
// A utility function that returns true if there is a subset of arr[]
// with sun equal to given sum
public static boolean isSubsetSum (int arr[], int n, int sum)
{
System.out.println(n+" "+sum);
// Base Cases
if (sum == 0)
return true;
if (n == 0 && sum != 0)
return false;

// If last element is greater than sum, then ignore it
if (arr[n-1] > sum)
return isSubsetSum (arr, n-1, sum);

/* else, check if sum can be obtained by any of the following
(a) including the last element
(b) excluding the last element
*/
return isSubsetSum (arr, n-1, sum) || isSubsetSum (arr, n-1, sum-arr[n-1]);
}

// Returns true if arr[] can be partitioned in two subsets of
// equal sum, otherwise false
public static String findPartiion (int arr[], int n)
{
// Calculate sum of the elements in array
int sum = 0;
for (int i = 0; i < n; i++)
{
sum += arr[i];
if(arr[i]<0)
return invalid;
}
// If sum is odd, there cannot be two subsets with equal sum
if (sum%2 != 0)
return no;

// Find if there is subset with sum equal to half of total sum
boolean b = isSubsetSum (arr, n, sum/2);
if(b)
return yes;
else
return no;

}

}

Download Link : Code
Download link : Code

Techgig: Visit a Colony

Techgig: Visit a Colony
To view this question : Click Here

I have given the solution here, My score in the contest is 100. If you have any solution better than this feel free to share it.

Download Code: Click Here or Click Here

import java.io.*;
public class CandidateCode
{
public static int house_condition(int[] input1,int input2)
{
//Write code here
//Write code here

int houseScore[] = input1;
int houseNo = input2;
char good = 'G';

char bad = 'B';

char houseCondition[] = new char[houseScore.length];

if(input1.length==0)
return -1;
if(houseScore.length==1)
{
if(houseScore[0]==1)
return 1;
else if(houseScore[0]==0)
return -1;
else if(houseScore[0]==2 || houseScore[0]==3)
return -1;
}
else
{
for(int i=0;i{

if(i==0)
{
houseCondition[0]=good;
if(houseScore[i]==1)
houseCondition[i+1]=bad;

if(houseScore[i]==2)
houseCondition[i+1]=good;

if(houseScore[i]==3)
return -1;
continue;
} // END-IF (For first value in an array)

if(i==houseScore.length-1)
{
if(houseCondition[i]==good)
{
if(houseScore[i]==0)
{
return -1;
}
if(houseScore[i]==1)
{
if(houseCondition[i-1]==good)
return -1;
}
if(houseScore[i]==2)
{
if(houseCondition[i-1]==bad)
return -1;
}
if(houseScore[i]==3)
return -1;
}

if(houseCondition[i]==bad)
{
if(houseScore[i]==0)
{
if(houseCondition[i-1]==good)
return -1;
}
if(houseScore[i]==1)
{
if(houseCondition[i-1]==bad)
return -1;
}
if(houseScore[i]==2 || houseScore[i]==3)
return -1;
}
} // END -IF (When i is at last position)


else
{
if(houseCondition[i]==good)
{
if(houseScore[i]==3)
{
if(houseCondition[i-1]==bad)
return -1;
else
houseCondition[i+1]=good;
}

if(houseScore[i]==2)
{
if(houseCondition[i-1]==good)
houseCondition[i+1]=bad;
else
houseCondition[i+1]=good;
}
if(houseScore[i]==1)
{
if(houseCondition[i-1]==good)
return -1;
else
houseCondition[i+1]=bad;
}
if(houseScore[i]==0)
{
return -1;
}
}

if(houseCondition[i]==bad)
{
if(houseScore[i]==3)
return -1;

if(houseScore[i]==2)
{
if(houseCondition[i-1]==bad)
return -1;

else
houseCondition[i+1]=good;
}

if(houseScore[i]==1)
{
if(houseCondition[i-1]==bad)
houseCondition[i+1]=good;

else
houseCondition[i+1]=bad;
}
if(houseScore[i]==0)
{
if(houseCondition[i-1]==good)
return -1;
else
houseCondition[i+1]=bad;
}
}
}
}
}

if(houseCondition[houseNo-1]==good)
return 1;
else
return 0;
}
}


Download Code: Click Here or Click Here

TechGig Solution: Crossing the river

Crossing the river:
Here is link of the question

I started with score of 10 then i stuck at 80 and 90 and finally i got score of 100. Here is my solution if you have better solution please share with us.

Download the below Code: Click Here

import java.util.ArrayList;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;



public class CrossingRiver {

private static int previousMax;

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
String input[] = {""};
System.out.println(bridge(input));
}

@SuppressWarnings("unchecked")
public static int bridge(String[] input1)
{
System.out.println(input1.length);
if(input1.length==0)
return 0;
int arr[];

arr=new int[2*input1.length];
StringTokenizer st;
for(int i=0,j=0;i {
st = new StringTokenizer(input1[i],"#");
while(st.hasMoreElements())
{
arr[j] = Integer.valueOf((String)st.nextElement());
j++;
}

}
for(int j:arr)
System.out.println(j);

Set set = new HashSet();
for(int j=0;j {
boolean b = set.add(arr[j]);
if(b==false)
return -1;
}
set.clear();
for(int j=1;j {
boolean b = set.add(arr[j]);
if(b==false)
return -1;
}


if(input1.length==1)
{
if(input1[0].equals(""))
return 0;

return 1;
}
else
{
int cityFirst;
int citySecond;
int cityFirstInside;
int citySecondInside;
int start;
int end;
int previous1;
boolean flag=false;
int max=0;

ArrayList al = new ArrayList();

for(int i=0;i {
cityFirst = arr[i];
citySecond = arr[i+1];
previous1 = citySecond;

for(int j=0;j {
cityFirstInside = arr[j];
citySecondInside = arr[j+1];
//1#2,2#3,3#1,4#4,5#7,6#5,7#6

if(cityFirst==cityFirstInside && citySecond==citySecondInside)
{
System.out.println("--------------------"+cityFirst+"----"+cityFirstInside+"------------");
max++;
}

else if(cityFirstInside>cityFirst)
{

if(previous1 {
max++;
System.out.println("happy"+cityFirstInside);
previous1=citySecondInside;

}
}

else if(cityFirstInside {
System.out.println("C1="+cityFirstInside+" C2="+citySecondInside+" max="+max);
if(j==0)
{
max++;
al.add(citySecondInside);
}
else
{


for(int p=0;p {
if(!(citySecondInside>(Integer)al.get(p)))
{
System.out.println("hhh");
flag=true;
break;
}

}
System.out.println(flag);
if(!flag)
{

max++;
al.add(citySecondInside);
// System.out.println("C1="+cityFirstInside+" C2="+citySecondInside+" max="+max);
}
flag=false;
}
}
}

al.clear();

if(max>previousMax)
previousMax = max;
max=0;
}
}
return previousMax;
}



Download the above Code: Click Here

Java: Towers Of Hanoi

/*
Towers Of Hanoi.
There are three pegs: A, B and C. There are n disks. All disks are different in size.
The disks are initially stacked on peg A so that they increase in size from the top to the bottom.
The goal is to transfer the entire tower from the A peg to the C peg.
One disk at a time can be moved from the top of a stack either to an empty peg or to
a peg with a larger disk than itself on the top of its stack.

The method should return a sequence of disk moves, each move is a String with two letters (A, B or C)
corresponding to the peg the disk moves from and the peg it moves to.
For example, the move "AC" means that a top disk from peg A should be moved to peg C.
*/

1. import java.util.ArrayList;


2. importjava.util.List;


3.  


4.  


5. publicclassTowersOfHanoi {


6.  


7.     privatestaticList<String> list= newArrayList<String>();


8.     staticString a="A";


9.     staticString c="C";


10.     staticString b="B";


11.     staticString s="";


12.     publicstaticvoidmove(intn, intstartPole, intendPole) {


13.         if(n== 0){


14.           return;


15.         }


16.         intintermediatePole = 6- startPole - endPole;


17.         move(n-1, startPole, intermediatePole);


18.         System.out.println("Move "+n + " from "+ startPole + " to "+endPole);


19.         if(startPole==1)


20.             s=s+a;


21.         if(startPole==2)


22.             s=s+b;


23.         if(startPole==3)


24.             s=s+c;


25.         if(endPole==1)


26.             s=s+a;


27.          


28.         if(endPole==2)


29.             s=s+b;


30.         if(endPole==3)


31.             s=s+c;


32.          


33.         list.add(s);


34.         s="";


35.         move(n-1, intermediatePole, endPole);


36.       }


37.        


38.     publicstaticList<String> transferFromAtoC(intn) {


39.         /*


40.           Towers Of Hanoi.


41.           There are three pegs: A, B and C. There are n disks. All disks are different in size.


42.           The disks are initially stacked on peg A so that they increase in size from the top to the bottom.


43.           The goal is to transfer the entire tower from the A peg to the C peg.


44.           One disk at a time can be moved from the top of a stack either to an empty peg or to


45.           a peg with a larger disk than itself on the top of its stack.


46.  


47.           The method should return a sequence of disk moves, each move is a String with two letters (A, B or C)


48.           corresponding to the peg the disk moves from and the peg it moves to.


49.           For example, the move "AC" means that a top disk from peg A should be moved to peg C.


50.          */


51.          


52.         move(n, 1, 3);


53.         returnlist;


54.     }


55.       publicstaticvoidmain(String[] args) {


56.           List l1 = newArrayList();


57.         transferFromAtoC(1);


58.         System.out.println(list);


59.       }


60. }

Download Link: Click Here

Java: Set Intersection

/*
Please implement this method to
return a Set equal to the intersection of the parameter Sets
The method should not chage the content of the parameters.
*/

1. import java.util.HashSet;


2. import java.util.Iterator;


3. import java.util.NoSuchElementException;


4. import java.util.Set;




6. public class SetIntersection {


7. /**


8. * @param args


9. */




11. private static Set<Object> s1;


12. private static Set<Object> s2;


13. public static Set<Object> getIntersection(Set<Object> a, Set<Object> b) {


14. /*


15. Please implement this method to


16. return a Set equal to the intersection of the parameter Sets


17. The method should not chage the content of the parameters.


18. */




20. s1 =a;


21. s2 = b;


22. Object ob;


23. Set<Object> s3 = new HashSet<Object>();






26. Iterator<Object> it1 = s1.iterator();


27. Iterator<Object> it2 = s2.iterator();




29. System.out.println("Set 1");


30. while(it1.hasNext())


31. {


32. System.out.println(it1.next());


33. }


34. System.out.println("Set 2");


35. while(it2.hasNext())


36. {


37. System.out.println(it2.next());


38. }




40. it1 = s1.iterator();


41. while(it1.hasNext())


42. {


43. System.out.println("hi");


44. try


45. {


46. ob = it1.next();


47. //System.out.println(ob);


48. if(s2.contains(ob))


49. {


50. // System.out.println("contain element is "+ob);


51. s3.add(ob);


52. }


53. }


54. catch(ClassCastException cse)


55. {


56. cse.printStackTrace();


57. }


58. catch(NoSuchElementException ne)


59. {


60. ne.printStackTrace();


61. }






64. }




66. return s3;


67. }






70. public static void main(String[] args) {


71. // TODO Auto-generated method stub


72. Set<Object> s1 = new HashSet<Object>();


73. Set<Object> s2 = new HashSet<Object>();


74. s1.add(3);


75. s1.add(4);


76. s1.add(5);


77. s1.add(7);


78. s1.add("hi");


79. s1.add(3.4);


80. s2.add(1);


81. s2.add(2);


82. s2.add(3);


83. s2.add(7);


84. s2.add("hi");


85. s2.add(new Object());


86. Set<Object> s3 = getIntersection(s1,s2);


87. Iterator<Object> it = s3.iterator();


88. System.out.println("Set 3");


89. while(it.hasNext())


90. {


91. System.out.println(it.next());


92. }


93. }


94. }

Download Link: Click Here

Java: Prime Number List

/*
Please implement this method to
return a list of all prime numbers in the given range (inclusively).
A prime number is a natural number that has exactly two distinct natural number divisors, which are 1 and the prime number itself.
The first prime numbers are: 2, 3, 5, 7, 11, 13
*/

 

1. import java.util.List;


2. import java.util.ArrayList;




4. public class PrimeNumber {


5. /**


6. * @param args


7. */


8. public static void main(String[] args) {


9. // TODO Auto-generated method stub


10. System.out.println(getPrimeNumbers(481,500));


11. }


12. public static List<Integer> getPrimeNumbers(int from, int to) {


13. /*


14. Please implement this method to


15. return a list of all prime numbers in the given range (inclusively).


16. A prime number is a natural number that has exactly two distinct natural number divisors, which are 1 and the prime number itself.


17. The first prime numbers are: 2, 3, 5, 7, 11, 13


18. */




20. List<Integer> list = new ArrayList<Integer>();


21. boolean b=false;


22. for(int j=from;j<=to;j++)


23. {


24. b=false;


25. System.out.println("from "+from);


26. int i=2;


27. for(;i<j/2;i++)


28. {




30. if(j%i==0)


31. {


32. b=true;


33. break;


34. }






37. }


38. System.out.println("j= "+j);


39. System.out.println("b= "+b);


40. if(b==false && j!=1 && j!=0)


41. list.add(j);




43. }




45. System.out.println(list);


46. return list;


47. }


48. }

 

Download Link: Click Here

Java: Positive Number Array

/*
Please implement this method to
return a new array with only positive numbers from the given array.
The elements in the resulting array shall be sorted in the ascending order.

*/

 

1. public class PositiveNumberArray {


2. /**


3. * @param args


4. */


5. public static void main(String[] args) {


6. // TODO Auto-generated method stub


7. int a[] = {3,5,6,30,-3,-3,-3,5,3,-3};


8. for(int i : retainPositiveNumbers(a))


9. System.out.println(i);


10. }




12. public static int[] retainPositiveNumbers(int[] a) {


13. /*


14. Please implement this method to


15. return a new array with only positive numbers from the given array.


16. The elements in the resulting array shall be sorted in the ascending order.




18. */




20. int len=0;


21. int b[];


22. for(int i=0;i<a.length;i++)


23. {


24. if(a[i]>0)


25. len++;


26. }






29. b = new int[len];


30. for(int i=0,j=0;i<a.length;i++)


31. {


32. if(a[i]>0)


33. {


34. b[j]=a[i];


35. j++;


36. }


37. }




39. int temp;


40. for(int i=0;i<b.length-1;i++)


41. {


42. for(int j=i+1;j<b.length;j++)


43. {


44. if(b[j]<b[i])


45. {


46. temp=b[j];


47. b[j]=b[i];


48. b[i]=temp;


49. }


50. }




52. }




54. return b;


55. }


56. }

Download Link: Click Here

Java: String Pailndrome

/*
Definition: A palindrome is a string that reads the same forward and backward.
For example, "abcba" is a palindrome, "abab" is not.
Please implement this method to
return true if the parameter is a palindrome and false otherwise.
*/

 

1. public class Palindrome {


2. /**


3. * @param args


4. */


5. public static void main(String[] args) {


6. // TODO Auto-generated method stub


7. System.out.println(isPalindrome("cbc"));


8. }


9. public static boolean isPalindrome(String s) {


10. /*


11. Definition: A palindrome is a string that reads the same forward and backward.


12. For example, "abcba" is a palindrome, "abab" is not.


13. Please implement this method to


14. return true if the parameter is a palindrome and false otherwise.


15. */




17. String temp;


18. int len = s.length();


19. char []arr = new char[len];


20. for(int i=len-1,j=0;i>=0;i--,j++)


21. {




23. arr[j]=s.charAt(i);


24. }




26. temp = new String(arr);


27. System.out.println("temp "+temp+"\ns "+s);


28. if(temp.equals(s))


29. return true;


30. return false;


31. }


32. }

Download Link: Click Here

Java: Get Sum of Numbers in a String

Download Link: http://txtup.net/dQNDr

/*

Source Question: betterprogrammer.com
Please implement this method to
return the sum of all integers found in the parameter String. You can assume that
integers are separated from other parts with one or more spaces (' ' symbol).
For example, s="12 some text 3 7", result: 22 (12+3+7=22)
*/

 

1. import java.util.regex.Matcher;


2. import java.util.regex.Pattern;


3. public class GetSumOfNumbers {


4. public static void main(String[] args) {




6. System.out.println(getSumOfNumbers("ss34 gbb 65"));


7. }




9. public static int getSumOfNumbers(String s) {


10. /*


11. Please implement this method to


12. return the sum of all integers found in the parameter String. You can assume that


13. integers are separated from other parts with one or more spaces (' ' symbol).


14. For example, s="12 some text 3 7", result: 22 (12+3+7=22)


15. */


16. //s="kkk 4 jj 9d kj 99 kjdj 9 kj 9";


17. Pattern p = Pattern.compile("\\d+");


18. Matcher m = p.matcher(s);


19. int sum=0;


20. while(m.find())


21. {


22. //System.out.println(m.start()+" "+m.end());


23. sum = sum + Integer.parseInt(s.substring(m.start(), m.end()));


24. }




26. return sum;


27. }


28. }

Download Link: http://txtup.net/dQNDr

The Great Indian Programming League 2013 - March Edition Level:Medium

Here is the Link of question and description of 

Four Persons

I am providing you the solution of the above question.

Mybest score on this is 99.99.

Repost Code with better one.(Download COde)
cvcv

____________________________________________________________

 

1. public class InterchangePosition {




3. /**


4. * @param args


5. */


6. public static void main(String[] args) {


7. // TODO Auto-generated method stub


8. String []arr = {"5#1","6#1","5#3"};


9. long x1 = System.currentTimeMillis();


10. System.out.println(get_height(arr));


11. long x2 = System.currentTimeMillis();


12. System.out.println("TIme in milli "+(x2-x1));


13. }


14. public static int get_height(String[] input1)


15.     {


16.         //Write code here




18. int count=0;




20. int f[] = new int[input1.length];




22. int value=0;


23. String s[]= new String[2];




25. if(input1.length==0)


26. return 0;




28. for(int i=0;i


29. {




31. if(Integer.parseInt(((s=input1[i].split("#"))[0]))<4 || Integer.parseInt(s[0])>7


32. || Integer.parseInt(s[1])<0 || Integer.parseInt(s[1])>11


33. )


34. {


35. //System.out.println("boom1");


36. return -1;


37. }






40. f[i] = (Integer.parseInt(s[0])) * 12 +  Integer.parseInt(s[1]);






43. }






46. for(int i : f)


47. {


48. System.out.println(""+i);


49. }


50. System.out.println("--------------");






53. for(int i=0;i<f.length;i++)


54. {


55. for(int j=i+1;j<f.length;j++)


56. {






59. if(f[i]>f[j])


60. {


61. //System.out.println("I am in "+f[i]);


62. count++;


63. }


64. }


65. }


66. return count;


67.     }




69. }

____________________________________________________________

Another One
Download Code: Click Here

Mirror: Click Here

___________________________________________________________


public class InterchangePosition {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
String []arr = {"5#5","6#6","5#5","6#6","5#11"};
long x1 = System.currentTimeMillis();
System.out.println(get_height(arr));
long x2 = System.currentTimeMillis();
System.out.println("TIme in milli "+(x2-x1));
}
public static int get_height(String[] input1)
{
//Write code here

int count=0;

int f[] = new int[input1.length];

int value=0;


if(input1.length==0)
return 0;

try
{
for(int i=0;i{

if(Integer.parseInt(input1[i].substring(0, input1[i].indexOf('#')))<4 ||
Integer.parseInt(input1[i].substring(0, input1[i].indexOf('#')))>7)
{
//System.out.println("boom1");
return -1;
}
if(Integer.parseInt(input1[i].substring(input1[i].indexOf('#')+1))<0 ||
Integer.parseInt(input1[i].substring(input1[i].indexOf('#')+1))>11)
{
//System.out.println("boom2");
return -1;
}

value = (Integer.parseInt(input1[i].substring(0, input1[i].indexOf('#')))) * 12 +  Integer.parseInt(input1[i].substring(input1[i].indexOf('#')+1));
f[i] = value;

}
}
catch(NumberFormatException nf)
{
nf.printStackTrace();
return -1;
}


for(int i : f)
{
System.out.println(""+i);
}
System.out.println("--------------");


for(int i=0;i<f.length;i++){
for(int j=i+1;j<f.length;j++){


if(f[i]>f[j])
{
//System.out.println("I am in "+f[i]);
count++;
}
}
}
return count;
}

}

___________________________________________________________

Download Code: Click Here

Mirror: Click Here

The Great Indian Programming League 2013 - March Edition Level:Medium

Here is the Link of question and description of 

Four Persons

I am providing you the solution of the above question. My best score on this is 99.99.

Repost Code with better one.(Download COde)


____________________________________________________________

1. public class InterchangePosition {
2. 
   
3. /**
4. * @param args
5. */
6. public static void main(String[] args) {
7. // TODO Auto-generated method stub
8. String []arr = {"5#1","6#1","5#3"};
9. long x1 = System.currentTimeMillis();
10. System.out.println(get_height(arr));
11. long x2 = System.currentTimeMillis();
12. System.out.println("TIme in milli "+(x2-x1));
13. }
14. public static int get_height(String[] input1)
15.     {
16.         //Write code here
18. int count=0;
20. int f[] = new int[input1.length];
22. int value=0;
23. String s[]= new String[2];
25. if(input1.length==0)
26. return 0;
28. for(int i=0;i
29. {
31. if(Integer.parseInt(((s=input1[i].split("#"))[0]))<4 || Integer.parseInt(s[0])>7
32. || Integer.parseInt(s[1])<0 || Integer.parseInt(s[1])>11
33. )
34. {
35. //System.out.println("boom1");
36. return -1;
37. }
40. f[i] = (Integer.parseInt(s[0])) * 12 +  Integer.parseInt(s[1]);
43. }
46. for(int i : f)
47. {
48. System.out.println(""+i);
49. }
50. System.out.println("--------------");
53. for(int i=0;i<f.length;i++)
54. {
55. for(int j=i+1;j<f.length;j++)
56. {
59. if(f[i]>f[j])
60. {
61. //System.out.println("I am in "+f[i]);
62. count++;
63. }
64. }
65. }
66. return count;
67.     }
68. 
    
69. }

____________________________________________________________

Another One
Download Code: Click Here 

Mirror: Click Here

___________________________________________________________


public class InterchangePosition {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
String []arr = {"5#5","6#6","5#5","6#6","5#11"};
long x1 = System.currentTimeMillis();
System.out.println(get_height(arr));
long x2 = System.currentTimeMillis();
System.out.println("TIme in milli "+(x2-x1));
}
public static int get_height(String[] input1)
    {
        //Write code here

int count=0;

int f[] = new int[input1.length];

int value=0;


if(input1.length==0)
return 0;

try
{
for(int i=0;i {

if(Integer.parseInt(input1[i].substring(0, input1[i].indexOf('#')))<4 ||
  Integer.parseInt(input1[i].substring(0, input1[i].indexOf('#')))>7)
{
//System.out.println("boom1");
return -1;
}
if(Integer.parseInt(input1[i].substring(input1[i].indexOf('#')+1))<0 ||
  Integer.parseInt(input1[i].substring(input1[i].indexOf('#')+1))>11)
{
//System.out.println("boom2");
return -1;
}

value = (Integer.parseInt(input1[i].substring(0, input1[i].indexOf('#')))) * 12 +  Integer.parseInt(input1[i].substring(input1[i].indexOf('#')+1));
f[i] = value;

}
}
catch(NumberFormatException nf)
{
nf.printStackTrace();
return -1;
}


for(int i : f)
{
System.out.println(""+i);
}
System.out.println("--------------");


for(int i=0;i<f.length;i++) {
for(int j=i+1;j<f.length;j++) {


if(f[i]>f[j])
{
//System.out.println("I am in "+f[i]);
count++;
}
}
}
return count;
    }

}

___________________________________________________________

Download Code: Click Here 

Mirror: Click Here

TechGig: The Great Indian Programming League 2013 - Jan Edition

Fashion Contest 2013

Click here for question .

My Score: 99.99 

Test Cases Passed: 8

import java.io.*;

1. public class CandidateCode
2. {
3. public static int fashion(int[] input1)
4. {
5. //Write code here
6. int totalJudges = input1.length;
7. if(totalJudges==0)
8. return 0;
9. else if(totalJudges==1)
10. return input1[0];
11. else
12. {
13. int centerJudge = (totalJudges+1)/2-1;
14. int centerJudgeScore = input1[centerJudge];
15. for(int i=0,j=1;i
16. {
17. if(input1[centerJudge-j]==input1[centerJudge+j])
18. centerJudgeScore+=input1[centerJudge+j];
19. }
20. return centerJudgeScore;
21. }
22. }
23. }

[Click here for source file]

TechGig: The Great Indian Programming League 2013 - Jan Edition

Fashion Contest 2013

Click here for question .

My Score: 99.99 

Test Cases Passed: 8

import java.io.*;

1. public class CandidateCode
2. {
3. public static int fashion(int[] input1)
4. {
5. //Write code here
6. int totalJudges = input1.length;
7. if(totalJudges==0)
8. return 0;
9. else if(totalJudges==1)
10. return input1[0];
11. else
12. {
13. int centerJudge = (totalJudges+1)/2-1;
14. int centerJudgeScore = input1[centerJudge];
15. for(int i=0,j=1;i
16. {
17. if(input1[centerJudge-j]==input1[centerJudge+j])
18. centerJudgeScore+=input1[centerJudge+j];
19. }
20. return centerJudgeScore;
21. }
22. }
23. }

[Click here for source file]

Java Utility Functions - Password Generation and Validation

Function 1: Generate a random password that's 7 characters. The random password MUST have 1 lowercase, 1 uppercase, 1 digit, and 1 symbol (valid symbols are ! @ # $ % *

Method signature should be
public static String generatePassword()

Function 2: Validate a passed in password. This password will be between 7 and 20 characters. It must comply with at least 3 of the following 4 rules: 1) at least 1 capital 2) at least one lowercase 3) at least 1 digit 4) at least 1 symbol (see above for valid symbols). If the password is too long or too short, return false. If it only meets 2 of the rules, return false. If it meets 3 or 4 of the rules, return true.

Method signature should be
public static boolean validatePassword(String password)

1. package password;
2. 
   
3. import java.util.Arrays;
4. import java.util.Collection;
5. import java.util.Collections;
6. import java.util.Random;
7. import java.util.regex.Matcher;
8. import java.util.regex.Pattern;
9. 
   
10. public class RandomPassword
11. {
12. private static String password;
15. // Method for gnerating random password each time
16. public static String generatePassword()
17. {
18. password="";
19. String temp[] = new String[7];
20. char []number = new char[]{'0','1','2','3','4','5','6','7','8','9'};
21. char []lowerCase = new char[]{'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
22. char []upperCase = new char[]{'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
24. char []symbol = new char[]{'!','@','#','$','%','*'};
25. char []allCase = new char[]{'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p',
26. 'q','r','s','t','u','v','w','x','y','z','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U',
27. 'V','W','X','Y','Z','!','@','#','$','%','*'};
28. Random random = new Random();
29. int position = random.nextInt(10);
30. temp[0] = ""+number[position];
32. position = random.nextInt(26);
33. temp[1] = ""+lowerCase[position];
35. position = random.nextInt(26);
36. temp[2] = ""+upperCase[position];
38. position = random.nextInt(6);
39. temp[3] = ""+symbol[position];
41. for(int i=0;i3>
42. {
43. position = random.nextInt(68);
44. temp[4+i] = "" +allCase[position];
45. }
47. // Suffle Your password
48. Collections.shuffle(Arrays.asList(temp));
50. // temp[] to String
51. for(String pass : temp)
52. password=password+pass;
55. return password;
56. }
59. //Method for validate password
61. public static boolean validatePassword(String password)
62. {
63. int flag=0;
64. // Validate Length 
65. if(password.length()20)7>
66. return false;
68. Pattern p = Pattern.compile("[a-z]");
69. Matcher m = p.matcher(password);
70. while(m.find())
71. {
72. flag++;
73. break;
74. }
75. 
    
76. p = Pattern.compile("[A-Z]");
77. m = p.matcher(password);
78. while(m.find())
79. {
80. flag++;
81. break;
82. }
83.  
84. p = Pattern.compile("\\d");
85. m = p.matcher(password);
86. while(m.find())
87. {
88. flag++;
89. break;
90. }
91.  
92. p = Pattern.compile("['!','@','#','$','$',''%','*']");
93. m = p.matcher(password);
94. while(m.find())
95. {
96. flag++;
97. break;
98. }
99.  
100.  
101. if(flag==0 || flag==1 || flag==2)
102. return false;
103.  
104. if(flag==3 || flag==4)
105. return true;
106.  
108. return true;
109. }
110. public static void main(String[] args) {
111. System.out.println("passwors id "+RandomPassword.generatePassword());
112. System.out.println(RandomPassword.validatePassword("aaaAaa)aa"));
113. }
114. }

[Click Here to Download source file]

Or

Clicke here

Java Utility Functions - Password Generation and Validation

Function 1: Generate a random password that's 7 characters. The random password MUST have 1 lowercase, 1 uppercase, 1 digit, and 1 symbol (valid symbols are ! @ # $ % *

Method signature should be
public static String generatePassword()

Function 2: Validate a passed in password. This password will be between 7 and 20 characters. It must comply with at least 3 of the following 4 rules: 1) at least 1 capital 2) at least one lowercase 3) at least 1 digit 4) at least 1 symbol (see above for valid symbols). If the password is too long or too short, return false. If it only meets 2 of the rules, return false. If it meets 3 or 4 of the rules, return true.

Method signature should be
public static boolean validatePassword(String password)

1. package password;
2. 
   
3. import java.util.Arrays;
4. import java.util.Collection;
5. import java.util.Collections;
6. import java.util.Random;
7. import java.util.regex.Matcher;
8. import java.util.regex.Pattern;
9. 
   
10. public class RandomPassword
11. {
12. private static String password;
15. // Method for gnerating random password each time
16. public static String generatePassword()
17. {
18. password="";
19. String temp[] = new String[7];
20. char []number = new char[]{'0','1','2','3','4','5','6','7','8','9'};
21. char []lowerCase = new char[]{'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
22. char []upperCase = new char[]{'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
24. char []symbol = new char[]{'!','@','#','$','%','*'};
25. char []allCase = new char[]{'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p',
26. 'q','r','s','t','u','v','w','x','y','z','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U',
27. 'V','W','X','Y','Z','!','@','#','$','%','*'};
28. Random random = new Random();
29. int position = random.nextInt(10);
30. temp[0] = ""+number[position];
32. position = random.nextInt(26);
33. temp[1] = ""+lowerCase[position];
35. position = random.nextInt(26);
36. temp[2] = ""+upperCase[position];
38. position = random.nextInt(6);
39. temp[3] = ""+symbol[position];
41. for(int i=0;i<3 i="" span="">
42. {
43. position = random.nextInt(68);
44. temp[4+i] = "" +allCase[position];
45. }
47. // Suffle Your password
48. Collections.shuffle(Arrays.asList(temp));
50. // temp[] to String
51. for(String pass : temp)
52. password=password+pass;
55. return password;
56. }
59. //Method for validate password
61. public static boolean validatePassword(String password)
62. {
63. int flag=0;
64. // Validate Length 
65. if(password.length()<7 password.length="">20)
66. return false;
68. Pattern p = Pattern.compile("[a-z]");
69. Matcher m = p.matcher(password);
70. while(m.find())
71. {
72. flag++;
73. break;
74. }
75. 
    
76. p = Pattern.compile("[A-Z]");
77. m = p.matcher(password);
78. while(m.find())
79. {
80. flag++;
81. break;
82. }
83.  
84. p = Pattern.compile("\\d");
85. m = p.matcher(password);
86. while(m.find())
87. {
88. flag++;
89. break;
90. }
91.  
92. p = Pattern.compile("['!','@','#','$','$',''%','*']");
93. m = p.matcher(password);
94. while(m.find())
95. {
96. flag++;
97. break;
98. }
99.  
100.  
101. if(flag==0 || flag==1 || flag==2)
102. return false;
103.  
104. if(flag==3 || flag==4)
105. return true;
106.  
108. return true;
109. }
110. public static void main(String[] args) {
111. System.out.println("passwors id "+RandomPassword.generatePassword());
112. System.out.println(RandomPassword.validatePassword("aaaAaa)aa"));
113. }
114. }

[Click Here to Download source file]

Or

Clicke here