zcw-shared 1.21.0 → 1.22.0

package/dist/functions/algorithm/maxProfit.js

@@ -0,0 +1,23 @@
+export function maxProfit(prices) {
+    if (prices.length <= 1)
+        return 0;
+    let profit = 0;
+    for (let i = 1; i < prices.length; i++) {
+        if (prices[i] > prices[i - 1]) {
+            profit += prices[i] - prices[i - 1];
+        }
+    }
+    return profit;
+}
+export function maxProfitOnce(prices) {
+    if (prices.length <= 1)
+        return 0;
+    let minPrice = prices[0];
+    let maxProfit = 0;
+    for (let i = 1; i < prices.length; i++) {
+        maxProfit = Math.max(maxProfit, prices[i] - minPrice);
+        minPrice = Math.min(minPrice, prices[i]);
+    }
+    return maxProfit;
+}
+//# sourceMappingURL=maxProfit.js.map

package/dist/functions/algorithm/maxProfit.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"maxProfit.js","sourceRoot":"","sources":["../../../src/functions/algorithm/maxProfit.ts"],"names":[],"mappings":"AAkBA,MAAM,UAAU,SAAS,CAAC,MAAgB;IACxC,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,CAAC,CAAA;IAEhC,IAAI,MAAM,GAAG,CAAC,CAAA;IAGd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAC9B,MAAM,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACrC,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC;AAKD,MAAM,UAAU,aAAa,CAAC,MAAgB;IAC5C,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,CAAC,CAAA;IAEhC,IAAI,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;IACxB,IAAI,SAAS,GAAG,CAAC,CAAA;IAEjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAA;QACrD,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;IAC1C,CAAC;IAED,OAAO,SAAS,CAAA;AAClB,CAAC"}

package/dist/functions/algorithm/meetingRooms.d.ts

@@ -0,0 +1,6 @@
+export interface Interval {
+    start: number;
+    end: number;
+}
+export declare function canAttendMeetings(intervals: Interval[]): boolean;
+export declare function minMeetingRooms(intervals: Interval[]): number;

package/dist/functions/algorithm/meetingRooms.js

@@ -0,0 +1,31 @@
+export function canAttendMeetings(intervals) {
+    if (intervals.length <= 1)
+        return true;
+    intervals.sort((a, b) => a.start - b.start);
+    for (let i = 1; i < intervals.length; i++) {
+        if (intervals[i].start < intervals[i - 1].end) {
+            return false;
+        }
+    }
+    return true;
+}
+export function minMeetingRooms(intervals) {
+    if (intervals.length === 0)
+        return 0;
+    const starts = intervals.map(i => i.start).sort((a, b) => a - b);
+    const ends = intervals.map(i => i.end).sort((a, b) => a - b);
+    let rooms = 0;
+    let maxRooms = 0;
+    let endPtr = 0;
+    for (let i = 0; i < starts.length; i++) {
+        if (starts[i] < ends[endPtr]) {
+            rooms++;
+            maxRooms = Math.max(maxRooms, rooms);
+        }
+        else {
+            endPtr++;
+        }
+    }
+    return maxRooms;
+}
+//# sourceMappingURL=meetingRooms.js.map

package/dist/functions/algorithm/meetingRooms.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"meetingRooms.js","sourceRoot":"","sources":["../../../src/functions/algorithm/meetingRooms.ts"],"names":[],"mappings":"AAyBA,MAAM,UAAU,iBAAiB,CAAC,SAAqB;IACrD,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,IAAI,CAAA;IAGtC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAA;IAG3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YAC9C,OAAO,KAAK,CAAA;QACd,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAA;AACb,CAAC;AAYD,MAAM,UAAU,eAAe,CAAC,SAAqB;IACnD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAA;IAGpC,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAChE,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAE5D,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,IAAI,QAAQ,GAAG,CAAC,CAAA;IAChB,IAAI,MAAM,GAAG,CAAC,CAAA;IAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAEvC,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAC7B,KAAK,EAAE,CAAA;YACP,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;QACtC,CAAC;aAAM,CAAC;YAEN,MAAM,EAAE,CAAA;QACV,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAA;AACjB,CAAC"}

package/dist/functions/algorithm/mergeSort.d.ts

@@ -0,0 +1,2 @@
+export declare function mergeSort(arr: number[]): number[];
+export declare function mergeSortInPlace(arr: number[]): number[];

package/dist/functions/algorithm/mergeSort.js

@@ -0,0 +1,72 @@
+export function mergeSort(arr) {
+    if (arr.length <= 1)
+        return arr;
+    const mid = Math.floor(arr.length / 2);
+    const left = mergeSort(arr.slice(0, mid));
+    const right = mergeSort(arr.slice(mid));
+    return merge(left, right);
+}
+function merge(left, right) {
+    const result = [];
+    let i = 0;
+    let j = 0;
+    while (i < left.length && j < right.length) {
+        if (left[i] <= right[j]) {
+            result.push(left[i]);
+            i++;
+        }
+        else {
+            result.push(right[j]);
+            j++;
+        }
+    }
+    while (i < left.length) {
+        result.push(left[i]);
+        i++;
+    }
+    while (j < right.length) {
+        result.push(right[j]);
+        j++;
+    }
+    return result;
+}
+export function mergeSortInPlace(arr) {
+    const result = [...arr];
+    mergeSortHelper(result, 0, result.length - 1);
+    return result;
+}
+function mergeSortHelper(arr, left, right) {
+    if (left >= right)
+        return;
+    const mid = Math.floor((left + right) / 2);
+    mergeSortHelper(arr, left, mid);
+    mergeSortHelper(arr, mid + 1, right);
+    mergeInPlace(arr, left, mid, right);
+}
+function mergeInPlace(arr, left, mid, right) {
+    const temp = [];
+    let i = left;
+    let j = mid + 1;
+    while (i <= mid && j <= right) {
+        if (arr[i] <= arr[j]) {
+            temp.push(arr[i]);
+            i++;
+        }
+        else {
+            temp.push(arr[j]);
+            j++;
+        }
+    }
+    while (i <= mid) {
+        temp.push(arr[i]);
+        i++;
+    }
+    while (j <= right) {
+        temp.push(arr[j]);
+        j++;
+    }
+    for (let k = 0; k < temp.length; k++) {
+        arr[left + k] = temp[k];
+    }
+}
+//# sourceMappingURL=mergeSort.js.map

package/dist/functions/algorithm/mergeSort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mergeSort.js","sourceRoot":"","sources":["../../../src/functions/algorithm/mergeSort.ts"],"names":[],"mappings":"AAkBA,MAAM,UAAU,SAAS,CAAC,GAAa;IACrC,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,GAAG,CAAA;IAG/B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IACtC,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;IACzC,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAA;IAGvC,OAAO,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;AAC3B,CAAC;AAKD,SAAS,KAAK,CAAC,IAAc,EAAE,KAAe;IAC5C,MAAM,MAAM,GAAa,EAAE,CAAA;IAC3B,IAAI,CAAC,GAAG,CAAC,CAAA;IACT,IAAI,CAAC,GAAG,CAAC,CAAA;IAET,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC3C,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;YACpB,CAAC,EAAE,CAAA;QACL,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;YACrB,CAAC,EAAE,CAAA;QACL,CAAC;IACH,CAAC;IAGD,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACvB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;QACpB,CAAC,EAAE,CAAA;IACL,CAAC;IAED,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACxB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;QACrB,CAAC,EAAE,CAAA;IACL,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC;AAKD,MAAM,UAAU,gBAAgB,CAAC,GAAa;IAC5C,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,CAAC,CAAA;IACvB,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IAC7C,OAAO,MAAM,CAAA;AACf,CAAC;AAED,SAAS,eAAe,CAAC,GAAa,EAAE,IAAY,EAAE,KAAa;IACjE,IAAI,IAAI,IAAI,KAAK;QAAE,OAAM;IAEzB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAA;IAC1C,eAAe,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,CAAA;IAC/B,eAAe,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,EAAE,KAAK,CAAC,CAAA;IACpC,YAAY,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;AACrC,CAAC;AAED,SAAS,YAAY,CAAC,GAAa,EAAE,IAAY,EAAE,GAAW,EAAE,KAAa;IAC3E,MAAM,IAAI,GAAa,EAAE,CAAA;IACzB,IAAI,CAAC,GAAG,IAAI,CAAA;IACZ,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,CAAA;IAEf,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;QAC9B,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YACjB,CAAC,EAAE,CAAA;QACL,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YACjB,CAAC,EAAE,CAAA;QACL,CAAC;IACH,CAAC;IAED,OAAO,CAAC,IAAI,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACjB,CAAC,EAAE,CAAA;IACL,CAAC;IAED,OAAO,CAAC,IAAI,KAAK,EAAE,CAAC;QAClB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACjB,CAAC,EAAE,CAAA;IACL,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;IACzB,CAAC;AACH,CAAC"}

package/dist/functions/algorithm/minPathSum.d.ts

@@ -0,0 +1,2 @@
+export declare function minPathSum(grid: number[][]): number;
+export declare function minPathSumOptimized(grid: number[][]): number;

package/dist/functions/algorithm/minPathSum.js

@@ -0,0 +1,39 @@
+export function minPathSum(grid) {
+    if (grid.length === 0 || grid[0].length === 0)
+        return 0;
+    const m = grid.length;
+    const n = grid[0].length;
+    const dp = Array.from({ length: m }, () => Array(n).fill(0));
+    dp[0][0] = grid[0][0];
+    for (let j = 1; j < n; j++) {
+        dp[0][j] = dp[0][j - 1] + grid[0][j];
+    }
+    for (let i = 1; i < m; i++) {
+        dp[i][0] = dp[i - 1][0] + grid[i][0];
+    }
+    for (let i = 1; i < m; i++) {
+        for (let j = 1; j < n; j++) {
+            dp[i][j] = Math.min(dp[i - 1][j], dp[i][j - 1]) + grid[i][j];
+        }
+    }
+    return dp[m - 1][n - 1];
+}
+export function minPathSumOptimized(grid) {
+    if (grid.length === 0 || grid[0].length === 0)
+        return 0;
+    const m = grid.length;
+    const n = grid[0].length;
+    const dp = Array(n).fill(0);
+    dp[0] = grid[0][0];
+    for (let j = 1; j < n; j++) {
+        dp[j] = dp[j - 1] + grid[0][j];
+    }
+    for (let i = 1; i < m; i++) {
+        dp[0] += grid[i][0];
+        for (let j = 1; j < n; j++) {
+            dp[j] = Math.min(dp[j], dp[j - 1]) + grid[i][j];
+        }
+    }
+    return dp[n - 1];
+}
+//# sourceMappingURL=minPathSum.js.map

package/dist/functions/algorithm/minPathSum.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"minPathSum.js","sourceRoot":"","sources":["../../../src/functions/algorithm/minPathSum.ts"],"names":[],"mappings":"AAuBA,MAAM,UAAU,UAAU,CAAC,IAAgB;IACzC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAA;IAEvD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;IACrB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;IAGxB,MAAM,EAAE,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IAGxE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAGrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACtC,CAAC;IAGD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACtC,CAAC;IAGD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC9D,CAAC;IACH,CAAC;IAED,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;AACzB,CAAC;AAKD,MAAM,UAAU,mBAAmB,CAAC,IAAgB;IAClD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAA;IAEvD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;IACrB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;IACxB,MAAM,EAAE,GAAa,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IAGrC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAChC,CAAC;IAGD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACjD,CAAC;IACH,CAAC;IAED,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;AAClB,CAAC"}

package/dist/functions/algorithm/minWindow.d.ts

@@ -0,0 +1 @@
+export declare function minWindow(s: string, t: string): string;

package/dist/functions/algorithm/minWindow.js

@@ -0,0 +1,40 @@
+export function minWindow(s, t) {
+    if (s.length === 0 || t.length === 0)
+        return '';
+    const need = new Map();
+    for (const char of t) {
+        need.set(char, (need.get(char) || 0) + 1);
+    }
+    const window = new Map();
+    let left = 0;
+    let right = 0;
+    let valid = 0;
+    let minLen = Infinity;
+    let minStart = 0;
+    while (right < s.length) {
+        const charR = s[right];
+        right++;
+        if (need.has(charR)) {
+            window.set(charR, (window.get(charR) || 0) + 1);
+            if (window.get(charR) === need.get(charR)) {
+                valid++;
+            }
+        }
+        while (valid === need.size) {
+            if (right - left < minLen) {
+                minLen = right - left;
+                minStart = left;
+            }
+            const charL = s[left];
+            left++;
+            if (need.has(charL)) {
+                if (window.get(charL) === need.get(charL)) {
+                    valid--;
+                }
+                window.set(charL, window.get(charL) - 1);
+            }
+        }
+    }
+    return minLen === Infinity ? '' : s.substring(minStart, minStart + minLen);
+}
+//# sourceMappingURL=minWindow.js.map

package/dist/functions/algorithm/minWindow.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"minWindow.js","sourceRoot":"","sources":["../../../src/functions/algorithm/minWindow.ts"],"names":[],"mappings":"AAkBA,MAAM,UAAU,SAAS,CAAC,CAAS,EAAE,CAAS;IAC5C,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAA;IAG/C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAA;IACtC,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;QACrB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAC3C,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAA;IACxC,IAAI,IAAI,GAAG,CAAC,CAAA;IACZ,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,IAAI,KAAK,GAAG,CAAC,CAAA;IAEb,IAAI,MAAM,GAAG,QAAQ,CAAA;IACrB,IAAI,QAAQ,GAAG,CAAC,CAAA;IAEhB,OAAO,KAAK,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;QAExB,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAA;QACtB,KAAK,EAAE,CAAA;QAEP,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YAC/C,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC1C,KAAK,EAAE,CAAA;YACT,CAAC;QACH,CAAC;QAGD,OAAO,KAAK,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;YAE3B,IAAI,KAAK,GAAG,IAAI,GAAG,MAAM,EAAE,CAAC;gBAC1B,MAAM,GAAG,KAAK,GAAG,IAAI,CAAA;gBACrB,QAAQ,GAAG,IAAI,CAAA;YACjB,CAAC;YAED,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAA;YACrB,IAAI,EAAE,CAAA;YAEN,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpB,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC1C,KAAK,EAAE,CAAA;gBACT,CAAC;gBACD,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAE,GAAG,CAAC,CAAC,CAAA;YAC3C,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,GAAG,MAAM,CAAC,CAAA;AAC5E,CAAC"}

package/dist/functions/algorithm/nQueens.d.ts

@@ -0,0 +1 @@
+export declare function solveNQueens(n: number): string[][];

package/dist/functions/algorithm/nQueens.js

@@ -0,0 +1,30 @@
+export function solveNQueens(n) {
+    const result = [];
+    const board = Array.from({ length: n }, () => Array(n).fill('.'));
+    const cols = new Set();
+    const diag1 = new Set();
+    const diag2 = new Set();
+    function backtrack(row) {
+        if (row === n) {
+            result.push(board.map(r => r.join('')));
+            return;
+        }
+        for (let col = 0; col < n; col++) {
+            if (cols.has(col) || diag1.has(row - col) || diag2.has(row + col)) {
+                continue;
+            }
+            board[row][col] = 'Q';
+            cols.add(col);
+            diag1.add(row - col);
+            diag2.add(row + col);
+            backtrack(row + 1);
+            board[row][col] = '.';
+            cols.delete(col);
+            diag1.delete(row - col);
+            diag2.delete(row + col);
+        }
+    }
+    backtrack(0);
+    return result;
+}
+//# sourceMappingURL=nQueens.js.map

package/dist/functions/algorithm/nQueens.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nQueens.js","sourceRoot":"","sources":["../../../src/functions/algorithm/nQueens.ts"],"names":[],"mappings":"AAqBA,MAAM,UAAU,YAAY,CAAC,CAAS;IACpC,MAAM,MAAM,GAAe,EAAE,CAAA;IAC7B,MAAM,KAAK,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAA;IAG7E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAE9B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;IAE/B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;IAE/B,SAAS,SAAS,CAAC,GAAW;QAE5B,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;YACd,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;YACvC,OAAM;QACR,CAAC;QAGD,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YAEjC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC;gBAClE,SAAQ;YACV,CAAC;YAGD,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAA;YACrB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YACb,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAA;YACpB,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAA;YAGpB,SAAS,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;YAGlB,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAA;YACrB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YAChB,KAAK,CAAC,MAAM,CAAC,GAAG,GAAG,GAAG,CAAC,CAAA;YACvB,KAAK,CAAC,MAAM,CAAC,GAAG,GAAG,GAAG,CAAC,CAAA;QACzB,CAAC;IACH,CAAC;IAED,SAAS,CAAC,CAAC,CAAC,CAAA;IACZ,OAAO,MAAM,CAAA;AACf,CAAC"}

package/dist/functions/algorithm/numIslands.d.ts

@@ -0,0 +1,2 @@
+export declare function numIslands(grid: string[][]): number;
+export declare function numIslandsBFS(grid: string[][]): number;

package/dist/functions/algorithm/numIslands.js

@@ -0,0 +1,59 @@
+export function numIslands(grid) {
+    if (grid.length === 0 || grid[0].length === 0)
+        return 0;
+    const m = grid.length;
+    const n = grid[0].length;
+    let count = 0;
+    function dfs(i, j) {
+        if (i < 0 || i >= m || j < 0 || j >= n || grid[i][j] === '0') {
+            return;
+        }
+        grid[i][j] = '0';
+        dfs(i + 1, j);
+        dfs(i - 1, j);
+        dfs(i, j + 1);
+        dfs(i, j - 1);
+    }
+    for (let i = 0; i < m; i++) {
+        for (let j = 0; j < n; j++) {
+            if (grid[i][j] === '1') {
+                count++;
+                dfs(i, j);
+            }
+        }
+    }
+    return count;
+}
+export function numIslandsBFS(grid) {
+    if (grid.length === 0 || grid[0].length === 0)
+        return 0;
+    const m = grid.length;
+    const n = grid[0].length;
+    let count = 0;
+    const directions = [[0, 1], [0, -1], [1, 0], [-1, 0]];
+    function bfs(startI, startJ) {
+        const queue = [[startI, startJ]];
+        grid[startI][startJ] = '0';
+        while (queue.length > 0) {
+            const [i, j] = queue.shift();
+            for (const [di, dj] of directions) {
+                const ni = i + di;
+                const nj = j + dj;
+                if (ni >= 0 && ni < m && nj >= 0 && nj < n && grid[ni][nj] === '1') {
+                    grid[ni][nj] = '0';
+                    queue.push([ni, nj]);
+                }
+            }
+        }
+    }
+    for (let i = 0; i < m; i++) {
+        for (let j = 0; j < n; j++) {
+            if (grid[i][j] === '1') {
+                count++;
+                bfs(i, j);
+            }
+        }
+    }
+    return count;
+}
+//# sourceMappingURL=numIslands.js.map

package/dist/functions/algorithm/numIslands.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"numIslands.js","sourceRoot":"","sources":["../../../src/functions/algorithm/numIslands.ts"],"names":[],"mappings":"AAuBA,MAAM,UAAU,UAAU,CAAC,IAAgB;IACzC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAA;IAEvD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;IACrB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;IACxB,IAAI,KAAK,GAAG,CAAC,CAAA;IAEb,SAAS,GAAG,CAAC,CAAS,EAAE,CAAS;QAE/B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YAC7D,OAAM;QACR,CAAC;QAGD,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAA;QAGhB,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAA;QACb,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAA;QACb,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAA;QACb,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAA;IACf,CAAC;IAGD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;gBACvB,KAAK,EAAE,CAAA;gBACP,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACX,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAKD,MAAM,UAAU,aAAa,CAAC,IAAgB;IAC5C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAA;IAEvD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;IACrB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;IACxB,IAAI,KAAK,GAAG,CAAC,CAAA;IAEb,MAAM,UAAU,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IAErD,SAAS,GAAG,CAAC,MAAc,EAAE,MAAc;QACzC,MAAM,KAAK,GAAuB,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;QACpD,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,GAAG,GAAG,CAAA;QAE1B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;YAE7B,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC;gBAClC,MAAM,EAAE,GAAG,CAAC,GAAG,EAAE,CAAA;gBACjB,MAAM,EAAE,GAAG,CAAC,GAAG,EAAE,CAAA;gBAEjB,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC;oBACnE,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAA;oBAClB,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;gBACtB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;gBACvB,KAAK,EAAE,CAAA;gBACP,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACX,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC"}

package/dist/functions/algorithm/permutations.d.ts

@@ -0,0 +1 @@
+export declare function permutations(nums: number[]): number[][];

package/dist/functions/algorithm/permutations.js

@@ -0,0 +1,22 @@
+export function permutations(nums) {
+    const result = [];
+    const used = Array(nums.length).fill(false);
+    function backtrack(path) {
+        if (path.length === nums.length) {
+            result.push([...path]);
+            return;
+        }
+        for (let i = 0; i < nums.length; i++) {
+            if (used[i])
+                continue;
+            path.push(nums[i]);
+            used[i] = true;
+            backtrack(path);
+            path.pop();
+            used[i] = false;
+        }
+    }
+    backtrack([]);
+    return result;
+}
+//# sourceMappingURL=permutations.js.map

package/dist/functions/algorithm/permutations.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"permutations.js","sourceRoot":"","sources":["../../../src/functions/algorithm/permutations.ts"],"names":[],"mappings":"AAgBA,MAAM,UAAU,YAAY,CAAC,IAAc;IACzC,MAAM,MAAM,GAAe,EAAE,CAAA;IAC7B,MAAM,IAAI,GAAc,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IAEtD,SAAS,SAAS,CAAC,IAAc;QAE/B,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;YACtB,OAAM;QACR,CAAC;QAGD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAErC,IAAI,IAAI,CAAC,CAAC,CAAC;gBAAE,SAAQ;YAGrB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;YAClB,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;YAGd,SAAS,CAAC,IAAI,CAAC,CAAA;YAGf,IAAI,CAAC,GAAG,EAAE,CAAA;YACV,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAA;QACjB,CAAC;IACH,CAAC;IAED,SAAS,CAAC,EAAE,CAAC,CAAA;IACb,OAAO,MAAM,CAAA;AACf,CAAC"}

package/dist/functions/algorithm/quickSort.d.ts

@@ -0,0 +1,3 @@
+export declare function quickSort(arr: number[]): number[];
+export declare function quickSort3Way(arr: number[]): number[];
+export declare function quickSortRandomized(arr: number[]): number[];

package/dist/functions/algorithm/quickSort.js

@@ -0,0 +1,68 @@
+export function quickSort(arr) {
+    const result = [...arr];
+    quickSortHelper(result, 0, result.length - 1);
+    return result;
+}
+function quickSortHelper(arr, left, right) {
+    if (left >= right)
+        return;
+    const pivotIndex = partition(arr, left, right);
+    quickSortHelper(arr, left, pivotIndex - 1);
+    quickSortHelper(arr, pivotIndex + 1, right);
+}
+function partition(arr, left, right) {
+    const pivot = arr[right];
+    let i = left - 1;
+    for (let j = left; j < right; j++) {
+        if (arr[j] <= pivot) {
+            i++;
+            [arr[i], arr[j]] = [arr[j], arr[i]];
+        }
+    }
+    [arr[i + 1], arr[right]] = [arr[right], arr[i + 1]];
+    return i + 1;
+}
+export function quickSort3Way(arr) {
+    const result = [...arr];
+    quickSort3WayHelper(result, 0, result.length - 1);
+    return result;
+}
+function quickSort3WayHelper(arr, left, right) {
+    if (left >= right)
+        return;
+    const pivot = arr[left];
+    let lt = left;
+    let gt = right;
+    let i = left + 1;
+    while (i <= gt) {
+        if (arr[i] < pivot) {
+            [arr[lt], arr[i]] = [arr[i], arr[lt]];
+            lt++;
+            i++;
+        }
+        else if (arr[i] > pivot) {
+            [arr[i], arr[gt]] = [arr[gt], arr[i]];
+            gt--;
+        }
+        else {
+            i++;
+        }
+    }
+    quickSort3WayHelper(arr, left, lt - 1);
+    quickSort3WayHelper(arr, gt + 1, right);
+}
+export function quickSortRandomized(arr) {
+    const result = [...arr];
+    quickSortRandomizedHelper(result, 0, result.length - 1);
+    return result;
+}
+function quickSortRandomizedHelper(arr, left, right) {
+    if (left >= right)
+        return;
+    const randomIndex = left + Math.floor(Math.random() * (right - left + 1));
+    [arr[randomIndex], arr[right]] = [arr[right], arr[randomIndex]];
+    const pivotIndex = partition(arr, left, right);
+    quickSortRandomizedHelper(arr, left, pivotIndex - 1);
+    quickSortRandomizedHelper(arr, pivotIndex + 1, right);
+}
+//# sourceMappingURL=quickSort.js.map

package/dist/functions/algorithm/quickSort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"quickSort.js","sourceRoot":"","sources":["../../../src/functions/algorithm/quickSort.ts"],"names":[],"mappings":"AAkBA,MAAM,UAAU,SAAS,CAAC,GAAa;IACrC,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,CAAC,CAAA;IACvB,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IAC7C,OAAO,MAAM,CAAA;AACf,CAAC;AAED,SAAS,eAAe,CAAC,GAAa,EAAE,IAAY,EAAE,KAAa;IACjE,IAAI,IAAI,IAAI,KAAK;QAAE,OAAM;IAEzB,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;IAC9C,eAAe,CAAC,GAAG,EAAE,IAAI,EAAE,UAAU,GAAG,CAAC,CAAC,CAAA;IAC1C,eAAe,CAAC,GAAG,EAAE,UAAU,GAAG,CAAC,EAAE,KAAK,CAAC,CAAA;AAC7C,CAAC;AAKD,SAAS,SAAS,CAAC,GAAa,EAAE,IAAY,EAAE,KAAa;IAC3D,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAA;IACxB,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,CAAA;IAEhB,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;YACpB,CAAC,EAAE,CAAA;YACH,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACrC,CAAC;IACH,CAAC;IAED,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACnD,OAAO,CAAC,GAAG,CAAC,CAAA;AACd,CAAC;AAKD,MAAM,UAAU,aAAa,CAAC,GAAa;IACzC,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,CAAC,CAAA;IACvB,mBAAmB,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IACjD,OAAO,MAAM,CAAA;AACf,CAAC;AAED,SAAS,mBAAmB,CAAC,GAAa,EAAE,IAAY,EAAE,KAAa;IACrE,IAAI,IAAI,IAAI,KAAK;QAAE,OAAM;IAEzB,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,CAAA;IACvB,IAAI,EAAE,GAAG,IAAI,CAAA;IACb,IAAI,EAAE,GAAG,KAAK,CAAA;IACd,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,CAAA;IAEhB,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;QACf,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC;YACnB,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAA;YACrC,EAAE,EAAE,CAAA;YACJ,CAAC,EAAE,CAAA;QACL,CAAC;aAAM,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC;YAC1B,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YACrC,EAAE,EAAE,CAAA;QACN,CAAC;aAAM,CAAC;YACN,CAAC,EAAE,CAAA;QACL,CAAC;IACH,CAAC;IAED,mBAAmB,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC,CAAA;IACtC,mBAAmB,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,EAAE,KAAK,CAAC,CAAA;AACzC,CAAC;AAKD,MAAM,UAAU,mBAAmB,CAAC,GAAa;IAC/C,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,CAAC,CAAA;IACvB,yBAAyB,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IACvD,OAAO,MAAM,CAAA;AACf,CAAC;AAED,SAAS,yBAAyB,CAAC,GAAa,EAAE,IAAY,EAAE,KAAa;IAC3E,IAAI,IAAI,IAAI,KAAK;QAAE,OAAM;IAGzB,MAAM,WAAW,GAAG,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CACxE;IAAA,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,WAAW,CAAC,CAAC,CAAA;IAEhE,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;IAC9C,yBAAyB,CAAC,GAAG,EAAE,IAAI,EAAE,UAAU,GAAG,CAAC,CAAC,CAAA;IACpD,yBAAyB,CAAC,GAAG,EAAE,UAAU,GAAG,CAAC,EAAE,KAAK,CAAC,CAAA;AACvD,CAAC"}

package/dist/functions/algorithm/rabinKarp.d.ts

@@ -0,0 +1 @@
+export declare function rabinKarp(text: string, pattern: string): number[];

package/dist/functions/algorithm/rabinKarp.js

@@ -0,0 +1,40 @@
+export function rabinKarp(text, pattern) {
+    if (pattern.length === 0 || pattern.length > text.length)
+        return [];
+    const result = [];
+    const base = 256;
+    const prime = 101;
+    const m = pattern.length;
+    const n = text.length;
+    let patternHash = 0;
+    let textHash = 0;
+    let h = 1;
+    for (let i = 0; i < m - 1; i++) {
+        h = (h * base) % prime;
+    }
+    for (let i = 0; i < m; i++) {
+        patternHash = (base * patternHash + pattern.charCodeAt(i)) % prime;
+        textHash = (base * textHash + text.charCodeAt(i)) % prime;
+    }
+    for (let i = 0; i <= n - m; i++) {
+        if (patternHash === textHash) {
+            let match = true;
+            for (let j = 0; j < m; j++) {
+                if (text[i + j] !== pattern[j]) {
+                    match = false;
+                    break;
+                }
+            }
+            if (match)
+                result.push(i);
+        }
+        if (i < n - m) {
+            textHash = (base * (textHash - text.charCodeAt(i) * h) + text.charCodeAt(i + m)) % prime;
+            if (textHash < 0) {
+                textHash += prime;
+            }
+        }
+    }
+    return result;
+}
+//# sourceMappingURL=rabinKarp.js.map

package/dist/functions/algorithm/rabinKarp.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rabinKarp.js","sourceRoot":"","sources":["../../../src/functions/algorithm/rabinKarp.ts"],"names":[],"mappings":"AAiBA,MAAM,UAAU,SAAS,CAAC,IAAY,EAAE,OAAe;IACrD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,CAAA;IAEnE,MAAM,MAAM,GAAa,EAAE,CAAA;IAC3B,MAAM,IAAI,GAAG,GAAG,CAAA;IAChB,MAAM,KAAK,GAAG,GAAG,CAAA;IAEjB,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAA;IACxB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;IAGrB,IAAI,WAAW,GAAG,CAAC,CAAA;IACnB,IAAI,QAAQ,GAAG,CAAC,CAAA;IAChB,IAAI,CAAC,GAAG,CAAC,CAAA;IAGT,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,KAAK,CAAA;IACxB,CAAC;IAGD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,WAAW,GAAG,CAAC,IAAI,GAAG,WAAW,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAA;QAClE,QAAQ,GAAG,CAAC,IAAI,GAAG,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAA;IAC3D,CAAC;IAGD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAEhC,IAAI,WAAW,KAAK,QAAQ,EAAE,CAAC;YAC7B,IAAI,KAAK,GAAG,IAAI,CAAA;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC/B,KAAK,GAAG,KAAK,CAAA;oBACb,MAAK;gBACP,CAAC;YACH,CAAC;YACD,IAAI,KAAK;gBAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC3B,CAAC;QAGD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACd,QAAQ,GAAG,CAAC,IAAI,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAA;YAGxF,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;gBACjB,QAAQ,IAAI,KAAK,CAAA;YACnB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC"}

package/dist/functions/algorithm/taskScheduler.d.ts

@@ -0,0 +1 @@
+export declare function leastInterval(tasks: string[], n: number): number;

package/dist/functions/algorithm/taskScheduler.js

@@ -0,0 +1,15 @@
+export function leastInterval(tasks, n) {
+    const freq = new Map();
+    for (const task of tasks) {
+        freq.set(task, (freq.get(task) || 0) + 1);
+    }
+    const maxFreq = Math.max(...freq.values());
+    let maxCount = 0;
+    for (const f of freq.values()) {
+        if (f === maxFreq)
+            maxCount++;
+    }
+    const minTime = (maxFreq - 1) * (n + 1) + maxCount;
+    return Math.max(minTime, tasks.length);
+}
+//# sourceMappingURL=taskScheduler.js.map

package/dist/functions/algorithm/taskScheduler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"taskScheduler.js","sourceRoot":"","sources":["../../../src/functions/algorithm/taskScheduler.ts"],"names":[],"mappings":"AAoBA,MAAM,UAAU,aAAa,CAAC,KAAe,EAAE,CAAS;IAEtD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAA;IACtC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAC3C,CAAC;IAGD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAA;IAG1C,IAAI,QAAQ,GAAG,CAAC,CAAA;IAChB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK,OAAO;YAAE,QAAQ,EAAE,CAAA;IAC/B,CAAC;IAID,MAAM,OAAO,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAA;IAGlD,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAA;AACxC,CAAC"}

package/dist/functions/algorithm/threeSum.d.ts

@@ -0,0 +1,2 @@
+export declare function threeSum(nums: number[]): number[][];
+export declare function threeSumClosest(nums: number[], target: number): number;

package/dist/functions/algorithm/threeSum.js

@@ -0,0 +1,56 @@
+export function threeSum(nums) {
+    const result = [];
+    if (nums.length < 3)
+        return result;
+    nums.sort((a, b) => a - b);
+    for (let i = 0; i < nums.length - 2; i++) {
+        if (i > 0 && nums[i] === nums[i - 1])
+            continue;
+        let left = i + 1;
+        let right = nums.length - 1;
+        while (left < right) {
+            const sum = nums[i] + nums[left] + nums[right];
+            if (sum === 0) {
+                result.push([nums[i], nums[left], nums[right]]);
+                while (left < right && nums[left] === nums[left + 1])
+                    left++;
+                while (left < right && nums[right] === nums[right - 1])
+                    right--;
+                left++;
+                right--;
+            }
+            else if (sum < 0) {
+                left++;
+            }
+            else {
+                right--;
+            }
+        }
+    }
+    return result;
+}
+export function threeSumClosest(nums, target) {
+    nums.sort((a, b) => a - b);
+    let closest = nums[0] + nums[1] + nums[2];
+    for (let i = 0; i < nums.length - 2; i++) {
+        let left = i + 1;
+        let right = nums.length - 1;
+        while (left < right) {
+            const sum = nums[i] + nums[left] + nums[right];
+            if (Math.abs(sum - target) < Math.abs(closest - target)) {
+                closest = sum;
+            }
+            if (sum < target) {
+                left++;
+            }
+            else if (sum > target) {
+                right--;
+            }
+            else {
+                return sum;
+            }
+        }
+    }
+    return closest;
+}
+//# sourceMappingURL=threeSum.js.map

package/dist/functions/algorithm/threeSum.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"threeSum.js","sourceRoot":"","sources":["../../../src/functions/algorithm/threeSum.ts"],"names":[],"mappings":"AAgBA,MAAM,UAAU,QAAQ,CAAC,IAAc;IACrC,MAAM,MAAM,GAAe,EAAE,CAAA;IAC7B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,MAAM,CAAA;IAElC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAE1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAEzC,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAAE,SAAQ;QAG9C,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,CAAA;QAChB,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAA;QAE3B,OAAO,IAAI,GAAG,KAAK,EAAE,CAAC;YACpB,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAA;YAE9C,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;gBACd,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;gBAG/C,OAAO,IAAI,GAAG,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;oBAAE,IAAI,EAAE,CAAA;gBAC5D,OAAO,IAAI,GAAG,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;oBAAE,KAAK,EAAE,CAAA;gBAE/D,IAAI,EAAE,CAAA;gBACN,KAAK,EAAE,CAAA;YACT,CAAC;iBAAM,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;gBACnB,IAAI,EAAE,CAAA;YACR,CAAC;iBAAM,CAAC;gBACN,KAAK,EAAE,CAAA;YACT,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC;AAWD,MAAM,UAAU,eAAe,CAAC,IAAc,EAAE,MAAc;IAC5D,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAC1B,IAAI,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;IAEzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,CAAA;QAChB,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAA;QAE3B,OAAO,IAAI,GAAG,KAAK,EAAE,CAAC;YACpB,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAA;YAE9C,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC;gBACxD,OAAO,GAAG,GAAG,CAAA;YACf,CAAC;YAED,IAAI,GAAG,GAAG,MAAM,EAAE,CAAC;gBACjB,IAAI,EAAE,CAAA;YACR,CAAC;iBAAM,IAAI,GAAG,GAAG,MAAM,EAAE,CAAC;gBACxB,KAAK,EAAE,CAAA;YACT,CAAC;iBAAM,CAAC;gBACN,OAAO,GAAG,CAAA;YACZ,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAA;AAChB,CAAC"}

package/dist/functions/algorithm/topologicalSort.d.ts

@@ -0,0 +1,6 @@
+export interface TopologicalSortResult {
+    canFinish: boolean;
+    order: number[];
+}
+export declare function topologicalSort(numCourses: number, prerequisites: number[][]): TopologicalSortResult;
+export declare function topologicalSortDFS(numCourses: number, prerequisites: number[][]): TopologicalSortResult;