
#define CATCH_CONFIG_MAIN
#include <catch2/catch.hpp>

#include <vector>
#include <algorithm>

std::vector<int> generateSequence(int n);
std::vector<int> squareElements(const std::vector<int>& input);

TEST_CASE("squareElements squares all elements correctly", "[squareElements]") {
    std::vector<int> input = {1, 2, 3, 4, 5};
    std::vector<int> expected = {1, 4, 9, 16, 25};
    auto result = squareElements(input);
    REQUIRE(result == expected);
}

TEST_CASE("squareElements works with empty vector", "[squareElements]") {
    std::vector<int> input = {};
    auto result = squareElements(input);
    REQUIRE(result.empty());
}

TEST_CASE("squareElements works with negatives and zero", "[squareElements]") {
    std::vector<int> input = {-2, 0, 3};
    std::vector<int> expected = {4, 0, 9};
    auto result = squareElements(input);
    REQUIRE(result == expected);
}


TEST_CASE("generateSequence returns correct size", "[generateSequence]") {
    for (int n : {0, 1, 5, 10, 50}) {
        auto v = generateSequence(n);
        REQUIRE(v.size() == n);
    }
}

test.cpp

Master modern C++ through the power of the Standard Template Library. Learn how containers, iterators, and algorithms work together to create clean, efficient, and expressive code. Explore essential containers like vector, map, and unordered_map, understand their performance trade-offs, and apply core algorithms for searching, sorting, transforming, and generating data. Build a solid foundation for writing robust, reusable, and high-performance C++ programs.

Overview of the STL, its design philosophy, and how containers and algorithms interact to provide powerful abstractions in C++.

Deep dive into the most important STL containers, their strengths, weaknesses, and advanced usage patterns.

Master the use of STL algorithms, from basic to advanced, and learn how to leverage them for expressive and efficient code.

Challenge: Generate and Transform Sequence

Solution

Awesome!

Challenge: Generate and Transform Sequence

Solution