diff --git a/libcxx/docs/Status/RangesAlgorithms.csv b/libcxx/docs/Status/RangesAlgorithms.csv
--- a/libcxx/docs/Status/RangesAlgorithms.csv
+++ b/libcxx/docs/Status/RangesAlgorithms.csv
@@ -17,10 +17,10 @@
 Search,binary_search,Christopher Di Bella,n/a,Not started
 Search,min,Not assigned,n/a,Not started
 Search,max,Not assigned,n/a,Not started
-Search,minmax,Not assigned,n/a,Not started
+Search,minmax,Nikolas Klauser,`D120637 <https://llvm.org/D120637>`_,✅
 Search,min_element,Nikolas Klauser,n/a,✅
 Search,max_element,Not assigned,n/a,Not started
-Search,minmax_element,Not assigned,n/a,Not started
+Search,minmax_element,Nikolas Klauser,`D120637 <https://llvm.org/D120637>`_,✅
 Search,count,Not assigned,n/a,Not started
 Search,count_if,Not assigned,n/a,Not started
 Search,search,Not assigned,n/a,Not started
diff --git a/libcxx/include/CMakeLists.txt b/libcxx/include/CMakeLists.txt
--- a/libcxx/include/CMakeLists.txt
+++ b/libcxx/include/CMakeLists.txt
@@ -71,6 +71,8 @@
   __algorithm/ranges_find_if_not.h
   __algorithm/ranges_max_element.h
   __algorithm/ranges_min_element.h
+  __algorithm/ranges_minmax.h
+  __algorithm/ranges_minmax_element.h
   __algorithm/ranges_mismatch.h
   __algorithm/ranges_swap_ranges.h
   __algorithm/remove.h
diff --git a/libcxx/include/__algorithm/ranges_minmax.h b/libcxx/include/__algorithm/ranges_minmax.h
new file mode 100644
--- /dev/null
+++ b/libcxx/include/__algorithm/ranges_minmax.h
@@ -0,0 +1,120 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_MINMAX_H
+#define _LIBCPP___ALGORITHM_RANGES_MINMAX_H
+
+#include <__algorithm/ranges_minmax_element.h>
+#include <__assert>
+#include <__concepts/copyable.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES)
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __minmax {
+struct __fn {
+  template <class _Tp, class _Proj = identity,
+            indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
+  _LIBCPP_HIDE_FROM_ABI constexpr ranges::minmax_result<const _Tp&>
+  operator()(const _Tp& __a, const _Tp& __b, _Comp __comp = {}, _Proj __proj = {}) const {
+    if (std::invoke(__comp, std::invoke(__proj, __b), std::invoke(__proj, __a)))
+      return {__b, __a};
+    return {__a, __b};
+  }
+
+  template <copyable _Tp, class _Proj = identity,
+            indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  ranges::minmax_result<_Tp> operator()(initializer_list<_Tp> __r, _Comp __comp = {}, _Proj __proj = {}) const {
+    _LIBCPP_ASSERT(__r.begin() != __r.end(), "initilaizer_list has to contain at least one element");
+    auto __iters = __minmax_element::__fn::__go(ranges::begin(__r), ranges::end(__r), __comp, __proj);
+    return ranges::minmax_result<_Tp> { *__iters.min, *__iters.max };
+  }
+
+  template <input_range _Rp, class _Proj = identity,
+            indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
+    requires indirectly_copyable_storable<iterator_t<_Rp>, range_value_t<_Rp>*>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  ranges::minmax_result<range_value_t<_Rp>> operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
+    auto __first = ranges::begin(__r);
+    auto __last = ranges::end(__r);
+    using _Ip = range_value_t<_Rp>;
+
+    _LIBCPP_ASSERT(__first != __last, "range has to contain at least one element");
+
+    if constexpr (forward_range<_Rp>) {
+      auto __result = __minmax_element::__fn::__go(__first, __last, __comp, __proj);
+      return {*__result.min, *__result.max};
+    } else {
+      auto __less = [&](auto&& __a, auto&& __b) -> bool {
+        return std::invoke(__comp, std::invoke(__proj, std::forward<decltype(__a)>(__a)),
+                                  std::invoke(__proj, std::forward<decltype(__b)>(__b)));
+      };
+
+      ranges::minmax_result<_Ip> __result = {*__first, __result.min};
+      if (__first == __last || ++__first == __last)
+        return __result;
+
+      if (__less(*__first, __result.min))
+        __result.min = *__first;
+      else
+        __result.max = *__first;
+
+      while (++__first != __last) {
+        _Ip __i = *__first;
+        if (++__first == __last) {
+          if (__less(__i, __result.min))
+            __result.min = __i;
+          else if (!__less(__i, __result.max))
+            __result.max = __i;
+          return __result;
+        }
+
+        if (__less(*__first, __i)) {
+          if (__less(*__first, __result.min))
+            __result.min = *__first;
+          if (!__less(__i, __result.max))
+            __result.max = std::move(__i);
+        } else {
+          if (__less(__i, __result.min))
+            __result.min = std::move(__i);
+          if (!__less(*__first, __result.max))
+            __result.max = *__first;
+        }
+      }
+      return __result;
+    }
+  }
+};
+} // namespace __minmax
+
+inline namespace __cpo {
+  inline constexpr auto minmax = __minmax::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES)
+
+#endif // _LIBCPP___ALGORITHM_RANGES_MINMAX_H
diff --git a/libcxx/include/__algorithm/ranges_minmax_element.h b/libcxx/include/__algorithm/ranges_minmax_element.h
new file mode 100644
--- /dev/null
+++ b/libcxx/include/__algorithm/ranges_minmax_element.h
@@ -0,0 +1,113 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_MINMAX_ELEMENT_H
+#define _LIBCPP___ALGORITHM_RANGES_MINMAX_ELEMENT_H
+
+#include <__algorithm/min_max_result.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES)
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _Tp>
+using minmax_result = min_max_result<_Tp>;
+
+namespace __minmax_element {
+struct __fn {
+  template <class _Ip, class _Sp, class _Proj, class _Comp>
+  static _LIBCPP_HIDE_FROM_ABI constexpr
+  minmax_result<_Ip> __go(_Ip __first, _Sp __last, _Comp& __comp, _Proj& __proj) {
+    auto __less = [&](_Ip& __it1, _Ip& __it2) -> bool {
+      return std::invoke(__comp, std::invoke(__proj, *__it1), std::invoke(__proj, *__it2));
+    };
+
+    ranges::minmax_result<_Ip> __result {__first, __first};
+    if (__first == __last || ++__first == __last)
+      return __result;
+
+    if (__less(__first, __result.min))
+      __result.min = __first;
+    else
+      __result.max = __first;
+
+    auto __maybe_update_min = [&](_Ip& __it) {
+      if (__less(__it, __result.min))
+        __result.min = __it;
+    };
+
+    auto __maybe_update_max = [&](_Ip& __it) {
+      if (!__less(__it, __result.max))
+        __result.max = __it;
+    };
+
+    while (++__first != __last) {
+      _Ip __i = __first;
+      if (++__first == __last) {
+        if (__less(__i, __result.min))
+          __result.min = __i;
+        else if (!__less(__i, __result.max))
+          __result.max = __i;
+        return __result;
+      }
+
+      if (__less(__first, __i)) {
+        __maybe_update_min(__first);
+        __maybe_update_max(__i);
+      } else {
+        __maybe_update_min(__i);
+        __maybe_update_max(__first);
+      }
+    }
+
+    return __result;
+  }
+
+  template <forward_iterator _Ip, sentinel_for<_Ip> _Sp, class _Proj = identity,
+            indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  ranges::minmax_result<_Ip> operator()(_Ip __first, _Sp __last, _Comp __comp = {}, _Proj __proj = {}) const {
+    return __go(std::move(__first), std::move(__last), __comp, __proj);
+  }
+
+  template <forward_range _Rp, class _Proj = identity,
+            indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  ranges::minmax_result<borrowed_iterator_t<_Rp>> operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
+    return __go(ranges::begin(__r), ranges::end(__r), __comp, __proj);
+  }
+};
+} // namespace __minmax_element
+
+inline namespace __cpo {
+  inline constexpr auto minmax_element = __minmax_element::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES)
+
+#endif // _LIBCPP___ALGORITHM_RANGES_MINMAX_H
diff --git a/libcxx/include/algorithm b/libcxx/include/algorithm
--- a/libcxx/include/algorithm
+++ b/libcxx/include/algorithm
@@ -83,6 +83,31 @@
            indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
     constexpr borrowed_iterator_t<R>
       find_if_not(R&& r, Pred pred, Proj proj = {});                                // since C++20
+
+  template<class T, class Proj = identity,
+           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
+    constexpr rangesminmax_result<const T&>
+      minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {});                     // since C++20
+
+  template<copyable T, class Proj = identity,
+           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
+    constexpr ranges::minmax_result<T>
+      minmax(initializer_list<T> r, Comp comp = {}, Proj proj = {});                      // since C++20
+
+  template<input_range R, class Proj = identity,
+           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
+    requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
+    constexpr ranges::minmax_result<range_value_t<R>>
+      minmax(R&& r, Comp comp = {}, Proj proj = {});                                      // since C++20
+
+  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
+    indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
+  constexpr I minmax_element(I first, S last, Comp comp = {}, Proj proj = {});            // since C++20
+
+  template<forward_range R, class Proj = identity,
+    indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
+  constexpr borrowed_iterator_t<R> minmax_element(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
+
 }
 
 template <class InputIterator, class Predicate>
@@ -807,6 +832,8 @@
 #include <__algorithm/ranges_find_if_not.h>
 #include <__algorithm/ranges_max_element.h>
 #include <__algorithm/ranges_min_element.h>
+#include <__algorithm/ranges_minmax.h>
+#include <__algorithm/ranges_minmax_element.h>
 #include <__algorithm/ranges_mismatch.h>
 #include <__algorithm/ranges_swap_ranges.h>
 #include <__algorithm/remove.h>
diff --git a/libcxx/include/module.modulemap b/libcxx/include/module.modulemap
--- a/libcxx/include/module.modulemap
+++ b/libcxx/include/module.modulemap
@@ -299,6 +299,8 @@
       module ranges_find_if_not       { private header "__algorithm/ranges_find_if_not.h" }
       module ranges_max_element       { private header "__algorithm/ranges_max_element.h" }
       module ranges_min_element       { private header "__algorithm/ranges_min_element.h" }
+      module ranges_minmax            { private header "__algorithm/ranges_minmax.h" }
+      module ranges_minmax_element    { private header "__algorithm/ranges_minmax_element.h" }
       module ranges_mismatch          { private header "__algorithm/ranges_mismatch.h" }
       module ranges_swap_ranges       { private header "__algorithm/ranges_swap_ranges.h" }
       module remove                   { private header "__algorithm/remove.h" }
diff --git a/libcxx/test/libcxx/diagnostics/detail.headers/algorithm/ranges_minmax.module.verify.cpp b/libcxx/test/libcxx/diagnostics/detail.headers/algorithm/ranges_minmax.module.verify.cpp
new file mode 100644
--- /dev/null
+++ b/libcxx/test/libcxx/diagnostics/detail.headers/algorithm/ranges_minmax.module.verify.cpp
@@ -0,0 +1,15 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// REQUIRES: modules-build
+
+// WARNING: This test was generated by 'generate_private_header_tests.py'
+// and should not be edited manually.
+
+// expected-error@*:* {{use of private header from outside its module: '__algorithm/ranges_minmax.h'}}
+#include <__algorithm/ranges_minmax.h>
diff --git a/libcxx/test/libcxx/diagnostics/detail.headers/algorithm/ranges_minmax_element.module.verify.cpp b/libcxx/test/libcxx/diagnostics/detail.headers/algorithm/ranges_minmax_element.module.verify.cpp
new file mode 100644
--- /dev/null
+++ b/libcxx/test/libcxx/diagnostics/detail.headers/algorithm/ranges_minmax_element.module.verify.cpp
@@ -0,0 +1,15 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// REQUIRES: modules-build
+
+// WARNING: This test was generated by 'generate_private_header_tests.py'
+// and should not be edited manually.
+
+// expected-error@*:* {{use of private header from outside its module: '__algorithm/ranges_minmax_element.h'}}
+#include <__algorithm/ranges_minmax_element.h>
diff --git a/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ranges.minmax.pass.cpp b/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ranges.minmax.pass.cpp
new file mode 100644
--- /dev/null
+++ b/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ranges.minmax.pass.cpp
@@ -0,0 +1,294 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// <algorithm>
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17
+// UNSUPPORTED: libcpp-has-no-incomplete-ranges
+
+// template<class T, class Proj = identity,
+//          indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
+//   constexpr ranges::minmax_result<const T&>
+//     ranges::minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {});
+// template<copyable T, class Proj = identity,
+//          indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
+//   constexpr ranges::minmax_result<T>
+//     ranges::minmax(initializer_list<T> r, Comp comp = {}, Proj proj = {});
+// template<input_range R, class Proj = identity,
+//          indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
+//   requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
+//   constexpr ranges::minmax_result<range_value_t<R>>
+//     ranges::minmax(R&& r, Comp comp = {}, Proj proj = {});
+
+#include <algorithm>
+#include <array>
+#include <cassert>
+#include <ranges>
+
+#include "test_iterators.h"
+
+template <class T>
+concept HasMinMax = requires { std::ranges::minmax(std::declval<T>()); };
+
+struct NoLessThanOp {};
+struct NotTotallyOrdered {
+  int i;
+  bool operator<(const NotTotallyOrdered& o) const { return i < o.i; }
+};
+struct MoveOnly {
+  MoveOnly(MoveOnly&&) = default;
+  MoveOnly& operator=(MoveOnly&&) = default;
+  MoveOnly(const MoveOnly&) = delete;
+};
+
+static_assert(!HasMinMax<int>);
+
+static_assert(HasMinMax<int (&)[10]>);
+static_assert(HasMinMax<int (&&)[10]>);
+static_assert(!HasMinMax<NoLessThanOp (&)[10]>);
+static_assert(!HasMinMax<NotTotallyOrdered (&)[10]>);
+static_assert(!HasMinMax<MoveOnly (&)[10]>);
+
+static_assert(HasMinMax<std::initializer_list<int>>);
+static_assert(!HasMinMax<std::initializer_list<NoLessThanOp>>);
+static_assert(!HasMinMax<std::initializer_list<NotTotallyOrdered>>);
+static_assert(!HasMinMax<std::initializer_list<MoveOnly>>);
+
+static_assert(std::is_same_v<decltype(std::ranges::minmax(1, 2)), std::ranges::minmax_result<const int&>>);
+
+constexpr void test_2_arguments() {
+  const int one = 1;
+  const int two = 2;
+  {
+    auto result = std::ranges::minmax(one, two);
+    assert(result.min == 1);
+    assert(result.max == 2);
+  }
+  {
+    auto result = std::ranges::minmax(two, one);
+    assert(result.min == 1);
+    assert(result.max == 2);
+  }
+  {
+    // test comparator
+    auto result = std::ranges::minmax(one, two, std::ranges::greater{});
+    assert(result.min == 2);
+    assert(result.max == 1);
+  }
+  {
+    // test projection
+    auto result = std::ranges::minmax(one, two, std::ranges::less{}, [](int i) { return i == 1 ? 10 : i; });
+    assert(result.min == 2);
+    assert(result.max == 1);
+  }
+  {
+    // test if std::invoke is used
+    struct S {
+      int i;
+    };
+    S a[3] = {S{2}, S{1}, S{3}};
+    decltype(auto) ret = std::ranges::minmax(a[0], a[1], {}, &S::i);
+    ASSERT_SAME_TYPE(decltype(ret), std::ranges::minmax_result<const S&>);
+    assert(&ret.min == &a[1]);
+    assert(&ret.max == &a[0]);
+    assert(ret.min.i == 1);
+    assert(ret.max.i == 2);
+  }
+  {
+    auto r = std::ranges::minmax(one, two, [](int, int) { return false; });
+    assert(r.min == 1);
+    assert(r.max == 2);
+  }
+}
+
+constexpr void test_initializer_list() {
+  {
+    // test projection
+    auto proj = [](int i) { return i == 5 ? -100 : i; };
+    auto ret = std::ranges::minmax({7, 6, 9, 3, 5, 1, 2, 4}, std::ranges::less{}, proj);
+    assert(ret.min == 5);
+    assert(ret.max == 9);
+  }
+
+  {
+    // test comparator
+    auto ret = std::ranges::minmax({7, 6, 9, 3, 5, 1, 2, 4}, std::ranges::greater{});
+    assert(ret.min == 9);
+    assert(ret.max == 1);
+  }
+
+  {
+    // check predicate and projection call counts
+    int compares = 0;
+    int projections = 0;
+    auto comparator = [&](int a, int b) {
+      ++compares;
+      return a < b;
+    };
+    auto projection = [&](int a) {
+      ++projections;
+      return a;
+    };
+    std::same_as<std::ranges::minmax_result<int>> decltype(auto) ret =
+        std::ranges::minmax({1, 2, 3}, comparator, projection);
+    assert(ret.min == 1);
+    assert(ret.max == 3);
+    assert(compares == 3);
+    assert(projections == 6);
+  }
+
+  {
+    // check that std::invoke is used
+    struct S {
+      int i;
+    };
+    decltype(auto) ret = std::ranges::minmax({S{2}, S{1}, S{3}}, {}, &S::i);
+    ASSERT_SAME_TYPE(decltype(ret), std::ranges::minmax_result<S>);
+    assert(ret.min.i == 1);
+    assert(ret.max.i == 3);
+  }
+
+  {
+    // check that a single element works
+    auto ret = std::ranges::minmax({ 1 });
+    assert(ret.min == 1);
+    assert(ret.max == 1);
+  }
+
+  {
+    // check in ascending order
+    auto ret = std::ranges::minmax({1, 2, 3});
+    assert(ret.min == 1);
+    assert(ret.max == 3);
+  }
+
+  {
+    // check in descending order
+    auto ret = std::ranges::minmax({3, 2, 1});
+    assert(ret.min == 1);
+    assert(ret.max == 3);
+  }
+}
+
+constexpr void test_range() {
+  {
+    // test projection
+    int a[] = {7, 6, 9, 3, 5, 1, 2, 4};
+    auto proj = [](int& i) { return i == 5 ? -100 : i; };
+    auto ret = std::ranges::minmax(a, std::ranges::less{}, proj);
+    assert(ret.min == 5);
+    assert(ret.max == 9);
+  }
+
+  {
+    // test comparator
+    int a[] = {7, 6, 9, 3, 5, 1, 2, 4};
+    auto ret = std::ranges::minmax(a, std::ranges::greater{});
+    assert(ret.min == 9);
+    assert(ret.max == 1);
+  }
+
+  {
+    int compares = 0;
+    int projections = 0;
+    auto comparator = [&](int x, int y) {
+      ++compares;
+      return x < y;
+    };
+    auto projection = [&](int x) {
+      ++projections;
+      return x;
+    };
+    std::same_as<std::ranges::minmax_result<int>> decltype(auto) ret =
+        std::ranges::minmax(std::array{1, 2, 3}, comparator, projection);
+    assert(ret.min == 1);
+    assert(ret.max == 3);
+    assert(compares == 3);
+    assert(projections == 6);
+  }
+
+  {
+    struct S {
+      int i;
+    };
+    S b[3] = {S{2}, S{1}, S{3}};
+    std::same_as<std::ranges::minmax_result<S>> decltype(auto) ret = std::ranges::minmax(b, {}, &S::i);
+    assert(ret.min.i == 1);
+    assert(ret.max.i == 3);
+  }
+
+  {
+    int a[] = {7, 6, 9, 3, 5, 1, 2, 4};
+    using It = cpp20_input_iterator<int*>;
+    using Sent = sentinel_wrapper<It>;
+    auto range = std::ranges::subrange(It(a), Sent(It(a + 8)));
+    auto ret = std::ranges::minmax(range);
+    assert(ret.min == 1);
+    assert(ret.max == 9);
+  }
+
+  {
+    // check that the leftmost value for min an rightmost for max are returned
+    struct S {
+      int comp;
+      int other;
+    };
+    S a[] = { {0, 0}, {0, 2}, {0, 1} };
+    auto ret = std::ranges::minmax(a, {}, &S::comp);
+    assert(ret.min.comp == 0);
+    assert(ret.max.comp == 0);
+    assert(ret.min.other == 0);
+    assert(ret.max.other == 1);
+  }
+
+  { // check that a single element works
+    int a[] = { 1 };
+    auto ret = std::ranges::minmax(a);
+    assert(ret.min == 1);
+    assert(ret.max == 1);
+  }
+
+  { // check in ascending order
+    int a[] = {1, 2, 3};
+    auto ret = std::ranges::minmax(a);
+    assert(ret.min == 1);
+    assert(ret.max == 3);
+  }
+
+  { // check in descending order
+    int a[] = {3, 2, 1};
+    auto ret = std::ranges::minmax(a);
+    assert(ret.min == 1);
+    assert(ret.max == 3);
+  }
+}
+
+constexpr bool test() {
+  test_2_arguments();
+  test_initializer_list();
+  test_range();
+
+  return true;
+}
+
+int main(int, char**) {
+  test();
+  static_assert(test());
+
+  {
+    // check that the iterator isn't moved from multiple times
+    std::shared_ptr<int> a[] = { std::make_shared<int>(42) };
+    auto range = std::ranges::subrange(std::move_iterator(a), std::move_iterator(a + 1));
+    auto [min, max] = std::ranges::minmax(range);
+    assert(a[0] == nullptr);
+    assert(min != nullptr);
+    assert(max == min);
+  }
+
+  return 0;
+}
diff --git a/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ranges.minmax_element.pass.cpp b/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ranges.minmax_element.pass.cpp
new file mode 100644
--- /dev/null
+++ b/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ranges.minmax_element.pass.cpp
@@ -0,0 +1,333 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// <algorithm>
+
+// UNSUPPORTED: c++03, c++11, c++14, c++17
+// UNSUPPORTED: libcpp-has-no-incomplete-ranges
+
+//  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
+//    indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
+//  constexpr I ranges::minmax_element(I first, S last, Comp comp = {}, Proj proj = {});
+//
+//  template<forward_range R, class Proj = identity,
+//    indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
+//  constexpr borrowed_iterator_t<R> ranges::minmax_element(R&& r, Comp comp = {}, Proj proj = {});
+
+#include <algorithm>
+#include <array>
+#include <cassert>
+#include <ranges>
+
+#include "almost_satisfies_types.h"
+#include "test_iterators.h"
+
+template <class T>
+concept HasMinMaxElementR = requires(T t) { std::ranges::minmax_element(t); };
+
+struct NoLessThanOp {};
+struct NotTotallyOrdered {
+  int i;
+  bool operator<(const NotTotallyOrdered& o) const { return i < o.i; }
+};
+
+static_assert(HasMinMaxElementR<int (&)[10]>);
+static_assert(HasMinMaxElementR<int (&&)[10]>);
+static_assert(!HasMinMaxElementR<NoLessThanOp (&)[10]>);
+static_assert(!HasMinMaxElementR<NotTotallyOrdered (&)[10]>);
+
+static_assert(HasMinMaxElementR<std::initializer_list<int>>);
+static_assert(!HasMinMaxElementR<std::initializer_list<NoLessThanOp>>);
+static_assert(!HasMinMaxElementR<std::initializer_list<NotTotallyOrdered>>);
+static_assert(!HasMinMaxElementR<InputRangeNotDerivedFrom>);
+static_assert(!HasMinMaxElementR<InputRangeNotIndirectlyReadable>);
+static_assert(!HasMinMaxElementR<InputRangeNotInputOrOutputIterator>);
+static_assert(!HasMinMaxElementR<InputRangeNotSentinelSemiregular>);
+static_assert(!HasMinMaxElementR<InputRangeNotSentinelEqualityComparableWith>);
+
+template <class It, class Sent = sentinel_wrapper<It>>
+concept HasMinMaxElementIt = requires(It it, Sent sent) { std::ranges::minmax_element(it, sent); };
+static_assert(HasMinMaxElementIt<int*>);
+static_assert(!HasMinMaxElementIt<InputIteratorNotDerivedFrom>);
+static_assert(!HasMinMaxElementIt<InputIteratorNotIndirectlyReadable>);
+static_assert(!HasMinMaxElementIt<InputIteratorNotInputOrOutputIterator>);
+static_assert(!HasMinMaxElementIt<int*, SentinelForNotSemiregular>);
+static_assert(!HasMinMaxElementIt<int*, SentinelForNotWeaklyEqualityComparableWith>);
+
+constexpr void test_iterators() {
+  int a[] = {7, 6, 5, 3, 4, 2, 1, 8};
+  std::same_as<std::ranges::minmax_result<int*>> auto it = std::ranges::minmax_element(a, a + 8);
+  auto expected = std::minmax_element(a, a + 8);
+  assert(expected.first == it.min);
+  assert(expected.second == it.max);
+}
+
+constexpr void test_range() {
+  int a[] = {7, 6, 5, 3, 4, 2, 1, 8};
+  std::same_as<std::ranges::minmax_result<int*>> auto it = std::ranges::minmax_element(a);
+  auto expected = std::minmax_element(a, a + 8);
+  assert(expected.first == it.min);
+  assert(expected.second == it.max);
+}
+
+template <class It>
+constexpr void test(std::initializer_list<int> a, int expectedMin, int expectedMax) {
+  using Expected = std::ranges::minmax_result<It>;
+  const int* first = a.begin();
+  const int* last = a.end();
+  {
+    std::same_as<Expected> auto it = std::ranges::minmax_element(It(first), It(last));
+    assert(base(it.min) == first + expectedMin);
+    assert(base(it.max) == first + expectedMax);
+  }
+  {
+    using Sent = sentinel_wrapper<It>;
+    std::same_as<Expected> auto it = std::ranges::minmax_element(It(first), Sent(It(last)));
+    assert(base(it.min) == first + expectedMin);
+    assert(base(it.max) == first + expectedMax);
+  }
+  {
+    auto range = std::ranges::subrange(It(first), It(last));
+    std::same_as<Expected> auto it = std::ranges::minmax_element(range);
+    assert(base(it.min) == first + expectedMin);
+    assert(base(it.max) == first + expectedMax);
+  }
+  {
+    using Sent = sentinel_wrapper<It>;
+    auto range = std::ranges::subrange(It(first), Sent(It(last)));
+    std::same_as<Expected> auto it = std::ranges::minmax_element(range);
+    assert(base(it.min) == first + expectedMin);
+    assert(base(it.max) == first + expectedMax);
+  }
+}
+
+template <class It>
+constexpr bool test() {
+  test<It>({}, 0, 0);
+  test<It>({1}, 0, 0);
+  test<It>({1, 2}, 0, 1);
+  test<It>({2, 1}, 1, 0);
+  test<It>({2, 1, 2}, 1, 2);
+  test<It>({2, 1, 1}, 1, 0);
+  test<It>({2, 2, 1}, 2, 1);
+
+  return true;
+}
+
+constexpr void test_borrowed_range_and_sentinel() {
+  int a[] = {7, 6, 1, 3, 5, 1, 2, 4};
+
+  std::ranges::minmax_result<int*> ret = std::ranges::minmax_element(std::views::all(a));
+  assert(ret.min == a + 2);
+  assert(ret.max == a + 0);
+  assert(*ret.min == 1);
+  assert(*ret.max == 7);
+}
+
+constexpr void test_comparator() {
+  int a[] = {7, 6, 9, 3, 5, 1, 2, 4};
+  std::ranges::minmax_result<int*> ret = std::ranges::minmax_element(a, std::ranges::greater{});
+  assert(ret.min == a + 2);
+  assert(ret.max == a + 5);
+  assert(*ret.min == 9);
+  assert(*ret.max == 1);
+}
+
+constexpr void test_projection() {
+  {
+    int a[] = {7, 6, 9, 3, 5, 1, 2, 4};
+    std::ranges::minmax_result<int*> ret =
+        std::ranges::minmax_element(a, std::ranges::less{}, [](int i) { return i == 5 ? -100 : i; });
+    assert(ret.min == a + 4);
+    assert(ret.max == a + 2);
+    assert(*ret.min == 5);
+    assert(*ret.max == 9);
+  }
+  {
+    int a[] = {7, 6, 9, 3, 5, 1, 2, 4};
+    std::ranges::minmax_result<int*> ret = std::ranges::minmax_element(a, std::less<int*>{}, [](int& i) { return &i; });
+    assert(ret.min == a + 0);
+    assert(ret.max == a + 7);
+    assert(*ret.min == 7);
+    assert(*ret.max == 4);
+  }
+}
+
+struct Immobile {
+  int i;
+
+  constexpr Immobile(int i_) : i(i_) {}
+  Immobile(const Immobile&) = delete;
+  Immobile(Immobile&&) = delete;
+
+  auto operator<=>(const Immobile&) const = default;
+};
+
+constexpr void test_immobile() {
+  {
+    Immobile arr[]{1, 2, 3};
+    auto ret = std::ranges::minmax_element(arr);
+    assert(ret.min == arr + 0);
+    assert(ret.max == arr + 2);
+  }
+  {
+    Immobile arr[]{1, 2, 3};
+    auto ret = std::ranges::minmax_element(arr, arr + 3);
+    assert(ret.min == arr + 0);
+    assert(ret.max == arr + 2);
+  }
+}
+
+constexpr void test_dangling() {
+  int compares = 0;
+  int projections = 0;
+  auto comparator = [&](int a, int b) {
+    ++compares;
+    return a < b;
+  };
+  auto projection = [&](int a) {
+    ++projections;
+    return a;
+  };
+  [[maybe_unused]] std::same_as<std::ranges::minmax_result<std::ranges::dangling>> auto ret =
+      std::ranges::minmax_element(std::array{1, 2, 3}, comparator, projection);
+  assert(compares == 3);
+  assert(projections == 6);
+}
+
+constexpr void test_uses_invoke() {
+  {
+    struct S {
+      int i;
+    };
+    S b[3] = {S{2}, S{1}, S{3}};
+    std::same_as<std::ranges::minmax_result<S*>> decltype(auto) ret = std::ranges::minmax_element(b, {}, &S::i);
+    assert(ret.min->i == 1);
+    assert(ret.max->i == 3);
+    assert(ret.min == b + 1);
+    assert(ret.max == b + 2);
+  }
+  {
+    struct S {
+      int i;
+    };
+    S b[3] = {S{2}, S{1}, S{3}};
+    std::same_as<std::ranges::minmax_result<S*>> decltype(auto) ret = std::ranges::minmax_element(b, b + 3, {}, &S::i);
+    assert(ret.min->i == 1);
+    assert(ret.max->i == 3);
+    assert(ret.min == b + 1);
+    assert(ret.max == b + 2);
+  }
+}
+
+constexpr bool test() {
+  test<forward_iterator<const int*>>();
+  test<bidirectional_iterator<const int*>>();
+  test<random_access_iterator<const int*>>();
+  test<contiguous_iterator<const int*>>();
+  test<const int*>();
+  test<int*>();
+
+  test_iterators();
+  test_range();
+
+  test_borrowed_range_and_sentinel();
+  test_comparator();
+  test_projection();
+  test_dangling();
+  test_uses_invoke();
+
+  { // check that the leftmost value for min an rightmost for max are returned
+    {
+      struct S {
+        int comp;
+        int other;
+      };
+      S a[] = { {0, 0}, {0, 2}, {0, 1} };
+      auto ret = std::ranges::minmax_element(a, a + 3, {}, &S::comp);
+      assert(ret.min->comp == 0);
+      assert(ret.max->comp == 0);
+      assert(ret.min->other == 0);
+      assert(ret.max->other == 1);
+    }
+    {
+      struct S {
+        int comp;
+        int other;
+      };
+      S a[] = { {0, 0}, {0, 2}, {0, 1} };
+      auto ret = std::ranges::minmax_element(a, {}, &S::comp);
+      assert(ret.min->comp == 0);
+      assert(ret.max->comp == 0);
+      assert(ret.min->other == 0);
+      assert(ret.max->other == 1);
+    }
+  }
+
+  { // check that an empty range works
+    {
+      std::array<int, 0> a = {};
+      auto ret = std::ranges::minmax_element(a.begin(), a.end());
+      assert(ret.min == a.begin());
+      assert(ret.max == a.begin());
+    }
+    {
+      std::array<int, 0> a = {};
+      auto ret = std::ranges::minmax_element(a);
+      assert(ret.min == a.begin());
+      assert(ret.max == a.begin());
+    }
+  }
+
+  { // check in ascending order
+    {
+      int a[] = {1, 2, 3};
+      auto ret = std::ranges::minmax_element(a, a + 3);
+      assert(ret.min == a + 0);
+      assert(ret.max == a + 2);
+      assert(*ret.min == 1);
+      assert(*ret.max == 3);
+    }
+    {
+      int a[] = {1, 2, 3};
+      auto ret = std::ranges::minmax_element(a);
+      assert(ret.min == a + 0);
+      assert(ret.max == a + 2);
+      assert(*ret.min == 1);
+      assert(*ret.max == 3);
+    }
+  }
+
+  { // check in descending order
+    {
+      int a[] = {3, 2, 1};
+      auto ret = std::ranges::minmax_element(a, a + 3);
+      assert(ret.min == a + 2);
+      assert(ret.max == a + 0);
+      assert(*ret.min == 1);
+      assert(*ret.max == 3);
+    }
+    {
+      int a[] = {3, 2, 1};
+      auto ret = std::ranges::minmax_element(a);
+      assert(ret.min == a + 2);
+      assert(ret.max == a + 0);
+      assert(*ret.min == 1);
+      assert(*ret.max == 3);
+    }
+  }
+
+  return true;
+}
+
+int main(int, char**) {
+  test();
+  static_assert(test());
+
+  return 0;
+}
diff --git a/libcxx/test/std/library/description/conventions/customization.point.object/niebloid.compile.pass.cpp b/libcxx/test/std/library/description/conventions/customization.point.object/niebloid.compile.pass.cpp
--- a/libcxx/test/std/library/description/conventions/customization.point.object/niebloid.compile.pass.cpp
+++ b/libcxx/test/std/library/description/conventions/customization.point.object/niebloid.compile.pass.cpp
@@ -102,8 +102,8 @@
 //static_assert(test(std::ranges::merge, a, a, a));
 //static_assert(test(std::ranges::min, a));
 static_assert(test(std::ranges::min_element, a));
-//static_assert(test(std::ranges::minmax, a));
-//static_assert(test(std::ranges::minmax_element, a));
+static_assert(test(std::ranges::minmax, a));
+static_assert(test(std::ranges::minmax_element, a));
 static_assert(test(std::ranges::mismatch, a, a));
 //static_assert(test(std::ranges::move, a, a));
 //static_assert(test(std::ranges::move_backward, a, a));