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

TechGig: The Great Indian Programming League 2013 - March Edition - Level 1

Hi,
I am providing the solution of  The Great Indian Programming League 2013 - March Edition - Level 1.  You can find the question here . My best score in this level is 90.

1. public class CandidateCode {
2. public static int slope_sum(int input1,int input2)
3. {
4. //Write code here
5. int sum=0;
6. long cal=0;
7. if(input1>=0 && input2<=100)
8. return 0;
9. else if(input1>input2 || input12147483647)0>
10. {
11. return -1;
12. }
13. 
    
14. else
15. {
16. for(int i=input1;i<=input2;i++)
17. {
18. if(i>100)
19. {
20. //System.out.println("hiii"+getValue(i));
21. sum = sum + getValue(i);
22. System.out.println(sum);
23. cal++;
24. }
25. }
26. }
27. return sum;
28. }
29. 
    
30. public static int getValue(int value)
31. {
32. int maxima=0;
33. int lastDigit;
34. int firstDigit;
35. int middleDigit;
36. int rem,flag=0;
37. 
    
38. while(value!=0)
39. {
40. int temp=-1; 
41. rem = value%1000;
42. temp=value/1000;
43. if(temp==0)
44. {
45. 
    
46. //System.out.println("rem");
47. rem=value;
48. 
    
49. }
50. lastDigit = rem%10;
51. firstDigit = rem/100;
52. middleDigit = (rem%100)/10;
53. 
    
54. //System.out.println("Rem = "+rem+" last Digit "+lastDigit+" firstDigit "+firstDigit+" middle = "+middleDigit);
55. // System.out.println("Rem = "+rem+" last Digit "+lastDigit+" firstDigit "+firstDigit+" middle = "+middleDigit+" maxima= "+maxima);
56. if(middleDigit>firstDigit && middleDigit>lastDigit)
57. {
58. maxima++;
59. }
60. if (middleDigit
61. maxima++;
62. }
63. if(temp==0)
64. {
65. //System.out.println("Here 3 digit code");
66. flag=maxima;
67. maxima=0;
68. 
    
69. value=0;
70. }
71. else
72. {
73. value = value/10;
74. }
75. }
76. return flag;
77. }
78. }

TechGig: The Great Indian Programming League 2013 - March Edition - Level 1

Hi,
I am providing the solution of  The Great Indian Programming League 2013 - March Edition - Level 1.  You can find the question here . My best score in this level is 90.

1. public class CandidateCode {
2. public static int slope_sum(int input1,int input2)
3. {
4. //Write code here
5. int sum=0;
6. long cal=0;
7. if(input1>=0 && input2<=100)
8. return 0;
9. else if(input1>input2 || input1<0 input2="">2147483647)
10. {
11. return -1;
12. }
13. 
    
14. else
15. {
16. for(int i=input1;i<=input2;i++)
17. {
18. if(i>100)
19. {
20. //System.out.println("hiii"+getValue(i));
21. sum = sum + getValue(i);
22. System.out.println(sum);
23. cal++;
24. }
25. }
26. }
27. return sum;
28. }
29. 
    
30. public static int getValue(int value)
31. {
32. int maxima=0;
33. int lastDigit;
34. int firstDigit;
35. int middleDigit;
36. int rem,flag=0;
37. 
    
38. while(value!=0)
39. {
40. int temp=-1; 
41. rem = value%1000;
42. temp=value/1000;
43. if(temp==0)
44. {
45. 
    
46. //System.out.println("rem");
47. rem=value;
48. 
    
49. }
50. lastDigit = rem%10;
51. firstDigit = rem/100;
52. middleDigit = (rem%100)/10;
53. 
    
54. //System.out.println("Rem = "+rem+" last Digit "+lastDigit+" firstDigit "+firstDigit+" middle = "+middleDigit);
55. // System.out.println("Rem = "+rem+" last Digit "+lastDigit+" firstDigit "+firstDigit+" middle = "+middleDigit+" maxima= "+maxima);
56. if(middleDigit>firstDigit && middleDigit>lastDigit)
57. {
58. maxima++;
59. }
60. if (middleDigit
61. maxima++;
62. }
63. if(temp==0)
64. {
65. //System.out.println("Here 3 digit code");
66. flag=maxima;
67. maxima=0;
68. 
    
69. value=0;
70. }
71. else
72. {
73. value = value/10;
74. }
75. }
76. return flag;
77. }
78. }

Calculate time to complete a method or a block of code in Java.

There is no direct way to calculate the time of a mehtod which is in execution. But there is a method to calculate current time by which we can approx calculate the total  time.

Class : System
Method : currentTimeMillis

Use:

1. public static void main(String[] args) {
2. long startTime = System.currentTimeMillis();
3. System.out.println(method(some_value));
4. long endTime = System.currentTimeMillis();
5. long totalTime = endTime - startTime;
6. System.out.println("total time in milli seconds "(totalTime);
7. }

Calculate time to complete a method or a block of code in Java.

There is no direct way to calculate the time of a mehtod which is in execution. But there is a method to calculate current time by which we can approx calculate the total  time.

Class : System
Method : currentTimeMillis

Use:

1. public static void main(String[] args) {
2. long startTime = System.currentTimeMillis();
3. System.out.println(method(some_value));
4. long endTime = System.currentTimeMillis();
5. long totalTime = endTime - startTime;
6. System.out.println("total time in milli seconds "(totalTime);
7. }