Embercode: AI-powered software engineer course

1. What does this program print? ``

cpp
#include <algorithm>
#include <iostream>
#include <vector>

int main() {
    std::vector<long long> a = {-3, 2, -4};
    long long best = a[0], curMax = a[0], curMin = a[0];
    for (std::size_t i = 1; i < a.size(); ++i) {
        long long x = a[i];
        long long newMax = std::max({x, curMax * x, curMin * x});
        long long newMin = std::min({x, curMax * x, curMin * x});
        curMax = newMax;
        curMin = newMin;
        best = std::max(best, curMax);
    }
    std::cout << best << "\n";
}

``

2-624-8

2. The running values before a step are curMax = 8 and curMin = -80. The next value is x = -4. What is the new curMax?

3208-32-80

3. True or false: for the list [-5], the answer is 0, because a zero can always be chosen.

True, because a zero can always be chosenFalse, because a subarray must hold at least one value, so the answer is -5

4. The program multiplies 100000 * 100000 * 3. Which type does the lesson say to use for products, and why?

int, because it is faster and it holds 30,000,000,000long long, because 30,000,000,000 is too big for int, which stops at about 2.1 billionunsigned int, because products are never negativefloat, because floating-point numbers never overflow

5. True or false: keeping only the largest running product gives the correct answer for the list [2, 3, -2, 4].

True, because the answer 6 appears at x = 3 and no later step beats itFalse, because the smallest running product is needed for any list with a negative number

Maximum product