I can do the codingbat part myself but i only have a problem with the getfirsthalf and getsecondhalf where it tells you what to do...
You must create three helper methods to complete this exercise. Copy the class below in to IntelliJ and develop the helper methods according to their comments. Paste only the methods in to codingbat when you're ready to test it there and remove the static keywords when you do. Copy your helper methods in to shell if you want to test them individually. public class Cantalance 7 solves p158767 on codingut Problen description: Given ty array, return true if there is a place to split the arrey so that the of the numeronne side is equal to the sum of the numbers on the other side public static boolean canalicent) / Checkery possible position they can be for(int 1-0 te length 1 ) // ti the sum of the left haliqua te them of the right, . Afsunterwyfeetfirstufis, 13) -- traceutSecondaria 13) return true I were never able to find position where the left and right die es were al 1 /** slice the array in the posts the first die the value at position includes the stic Ny to be War position in which to see the return the the skiedy public station , a return will completed slice the array in to the si *. sture there all of the chiced are pustaklom) turn 1000 this y values to be retures of all of the e ati mail return this with Note that this is not the most efficient solution to the problem either in terms of code length or algorithmic complety. However, it contains useful abstractions that we could copy and paste into new problems and help us organize our approach nicely. This is to say there isn't a good reason to make it shorter and more efficient, but if you expect the code to need to change and be maintained in the future, this may be a better approach First implement sumArray and discuss strategy for implementing First Half and check in with the instructor. Then finish petSecondHal to complete your solution Challenge: Update your solution to use ArrayLists instead otras You must create three helper methods to complete this exercise. Copy the class below in to IntelliJ and develop the helper methods according to their comments. Paste only the methods in to codingbat when you're ready to test it there and remove the static keywords when you do. Copy your helper methods in to shell if you want to test them individually. public class Cantalance 7 solves p158767 on codingut Problen description: Given ty array, return true if there is a place to split the arrey so that the of the numeronne side is equal to the sum of the numbers on the other side public static boolean canalicent) / Checkery possible position they can be for(int 1-0 te length 1 ) // ti the sum of the left haliqua te them of the right, . Afsunterwyfeetfirstufis, 13) -- traceutSecondaria 13) return true I were never able to find position where the left and right die es were al 1 /** slice the array in the posts the first die the value at position includes the stic Ny to be War position in which to see the return the the skiedy public station , a return will completed slice the array in to the si *. sture there all of the chiced are pustaklom) turn 1000 this y values to be retures of all of the e ati mail return this with Note that this is not the most efficient solution to the problem either in terms of code length or algorithmic complety. However, it contains useful abstractions that we could copy and paste into new problems and help us organize our approach nicely. This is to say there isn't a good reason to make it shorter and more efficient, but if you expect the code to need to change and be maintained in the future, this may be a better approach First implement sumArray and discuss strategy for implementing First Half and check in with the instructor. Then finish petSecondHal to complete your solution Challenge: Update your solution to use ArrayLists instead otras
