From 8e4aef050755cad6601330eb067a3bd6c0647ef4 Mon Sep 17 00:00:00 2001 From: CJ Fulton Date: Tue, 9 Jun 2020 23:45:21 -0400 Subject: [PATCH 1/9] Completed week 2 prompts in java --- week-2/Java/Christopher-Fulton.java | 66 +++++++++++++++++++++++++++++ week-2/Java/main.java | 0 2 files changed, 66 insertions(+) create mode 100644 week-2/Java/Christopher-Fulton.java delete mode 100644 week-2/Java/main.java diff --git a/week-2/Java/Christopher-Fulton.java b/week-2/Java/Christopher-Fulton.java new file mode 100644 index 0000000..f79a10b --- /dev/null +++ b/week-2/Java/Christopher-Fulton.java @@ -0,0 +1,66 @@ + + +import java.util.Scanner; + + + +class Week2{ + + static void permutation(String perm,String str) { + if (str.length() == 0) { // if str is empty perm must be full permuation + System.out.println(perm + " "); + return; + } + for (int i = 0; i < str.length(); i++) { + permutation(perm+str.charAt(i), str.substring(0, i)+str.substring(i+1, str.length()));// Loop through string recursively each time add current index to substring of rest of word. + } + + } + + + + public static String maxPalindrone(String str) { + str = str.replaceAll("\\s",""); // replace all spaces and turn upper to lower case for simplicity + str = str.toLowerCase(); + StringBuilder tempStr = new StringBuilder(); + StringBuilder tempBuilder = new StringBuilder(); + String maxSubstring =""; + for(int i = 0;i maxSubstring.length()){ + maxSubstring = tempStr.toString();// Check wheter or not substring is a palindrone and ifso if it's largest. + } + tempStr.setLength(0);// Reset string objects + tempBuilder.setLength(0); + } + } + +return maxSubstring; + } + public static void main(String[] args) { + //////////////////////Interface///////////////////////////////////////////////////// + Scanner in = new Scanner(System.in); + + System.out.println("To check for Palindron enter: 1"); + System.out.println("To print all permutations 2"); + String choice = in.nextLine(); + if (choice.equals("1")) { + System.out.println("Enter string"); + String str = in.nextLine(); + System.out.println( "Largest palidrone: "); + System.out.println(maxPalindrone(str)); + } else if (choice.equals("2")) { + System.out.println("Enter String "); + String str = in.nextLine(); + System.out.println("All permutations of " + str + ":" ); + permutation("",str); + + } + else { + System.out.println("Incorrect choice"); + } + in.close(); + } +} \ No newline at end of file diff --git a/week-2/Java/main.java b/week-2/Java/main.java deleted file mode 100644 index e69de29..0000000 From 7e16f80e77e83687a4e057e94d4377372f05007c Mon Sep 17 00:00:00 2001 From: CJ Fulton Date: Wed, 24 Jun 2020 01:52:13 -0400 Subject: [PATCH 2/9] Week 4: Prompt 1 completed, prompt 2 in progress. --- week-2/Java/Christopher-Fulton.java | 108 ++++++++++++++++++---------- week-2/Java/Week2.class | Bin 0 -> 1555 bytes week-4/Java/Week4.class | Bin 0 -> 2175 bytes week-4/Java/Week4.java | 69 ++++++++++++++++++ week-4/Java/main.java | 0 5 files changed, 138 insertions(+), 39 deletions(-) create mode 100644 week-2/Java/Week2.class create mode 100644 week-4/Java/Week4.class create mode 100644 week-4/Java/Week4.java delete mode 100644 week-4/Java/main.java diff --git a/week-2/Java/Christopher-Fulton.java b/week-2/Java/Christopher-Fulton.java index f79a10b..684798f 100644 --- a/week-2/Java/Christopher-Fulton.java +++ b/week-2/Java/Christopher-Fulton.java @@ -19,48 +19,78 @@ static void permutation(String perm,String str) { - public static String maxPalindrone(String str) { - str = str.replaceAll("\\s",""); // replace all spaces and turn upper to lower case for simplicity - str = str.toLowerCase(); - StringBuilder tempStr = new StringBuilder(); - StringBuilder tempBuilder = new StringBuilder(); - String maxSubstring =""; - for(int i = 0;i maxSubstring.length()){ - maxSubstring = tempStr.toString();// Check wheter or not substring is a palindrone and ifso if it's largest. - } - tempStr.setLength(0);// Reset string objects - tempBuilder.setLength(0); - } - } - -return maxSubstring; - } +// public static String maxPalindrone(String str) { +// str = str.replaceAll("\\s",""); // replace all spaces and turn upper to lower case for simplicity +// str = str.toLowerCase(); +// StringBuilder tempStr = new StringBuilder(); +// StringBuilder tempBuilder = new StringBuilder(); +// String maxSubstring =""; +// for(int i = 0;i maxSubstring.length()){ +// maxSubstring = tempStr.toString();// Check wheter or not substring is a palindrone and ifso if it's largest. +// } +// tempStr.setLength(0);// Reset string objects +// tempBuilder.setLength(0); +// } +// } + +// return maxSubstring; +// } public static void main(String[] args) { //////////////////////Interface///////////////////////////////////////////////////// Scanner in = new Scanner(System.in); - System.out.println("To check for Palindron enter: 1"); - System.out.println("To print all permutations 2"); - String choice = in.nextLine(); - if (choice.equals("1")) { - System.out.println("Enter string"); - String str = in.nextLine(); - System.out.println( "Largest palidrone: "); - System.out.println(maxPalindrone(str)); - } else if (choice.equals("2")) { - System.out.println("Enter String "); - String str = in.nextLine(); - System.out.println("All permutations of " + str + ":" ); - permutation("",str); + String a = "a"; + String b = "b"; + System.out.println(b.compareTo(a)); + + + + + + + + + + + + + + + + + + + + + // String str = "ABC"; + // for (int i = str.length()-1;i>0;i--){ + // for (int j = i -1; jOH&(15dKCITCuEo$c7Lbh!X=A2$1b0egy2;D8?uj4_g@GIH_bLrqH6*&era% ztGN5(e~`*C7oYJ#c9AOofZXzTQm!~XE2R*{CaT)qR!?_--CuXlAAcXc18@UBnmCJ3 zOkBjLz4#25vZTFiB8M5Ro6Uk@PD}GzS}>7C!N3)5deuZ9u4V9f24854FSXZo12+uZ zWJoXBuC4AcBy%&{45^~r6$}Gq+ZF3!vnu>8UUf**=Lx?VDz0qlGF;A;_xW>PaJaiy zs3_ld_ZClUbigwe#cPcP`*!U`T_ zu&R|M3*X|QmdX}J@iD_tR92{Lr%2nHLPpE4F<;Psan{?BOU88L(h&7jcWvb zOvgrbU)0nIRhuCq+Y#=bsz+p(PFfrUN;K&}hU7Zj=EjzVO`=wjyWq`56BTSRB-lk_ zrpX(kDBT)YJGQEm6e#YhfMGhOH8ZEVW;h$Ad=i7f@HC=BEgFssL>*1n>fFCaS*CKO znWD~z#ScU=7PdDCtJEW!7(E50QmoO<80^zE#JVQ*cpVd1a=q|h0vSd-ajEL=13jp{ zHQDsIFSg`=luixP6>l4Oq9^7l!{l+(ZTGosh|Vgs`?A7oO8N%|o)KqdDI1~3V3qVt z6&)S~f|~V9cb%OW?b%)B?ye(($+lz6a&^&h!g1@s6EWu9>(-vo#cujKA&T5_Dz*}| zR6j6GovJS`H-?G-x1&2JOP81aCF!Bnr7LQLq;dK(`u5De0Xrmt=9=E=NNFIWSCV9H z`Vu{nb1C0K;#Um5MsoHDDWHX(!{qHTt^N)3v-z^L^hrGrv9m{wDwv zc<4g_@fN&_*L-*#7d4Fepdc=XOL7?3FyVt2mwo8Nq_n1_J0XYZR*c|^9A>Udqd7{ zhD}*UdUx5_x6^A#YIswiC6(RI8&*( zF>NkpWqEz;rnx&7lcm$qj{yx!I+n4bVO7U1+!p9@Dyxn=Na?tXw*)%v4b8&qSd*(~ z@RE*oyshIN?(5jV10C<+T^;XXQ$P$0bQ~Y8VI=b8@KWKx9KKFmrQyXwv1aKoWXLU~ zWyp+<3kXVpq@daqP6S)sdSs^AlrGt+UB?8HmRU5cLQ$aGL7x*LQXiBobC1`fP-Y;1 zP0ef}ev4JH2-Yhnyh#Aq# zlWRt<%uGUy{pNB zuPB-nFC}%DZfH{zWoC$yB*H^fq^sjgj8cDv!Virrer4bZ0+Fy^Q8sP8I&C==aajFx zX!^06viuS`rWZpiQ=Da@5wsCT0O$F20b#tTYA>+qKvG)BGkx{P*s8dk%IbTk$tTBCYu-Kd{m>FSzN z+_E(S_;<<@Jwk5vI8@i-YzAcD)Z zCNYaC+`tvSeKUN2XZbG9VW0B>=J65rkVPGYtIB7RMU6Cy%IbF7Wj#acQ9E1gUyJ7H AhX4Qo literal 0 HcmV?d00001 diff --git a/week-4/Java/Week4.java b/week-4/Java/Week4.java new file mode 100644 index 0000000..bd41dfe --- /dev/null +++ b/week-4/Java/Week4.java @@ -0,0 +1,69 @@ + +import java.util.*; +public class Week4{ + +public static int[] addElements(int num1, int num2, int carry ){ + int[] sum = new int[2]; + sum[0] = (num1+num2+carry)%10; + sum[1] = (num1+num2+carry)/10; + System.out.println((num1+num2+carry)/10); + return sum; +} + +public static LinkedList sumLinkedList(LinkedList list1, LinkedList list2) { + LinkedList newLinkedList = new LinkedList(); + int[] tempList1 = new int[2]; + int carry = 0; + + for (int i = list1.size()-1; i > -1; i--){ + tempList1 = addElements(list1.get(i), list2.get(i),carry); + carry = tempList1[1]; + newLinkedList.add(tempList1[0]); + } + newLinkedList.add(tempList1[1]); + Iterator reverseLinkIterator = newLinkedList.descendingIterator(); + LinkedList finalLinkedList = new LinkedList(); + while (reverseLinkIterator.hasNext()){ + finalLinkedList.add(reverseLinkIterator.next()); + } + + return finalLinkedList; + +} + +public static LinkedList rLinkedList(LinkedList sLinkedList){ + int tempIndex = 0; + LinkedList finalLinkedList = new LinkedList(); + for (int i = sLinkedList.size()-1; i > -1; i--){ + System.out.println(sLinkedList.get(i)); + if (sLinkedList.get(i).equals(" ")){ + // System.out.println(sLinkedList); + for (int j = 0; j L1 = new LinkedList(); + LinkedList L2 = new LinkedList(); + L1.add(5); + L1.add(6); + L1.add(3); + L2.add(8); + L2.add(4); + L2.add(2); + // System.out.println(sumLinkedList(L1, L2)); + + LinkedList sLinkedList = new LinkedList(); + String testString = "I Love Geeks For Geeks"; + for (int i =0; i Date: Wed, 24 Jun 2020 16:54:52 -0400 Subject: [PATCH 3/9] Completed week 4 exercies --- week-4/Java/Week4.java | 38 +++++++++++++++++++++++--------------- 1 file changed, 23 insertions(+), 15 deletions(-) diff --git a/week-4/Java/Week4.java b/week-4/Java/Week4.java index bd41dfe..6c9e0ff 100644 --- a/week-4/Java/Week4.java +++ b/week-4/Java/Week4.java @@ -2,11 +2,10 @@ import java.util.*; public class Week4{ -public static int[] addElements(int num1, int num2, int carry ){ +public static int[] addElements(int num1, int num2, int carry ){ //Helper funtion to deal with carry digits int[] sum = new int[2]; sum[0] = (num1+num2+carry)%10; sum[1] = (num1+num2+carry)/10; - System.out.println((num1+num2+carry)/10); return sum; } @@ -16,11 +15,11 @@ public static LinkedList sumLinkedList(LinkedList list1, Linke int carry = 0; for (int i = list1.size()-1; i > -1; i--){ - tempList1 = addElements(list1.get(i), list2.get(i),carry); + tempList1 = addElements(list1.get(i), list2.get(i),carry); // Holds values of array for funtion. carry = tempList1[1]; newLinkedList.add(tempList1[0]); } - newLinkedList.add(tempList1[1]); + newLinkedList.add(tempList1[1]);// BHolds Iterator reverseLinkIterator = newLinkedList.descendingIterator(); LinkedList finalLinkedList = new LinkedList(); while (reverseLinkIterator.hasNext()){ @@ -32,18 +31,27 @@ public static LinkedList sumLinkedList(LinkedList list1, Linke } public static LinkedList rLinkedList(LinkedList sLinkedList){ - int tempIndex = 0; + String[] tempArray = new String[sLinkedList.size()]; + for (int i = 0; i finalLinkedList = new LinkedList(); - for (int i = sLinkedList.size()-1; i > -1; i--){ - System.out.println(sLinkedList.get(i)); - if (sLinkedList.get(i).equals(" ")){ - // System.out.println(sLinkedList); - for (int j = 0; j -1; i--){ + if (i ==0){ + for (int k = i; k<=tempIndex-1;k++) + finalLinkedList.add(tempArray[k]); } + if (tempArray[i].equals(" ") ){ + for (int j = i+1; j<=tempIndex-1;j++){ + finalLinkedList.add(tempArray[j]); + } + finalLinkedList.add(" "); //Adding the space after letter. + tempIndex = i; + } } + return finalLinkedList; } @@ -57,13 +65,13 @@ public static void main(String[] args) { L2.add(8); L2.add(4); L2.add(2); - // System.out.println(sumLinkedList(L1, L2)); + System.out.println(sumLinkedList(L1, L2)); //Only works for linked list of equal size LinkedList sLinkedList = new LinkedList(); String testString = "I Love Geeks For Geeks"; for (int i =0; i Date: Thu, 16 Jul 2020 22:37:09 -0400 Subject: [PATCH 4/9] Added week 6 solution --- week-4/Java/Week4.java | 24 ++++++++-------- week-6/Java/ChristopherFulton.java | 46 ++++++++++++++++++++++++++++++ week-6/Java/main.java | 0 3 files changed, 58 insertions(+), 12 deletions(-) create mode 100644 week-6/Java/ChristopherFulton.java delete mode 100644 week-6/Java/main.java diff --git a/week-4/Java/Week4.java b/week-4/Java/Week4.java index 6c9e0ff..80374b1 100644 --- a/week-4/Java/Week4.java +++ b/week-4/Java/Week4.java @@ -59,19 +59,19 @@ public static LinkedList rLinkedList(LinkedList sLinkedList){ public static void main(String[] args) { LinkedList L1 = new LinkedList(); LinkedList L2 = new LinkedList(); - L1.add(5); - L1.add(6); - L1.add(3); - L2.add(8); - L2.add(4); - L2.add(2); - System.out.println(sumLinkedList(L1, L2)); //Only works for linked list of equal size + L1.add(7); + // L1.add(6); + // L1.add(3); + L2.add(7); + // L2.add(4); + // L2.add(2); + System.out.println(sumLinkedList(L1, L2)); //Only works for linked list of equal size - LinkedList sLinkedList = new LinkedList(); - String testString = "I Love Geeks For Geeks"; - for (int i =0; i sLinkedList = new LinkedList(); + // String testString = "I Love Geeks For Geeks"; + // for (int i =0; i Date: Thu, 16 Jul 2020 22:41:00 -0400 Subject: [PATCH 5/9] commented code --- week-4/Java/Week4.java | 18 +++++++++--------- 1 file changed, 9 insertions(+), 9 deletions(-) diff --git a/week-4/Java/Week4.java b/week-4/Java/Week4.java index 80374b1..029342b 100644 --- a/week-4/Java/Week4.java +++ b/week-4/Java/Week4.java @@ -60,18 +60,18 @@ public static void main(String[] args) { LinkedList L1 = new LinkedList(); LinkedList L2 = new LinkedList(); L1.add(7); - // L1.add(6); - // L1.add(3); + L1.add(6); + L1.add(3); L2.add(7); - // L2.add(4); - // L2.add(2); + L2.add(4); + L2.add(2); System.out.println(sumLinkedList(L1, L2)); //Only works for linked list of equal size - // LinkedList sLinkedList = new LinkedList(); - // String testString = "I Love Geeks For Geeks"; - // for (int i =0; i sLinkedList = new LinkedList(); + String testString = "I Love Geeks For Geeks"; + for (int i =0; i Date: Wed, 22 Jul 2020 11:38:35 -0400 Subject: [PATCH 6/9] Completed week 8 easy prompt --- week-8/Fulton-Christopher.java | 53 ++++++++++++++++++++++++++++++++++ 1 file changed, 53 insertions(+) create mode 100644 week-8/Fulton-Christopher.java diff --git a/week-8/Fulton-Christopher.java b/week-8/Fulton-Christopher.java new file mode 100644 index 0000000..3d5da78 --- /dev/null +++ b/week-8/Fulton-Christopher.java @@ -0,0 +1,53 @@ +/* IMPORTANT: Multiple classes and nested static classes are supported */ + +/* + * uncomment this if you want to read input. +//imports for BufferedReader +import java.io.BufferedReader; +import java.io.InputStreamReader; + +//import for Scanner and other utility classes + +*/ +import java.util.*; +import java.lang.Integer; + +// Warning: Printing unwanted or ill-formatted data to output will cause the test cases to fail + +class TestClass { + public static void main(String args[] ) throws Exception { + /* Sample code to perform I/O: + * Use either of these methods for input + + //BufferedReader + BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); + String name = br.readLine(); // Reading input from STDIN + System.out.println("Hi, " + name + "."); // Writing output to STDOUT + + //Scanner + Scanner s = new Scanner(System.in); + String name = s.nextLine(); // Reading input from STDIN + System.out.println("Hi, " + name + "."); // Writing output to STDOUT + + */ + + // Write your code here + Scanner s = new Scanner(System.in); + String[] line1 = s.nextLine().split(" "); + String[] line2 = s.nextLine().split(" "); + String[] line3 = s.nextLine().split(" "); + int total = 0; + for(int i = 0; i < line3.length; i++){ + for(int j = 0; j < line2.length;j++){ + total+= Integer.parseInt(line2[j]); + if(total >= Integer.parseInt(line3[i])){ + System.out.println(j+1); + total = 0; + break; + } + } + } + + + } +} From 97cddb02fd6d67ff8bdb2113bab3c5c354b77959 Mon Sep 17 00:00:00 2001 From: CJ Fulton Date: Wed, 22 Jul 2020 14:51:39 -0400 Subject: [PATCH 7/9] added binary search to week 8 prompt --- week-8/Fulton-Christopher.java | 44 +++++++++++++++++++++++++--------- 1 file changed, 33 insertions(+), 11 deletions(-) diff --git a/week-8/Fulton-Christopher.java b/week-8/Fulton-Christopher.java index 3d5da78..a9a8b95 100644 --- a/week-8/Fulton-Christopher.java +++ b/week-8/Fulton-Christopher.java @@ -10,7 +10,7 @@ */ import java.util.*; -import java.lang.Integer; +import java.lang.*; // Warning: Printing unwanted or ill-formatted data to output will cause the test cases to fail @@ -36,18 +36,40 @@ public static void main(String args[] ) throws Exception { String[] line1 = s.nextLine().split(" "); String[] line2 = s.nextLine().split(" "); String[] line3 = s.nextLine().split(" "); + int[] totals = new int[Integer.parseInt(line1[0])]; int total = 0; - for(int i = 0; i < line3.length; i++){ - for(int j = 0; j < line2.length;j++){ - total+= Integer.parseInt(line2[j]); - if(total >= Integer.parseInt(line3[i])){ - System.out.println(j+1); - total = 0; - break; - } - } - } + for(int i = 0; i < totals.length; i++){ + total+= Integer.parseInt(line2[i]); + totals[i] = total; + } + + for(int i = 0; i = value) + return 1; + int start = 0; + int end = totals.length-1; + while(start <= end){ + int middle = (start + end) / 2; + + if(totals[middle] < value){ + start = middle + 1; + if(totals[start] >= value) + return start + 1; + } + + else if(totals[middle] > value) + end = middle - 1; + } + + return 0; } } From 34d47c051bb570c4470d5015f206f33dade9151e Mon Sep 17 00:00:00 2001 From: CJ Fulton Date: Wed, 22 Jul 2020 19:45:29 -0400 Subject: [PATCH 8/9] Improved solution --- week-8/Fulton-Christopher.java | 73 +++++++++++----------------------- 1 file changed, 23 insertions(+), 50 deletions(-) diff --git a/week-8/Fulton-Christopher.java b/week-8/Fulton-Christopher.java index a9a8b95..0207400 100644 --- a/week-8/Fulton-Christopher.java +++ b/week-8/Fulton-Christopher.java @@ -1,4 +1,4 @@ -/* IMPORTANT: Multiple classes and nested static classes are supported */ +package com.company;/* IMPORTANT: Multiple classes and nested static classes are supported */ /* * uncomment this if you want to read input. @@ -9,67 +9,40 @@ //import for Scanner and other utility classes */ -import java.util.*; -import java.lang.*; // Warning: Printing unwanted or ill-formatted data to output will cause the test cases to fail +class Main { -class TestClass { - public static void main(String args[] ) throws Exception { - /* Sample code to perform I/O: - * Use either of these methods for input - - //BufferedReader - BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); - String name = br.readLine(); // Reading input from STDIN - System.out.println("Hi, " + name + "."); // Writing output to STDOUT - - //Scanner - Scanner s = new Scanner(System.in); - String name = s.nextLine(); // Reading input from STDIN - System.out.println("Hi, " + name + "."); // Writing output to STDOUT - - */ - - // Write your code here - Scanner s = new Scanner(System.in); - String[] line1 = s.nextLine().split(" "); - String[] line2 = s.nextLine().split(" "); - String[] line3 = s.nextLine().split(" "); - int[] totals = new int[Integer.parseInt(line1[0])]; - int total = 0; - for(int i = 0; i < totals.length; i++){ - total+= Integer.parseInt(line2[i]); - totals[i] = total; - } - - for(int i = 0; i = value) return 1; int start = 0; int end = totals.length-1; while(start <= end){ - int middle = (start + end) / 2; - - if(totals[middle] < value){ - start = middle + 1; - if(totals[start] >= value) + int middle = start + (end - start)/ 2; + if(totals[start] >= value) return start + 1; - } + if(totals[middle] < value) + start = middle + 1; else if(totals[middle] > value) end = middle - 1; } - - return 0; + + return end; } -} + public static void main(String[] args) { + int[] N = {1,2,3,4,5}; + int[] totals = new int[5]; + int[] queries = {3,8,10,14}; + int total = 0; + for(int i = 0; i < totals.length; i++){ + total+= N[i]; + totals[i] = total; + } + for (int query : queries) System.out.println(binarySearch(totals, query)); + + } + + +} \ No newline at end of file From a72bb526c6afb5f21b2b0b2c6bef28460237555a Mon Sep 17 00:00:00 2001 From: CJ Fulton Date: Sun, 26 Jul 2020 20:57:00 -0400 Subject: [PATCH 9/9] Completed second prompt --- week-8/Fulton-Christopher.java | 23 +++++++++++++++++++++-- 1 file changed, 21 insertions(+), 2 deletions(-) diff --git a/week-8/Fulton-Christopher.java b/week-8/Fulton-Christopher.java index 0207400..4edeea6 100644 --- a/week-8/Fulton-Christopher.java +++ b/week-8/Fulton-Christopher.java @@ -1,4 +1,4 @@ -package com.company;/* IMPORTANT: Multiple classes and nested static classes are supported */ +/* IMPORTANT: Multiple classes and nested static classes are supported */ /* * uncomment this if you want to read input. @@ -13,6 +13,24 @@ // Warning: Printing unwanted or ill-formatted data to output will cause the test cases to fail class Main { + + static int lowestIntLinearSearch(int[] values, int k){ + Map elements = new HashMap(); + int minInt = Integer.MAX_VALUE; + for(int value: values){ + if(!elements.containsKey(value)) + elements.put(value,1); + else { + elements.put(value, elements.get(value) + 1); + if(value < minInt && elements.get(value) == k ) + minInt = value; + } + + + } + return minInt; + } + static int binarySearch(int[] totals, int value){ if(totals[0] >= value) return 1; @@ -41,7 +59,8 @@ public static void main(String[] args) { totals[i] = total; } for (int query : queries) System.out.println(binarySearch(totals, query)); - + int[] N2 = {2,2,1,3,1}; + System.out.println(lowestIntLinearSearch(N2, 2)); }