---
title: "Discussion on \"Assignment DSA\" | Hashnode"
description: "Discussion on \"Assignment DSA\". <aside> 💡 Given an integer array nums of 2n integers, group these integers into n pairs (a1, b1), (a2, b2),..., (an, bn) such that the sum of min(ai, bi) for all i is maximized. Return the maximized sum.\nExample 1: Input: nums = [1,4,3,2] Output: 4\n..."
url: "https://hashnode.com/posts/assignment-dsa/64ae9dcea7e601aa944691bc"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Assignment DSA](https://fullstackwebdevelopbyafroj.hashnode.dev/assignment-dsa?utm_source=hashnode&utm_medium=feed)

<aside> 💡 Given an integer array nums of 2n integers, group these integers into n pairs (a1, b1), (a2, b2),..., (an, bn) such that the sum of min(ai, bi) for all i is maximized. Return the maximized sum. Example 1: Input: nums = \[1,4,3,2\] Output: 4 ...

Jul 12, 2023 · 3 min read · fullstackwebdevelopbyafroj.hashnode.dev  
Read the article

-   [#dsa](https://hashnode.com/tag/dsa)
-   [#java](https://hashnode.com/tag/java)

## Written by

[Afroj Mansoori](https://hashnode.com/@afroj07)

@afroj07

  
[View profile](https://hashnode.com/@afroj07)

write all about to web development and programming

## Responses

Markdown supported · ⌘↵ to post

No responses yet.