Try It Yourself - SyntaxStudy Editor

HTML / CSS / JS

#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
#include <string>

int main() {
    // --- std::map ---
    std::map<std::string, int> wordCount;
    for (const std::string& w : {"cat","dog","cat","bird","dog","cat"})
        ++wordCount[w];   // operator[] default-inserts 0

std::cout << "Word counts (sorted):
";
    for (const auto& [word, count] : wordCount)   // C++17 structured binding
        std::cout << "  " << word << ": " << count << "
";

// Safe lookup without insertion
    if (auto it = wordCount.find("cat"); it != wordCount.end())
        std::cout << "cat found: " << it->second << "
";

// --- std::set ---
    std::set<int> primes = {2, 3, 5, 7, 11, 13};
    primes.insert(17);
    primes.insert(7);   // duplicate — silently ignored
    std::cout << "Primes: ";
    for (int p : primes) std::cout << p << " ";
    std::cout << "
";
    std::cout << "contains 11: " << primes.count(11) << "
";

// --- std::unordered_map (O(1) avg) ---
    std::unordered_map<std::string, std::string> capitals;
    capitals["France"]  = "Paris";
    capitals["Germany"] = "Berlin";
    capitals["Japan"]   = "Tokyo";

std::cout << "Capital of Japan: " << capitals.at("Japan") << "
";

return 0;
}