Initial Course

modules/07_stl_containers/src/associative_containers.cpp

@@ -0,0 +1,21 @@
+#include "associative_containers.hpp"
+
+namespace stl_containers {
+
+auto word_frequencies(const std::vector<std::string>& words)
+    -> std::map<std::string, int> {
+    (void)words;
+    return {};
+}
+
+auto unique_sorted(const std::vector<int>& data) -> std::set<int> {
+    (void)data;
+    return {};
+}
+
+auto invert_map(const std::map<int, std::string>& input) -> std::map<std::string, int> {
+    (void)input;
+    return {};
+}
+
+}  // namespace stl_containers

modules/07_stl_containers/src/container_adapters.cpp

@@ -0,0 +1,20 @@
+#include "container_adapters.hpp"
+
+namespace stl_containers {
+
+auto is_balanced_parentheses(const std::string& text) -> bool {
+    (void)text;
+    return false;
+}
+
+auto simulate_queue(const std::vector<int>& arrivals) -> std::vector<int> {
+    (void)arrivals;
+    return {};
+}
+
+auto top_k_largest(const std::vector<int>& data, int k) -> std::vector<int> {
+    (void)data; (void)k;
+    return {};
+}
+
+}  // namespace stl_containers

modules/07_stl_containers/src/sequential_containers.cpp

@@ -0,0 +1,21 @@
+#include "sequential_containers.hpp"
+
+namespace stl_containers {
+
+auto merge_sorted_vectors(const std::vector<int>& a, const std::vector<int>& b)
+    -> std::vector<int> {
+    (void)a; (void)b;
+    return {};
+}
+
+auto list_to_vector(const std::list<int>& data) -> std::vector<int> {
+    (void)data;
+    return {};
+}
+
+auto rotate_deque(std::deque<int> data, int steps) -> std::deque<int> {
+    (void)data; (void)steps;
+    return {};
+}
+
+}  // namespace stl_containers

modules/07_stl_containers/src/unordered_containers.cpp

@@ -0,0 +1,21 @@
+#include "unordered_containers.hpp"
+
+namespace stl_containers {
+
+auto first_unique(const std::vector<std::string>& words) -> std::string {
+    (void)words;
+    return {};
+}
+
+auto group_anagrams(const std::vector<std::string>& words)
+    -> std::unordered_map<std::string, std::vector<std::string>> {
+    (void)words;
+    return {};
+}
+
+auto has_duplicate(const std::vector<int>& data) -> bool {
+    (void)data;
+    return false;
+}
+
+}  // namespace stl_containers