private boolean noSolution(boolean[] lookupA, boolean[] lookupB)
	{
		// Note that problem constraint is that
		// 2 <= sizeA, sizeB < N
		int prev = 0;
		for (int i = 1; i <= this.numElementsN; ++i)
		{
			if (lookupA[prev] && lookupA[i]) {
				return true;
			}
			if (lookupB[prev] && lookupB[i]) {
				return true;
			}
			if (lookupA[i] && lookupB[i]) {
				return true;
			}
			prev = i;
		}
		return false;
	}