LeetCode Solutions/Problem Group 1 (Team Chemistry) - Revision history

Vishwa: /* Leetcode 2491. Divide Players Into Teams of Equal Skill */

2025-06-04T19:52:45Z

Leetcode 2491. Divide Players Into Teams of Equal Skill

Vishwa: /* Leetcode 2491. Divide Players Into Teams of Equal Skill */

2025-06-04T19:52:06Z

Leetcode 2491. Divide Players Into Teams of Equal Skill

Vishwa: /* Leetcode 2491. Divide Players Into Teams of Equal Skill */

2025-06-04T19:51:31Z

Leetcode 2491. Divide Players Into Teams of Equal Skill

Joseph: /* Leetcode 2491. Divide Players Into Teams of Equal Skill */

2025-06-04T05:48:01Z

Leetcode 2491. Divide Players Into Teams of Equal Skill

Vishwa: /* Leetcode 2491. Divide Players Into Teams of Equal Skill */

2025-06-03T23:38:10Z

Leetcode 2491. Divide Players Into Teams of Equal Skill

Vishwa: /* ZCUBES Format */

2025-06-03T23:35:02Z

ZCUBES Format

Vishwa: Created page with "== LeetCode Problem 1 – Team Chemistry == === ZCUBES Format ===

 skill = [3,4]; p = skill.⋰.⁜(2); arr = p[0].mergerows(p[1].reverse()); tar = ∑(arr[0]);  if(arr...."

2025-06-03T23:30:48Z

Created page with "== LeetCode Problem 1 – Team Chemistry == === ZCUBES Format === <pre> skill = [3,4]; p = skill.⋰.⁜(2); arr = p[0].mergerows(p[1].reverse()); tar = ∑(arr[0]); if(arr...."

New page

== LeetCode Problem 1 – Team Chemistry ==

=== ZCUBES Format ===
<pre>
skill = [3,4];
p = skill.⋰.⁜(2);
arr = p[0].mergerows(p[1].reverse());
tar = ∑(arr[0]);

if(arr.filter(r => ≠(∑(r), tar)).length > 0)
{
result = "Not compatible(-1)";
}
else{
result = ∑(arr.$$(✖))
}

PRINT(result);
</pre>

=== JavaScript Format ===
<pre>
var dividePlayers = function(skill) {
function find_nums(val, arr, target) {
for (let i = 0; i < arr.length; i++) {
if (val + arr[i] === target) {
return [val, arr[i]];
}
}
return null;
}

let sorted_arr = skill.sort((a, b) => b - a);
let tar = sorted_arr[0] + sorted_arr[sorted_arr.length - 1];
let total_chemistry = 0;

for (let i = 0; i < sorted_arr.length - 1; i++) {
if (i >= sorted_arr.length) {
break;
}

let pair = find_nums(sorted_arr[i], sorted_arr.slice(i + 1), tar);

if (pair) {
total_chemistry += pair[0] * pair[1];
let index1 = sorted_arr.indexOf(pair[0]);
if (index1 !== -1) sorted_arr.splice(index1, 1);
let index2 = sorted_arr.indexOf(pair[1]);
if (index2 !== -1) sorted_arr.splice(index2, 1);
i--;
} else {
return -1;
}
}

return total_chemistry;
};
</pre>

@@ Line 61: / Line 61: @@
 </pre>
 '''See more:'''
-* [https://wiki.zcubes.com/Neet_Code_Problems Neetcode Problems] to learn more about Jquery in Z^3 Code Editor.
+* [https://wiki.zcubes.com/Neet_Code_Problems Neetcode Problems] to see more leetcode style problems being solved.

@@ Line 61: / Line 61: @@
 </pre>
 '''See more:'''
-* [https://wiki.zcubes.com/Neet_Code_Problems] to learn more about Jquery in Z^3 Code Editor.
+* [https://wiki.zcubes.com/Neet_Code_Problems Neetcode Problems] to learn more about Jquery in Z^3 Code Editor.

← Older revision		Revision as of 19:51, 4 June 2025
Line 60:		Line 60:
	};		};
	</pre>		</pre>
		+	'''See more:'''
		+	* [https://wiki.zcubes.com/Neet_Code_Problems] to learn more about Jquery in Z^3 Code Editor.

@@ Line 1: / Line 1: @@
 == Leetcode 2491. Divide Players Into Teams of Equal Skill ==
-=== ZCUBES Format ===
+=== In z^3 ===
 <pre>
 skill = [3,4];
@@ Line 22: / Line 22: @@
 The attached file has .⋰.⁜ for sort and parts respectively and sigma symbol for sum and finally ≠ for not equal to. Also X symbol for product(zmultiply).
-=== JavaScript Format ===
+=== In JavaScript ===
 <pre>
 var dividePlayers = function(skill) {

← Older revision		Revision as of 23:38, 3 June 2025
Line 1:		Line 1:
−	== ~~LeetCode Problem 1 – Team Chemistry~~ ==	+	== Leetcode 2491. Divide Players Into Teams of Equal Skill ==

	=== ZCUBES Format ===		=== ZCUBES Format ===

@@ Line 18: / Line 18: @@
 PRINT(result);
 </pre>
 === JavaScript Format ===