CareerCup

public static boolean isSumEquals8(int[] arr) {
		boolean result = false;
		for (int i = 0; i < arr.length; i++) {
			for (int j = i + 1; j < arr.length; j++) {
				if (arr[i] + arr[j] == 8) {
					System.out.println("Sum of " + arr[i] + " " + arr[j]
							+ " coming out to be 8");
					result = true;
					break;
					
				}
			}
			if(result==true){
				break;
			}
		}
		return result;
	}

there are some issues while editing.. hence posting answer again

public static void longestPositiveSequence(int[] arr) {
		int index, tempIndex;
		int length, tempLength;

		index = tempIndex = -1;
		length = tempLength = 0;
		for (int i = 0; i < arr.length; i++) {
			if (arr[i] < 0) {
				if (tempLength > length) {
					length = tempLength;
					index = tempIndex;
				}
				tempLength = 0;
				tempIndex = i + 1;
			} else {
				tempLength++;
			}
		}

		if (index != -1) {
			System.out.println("Index : " + index + ", length : " + length);
		} else {
			System.out.println("No result found");
		}

	}

there is no need of flag here