Using loops to solve the triangle problem

I think you may be over thinking this problem. The big problem with your code though that at line 37, if that evaluates to true then canExist is set to 'true'. Now the loop resets. If the next value is 0 then line 23 will break the loop and the display will be that the triangle is possible because canExist is true. You can test this yourself with the inputs: 1 0 2 You need to make sure to set canExist to false if a[i] = 0 before you break. Also you should move that line to the first in the loop because if a[i] is 0 then you want to break immediately as you know the triangle can't exist, and not do more work, like create an int[] b and a int sumSide. The next problem is that you are not adding together the sides inside the inner loop that you made the int[] b for when the values are equal inside a[i]. For an equilateral triangle, one where all the sides are equal, your code would say that it wasn't possible. I think a better way to do this is to add up all the sides prior to the outer loop, store the value in an int, then set sideSum equal to that int minus a[i]. This would replace that entire j loop, shorten your code, be more efficient, and be easier to understand. Your next problem is that line 33 should be checking if a[i] is greater than or equal to because a triangle can exist only if sum of two sides is greater than the third, meaning the third cannot be greater that or equal to. This is a bug that can display incorrect results. You should also consider setting the initial value of canExist to true, and only setting it false if the loop breaks early. You can get rid of lines 37-39 using this method. Anyways, i really like the idea you have here. It's a very creative solve, but it needs to be cleaned up a little.