Divide Players Into Teams of Equal Skill | Leetcode 2491

This video explains how to divide players into teams of equal skill using greedy sorting approach and hashmap optimal approach.
----------------------------------------------------------------------------------------------------------------------------------------------------------------
🟣 JOIN our 𝐋𝐈𝐕𝐄 𝐢𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 𝐭𝐫𝐚𝐢𝐧𝐢𝐧𝐠 𝐩𝐫𝐨𝐠𝐫𝐚𝐦 through whatsapp query: [phone]
🟣 𝐂𝐡𝐞𝐜𝐤𝐨𝐮𝐭 𝐚𝐥𝐥 𝐨𝐮𝐫 𝐂𝐨𝐮𝐫𝐬𝐞𝐬: techdose.co.in/
🔵 LinkedIn: / surya-pratap-kahar
🔴 INSTAGRAM: / techdose_official
🟢 𝐓𝐞𝐜𝐡𝐝𝐨𝐬𝐞-𝟏𝟎𝟎 𝐬𝐡𝐞𝐞𝐭: docs.google.co...
---------------------------------------------------------------------------------------------------------------------------------------------------------------
𝐂𝐎𝐃𝐄 𝐋𝐈𝐍𝐊: gist.github.co...

[@Grishma_Gedela]

Explained very clearly.... please continue

[@techdose4u]

sure

[@hardikkumar6575]

Or you can just sort the array and run a 2 pointer from beginning and end and checking if the sum is equal to the sum of first and last element (or any other pair such that the elements corresponds from beginning and end) and whenever it is not true the answer won't exist, so just return -1. At first I thought it was too easy and ran the code and it got accepted 😂

[@techdose4u]

Nice

[@sailendrachettri8521]

Oct Day 4 complected :)

[@techdose4u]

Nice

[@gargsharadkumar]

Equal sum subsets

[@techdose4u]

not exactly :)

[@gargsharadkumar]

@@techdose4u agree with you sir. It is an intuition and can be used to solve this problem.