---
title: "Discussion on \"Leetcode Problem\" | Hashnode"
description: "Discussion on \"Leetcode Problem\". 2708. Maximum Strength of a Group\nYou are given a 0-indexed integer array nums representing the score of students in an exam. The teacher would like to form one non-empty group of students with maximal strength, where the strength of a group of stude..."
url: "https://hashnode.com/posts/leetcode-problem-1/647477ee25673ccc666ca693"
---

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

Discussion

# [Leetcode Problem](https://pushpdeep.hashnode.dev/leetcode-problem-1?utm_source=hashnode&utm_medium=feed)

2708\. Maximum Strength of a Group You are given a 0-indexed integer array nums representing the score of students in an exam. The teacher would like to form one non-empty group of students with maximal strength, where the strength of a group of stude...

May 29, 2023 · 1 min read · pushpdeep.hashnode.dev  
Read the article

## Written by

[Pushpdeep singh](https://hashnode.com/@pushpdeep)

@pushpdeep

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

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
