Difference between revisions of "User:Vishwa"

Revision as of 17:30, 3 June 2025

LeetCode Solutions

This page links to grouped LeetCode problems.

@@ Line 1: / Line 1: @@
-<span style="font-size: larger;">Leetcode Solutions and Render3D/RENDER examples.</span>
+== LeetCode Solutions ==
+This page links to grouped LeetCode problems.
-=== LeetCode 1109 (using Zcubes keytags)===
+* [[LeetCode Solutions/Problem Group 1 (Team Chemistry)]]
-<pre>
+* [[LeetCode Solutions/Problem Group 2 (Flight Bookings)]]
-bookings = [[1,2,10],[2,3,20],[2,5,25]];
-n = 5;
-ro = {};
-f = (x, y) => ro[x] = SUM(ro[x] || 0, y);
-f#;
-bookings.map(r => f((r[0])..(r[1]), r[2]));
-PRINT(ro);
-KEYTAGS(ro).map(r => [r[0], r[1]]);
-</pre>
-=== LeetCode 1109 (Javascript)===
-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;
-};

Difference between revisions of "User:Vishwa"

Revision as of 17:30, 3 June 2025

LeetCode Solutions

Navigation menu

Search