solution_template.md

/*
 * TASK TITLE
 *
 * Detailed, clear, and concise task description here.
 * State clearly what's expected, edge cases, and constraints.
 *
 * Visual illustrations using ASCII (if applicable):
 *
 * Example:
 * [illustration here if needed]
 *
 * Example Input/Output:
 * Input: ...
 * Output: ...
 * Explanation: ... (if necessary)
 */

#include <algorithm>
#include <cassert>
#include <vector>
#include <iostream>

// Simple (Brute-force) Solution
// Describe briefly complexity or limitations
int simpleSolution(const std::vector<int>& input) {
    // Implement simple solution here
    return 0; // placeholder
}

// Optimal (Efficient) Solution
// Describe complexity and advantages over the simple one
int optimalSolution(const std::vector<int>& input) {
    // Implement optimal solution here
    return 0; // placeholder
}

// (Optional) Additional Solution
// Describe special use case or educational value
int alternativeSolution(const std::vector<int>& input) {
    // Implement alternative solution here
    return 0; // placeholder
}

// Test cases for correctness
void test() {
    std::vector<std::vector<int>> testInputs = {
        // Add representative test cases
    };

    for (const auto& input : testInputs) {
        assert(simpleSolution(input) == optimalSolution(input));
        // Include alternativeSolution test if needed
    }

    std::cout << "All tests passed!\n";
}

int main() {
    test();
    return 0;
}