diff --git a/examples/stl_algorithm/array.cc b/examples/stl_algorithm/array.cc
index 08ab90e6..80a0847e 100644
--- a/examples/stl_algorithm/array.cc
+++ b/examples/stl_algorithm/array.cc
@@ -31,7 +31,8 @@
 #include "shad/util/measure.h"
 
 constexpr static size_t kArraySize = 1024;
-using iterator = shad::impl::array<int, kArraySize>::array_iterator<int>;
+using array_t = shad::impl::array<int, kArraySize>;
+using iterator = array_t::iterator;
 
 void shad_generate_algorithm(shad::array<int, kArraySize> &in) {
   shad::generate(shad::distributed_parallel_tag{}, in.begin(), in.end(), [=]() {
@@ -65,9 +66,9 @@ void shad_for_each_algorithm(shad::array<int, kArraySize> &in) {
 
 std::pair<iterator, iterator> shad_minmax_algorithm(
     shad::array<int, kArraySize> &in) {
-  auto [min, max] = shad::minmax_element(shad::distributed_parallel_tag{},
-                                         in.begin(), in.end());
-  return {min, max};
+  auto res = shad::minmax_element(shad::distributed_parallel_tag{}, in.begin(),
+                                  in.end());
+  return res;
 }
 
 void shad_transform_algorithm(shad::array<int, kArraySize> &in) {
@@ -139,4 +140,4 @@ int main(int argc, char *argv[]) {
   return 0;
 }
 
-}  // namespace shad
\ No newline at end of file
+}  // namespace shad
diff --git a/examples/stl_algorithm/unordered_map.cc b/examples/stl_algorithm/unordered_map.cc
index 8703402d..30fb021f 100644
--- a/examples/stl_algorithm/unordered_map.cc
+++ b/examples/stl_algorithm/unordered_map.cc
@@ -39,9 +39,9 @@ using shad_buffered_inserter_t =
 
 std::pair<iterator, iterator> shad_minmax_algorithm(
     shad::unordered_map<int, int> &in) {
-  auto [min, max] = shad::minmax_element(shad::distributed_parallel_tag{},
-                                         in.begin(), in.end());
-  return {min, max};
+  auto res = shad::minmax_element(shad::distributed_parallel_tag{}, in.begin(),
+                                  in.end());
+  return res;
 }
 
 iterator shad_find_if_algorithm(shad::unordered_map<int, int> &in) {
diff --git a/examples/stl_algorithm/unordered_set.cc b/examples/stl_algorithm/unordered_set.cc
index 11dc3bdf..79002915 100644
--- a/examples/stl_algorithm/unordered_set.cc
+++ b/examples/stl_algorithm/unordered_set.cc
@@ -38,9 +38,9 @@ using shad_buffered_inserter_t =
 
 std::pair<iterator, iterator> shad_minmax_algorithm(
     shad::unordered_set<int> &in) {
-  auto [min, max] = shad::minmax_element(shad::distributed_parallel_tag{},
-                                         in.begin(), in.end());
-  return {min, max};
+  auto res = shad::minmax_element(shad::distributed_parallel_tag{}, in.begin(),
+                                  in.end());
+  return res;
 }
 
 iterator shad_find_if_algorithm(shad::unordered_set<int> &in) {