Finding the longest sequence of increasing numbers in an array
No need for temporary lists
In your last review, it was mentioned that you could just use two integers to keep track of the sequences instead of two whole lists.  So instead of currentNumbersSequence and longestIncreasingSequence, you could track just the start and length of those two sequences.  The code then becomes:
public static List&lt;Integer&gt; findLongestIncreasingSequence(int[] numbersToBeProcessed) {

    if (numbersToBeProcessed.length == 0) {
        return null;
    }

    int bestStart  = 0;
    int curStart   = 0;
    int bestLength = 1;
    int curLength  = 1;

    for (int i = 1; i &lt; numbersToBeProcessed.length; i++) {
        if (numbersToBeProcessed[i] &gt; numbersToBeProcessed[i-1]) {
            curLength++;
            if (curLength &gt; bestLength) {
                bestStart  = curStart;
                bestLength = curLength;
            }
        } else {
            curStart  = i;
            curLength = 1;
        }
    }
    ArrayList&lt;Integer&gt; ret = new ArrayList&lt;&gt;(bestLength);
    for (int i = 0; i &lt; bestLength; i++) {
        ret.add(numbersToBeProcessed[bestStart+i]);
    }
    return ret;
}