Cacher is the code snippet organizer for pro developers

/**
 * @param {number[]} landStartTime  – earliest start times for land rides
 * @param {number[]} landDuration   – durations for land rides
 * @param {number[]} waterStartTime – earliest start times for water rides
 * @param {number[]} waterDuration  – durations for water rides
 * @return {number}                 – earliest possible finish time
 */
var earliestFinishTime = function(landStartTime, landDuration, waterStartTime, waterDuration) {
    let ans = Infinity; // Track the minimum finish 

https://mermaid.ai/web/

# Code Modification & Mandatory Review Workflow

For EVERY substantial code modification in this project, you **MUST** strictly follow the independent review process below. **DO NOT SKIP THIS UNDER ANY CIRCUMSTANCES.**

1. **No Immediate Completion**: Do NOT report the task as complete immediately after writing/modifying code.
2. **Spawn a Review Subagent**: You must immediately spawn an independent Subagent.
3. **Assign the Persona & Prompt**: Pass the following exact prompt to the Subage

//add team animations
jQuery('h1,h2').addClass('wow animate__animated animate__fadeInUp');
jQuery('h3').addClass('wow animate__animated animate__fadeInUp second-animate');
// jQuery('.block--leadership-team .team-member:nth-of-type(2)').addClass('second-animate');
// jQuery('.block--leadership-team .team-member:nth-of-type(3)').addClass('third-animate');
// jQuery('.block--leadership-team .team-member:nth-of-type(4)').addClass('fourth-animate');
// jQuery('.block--leadership-team .team-member:nt

/**
 * @param {number[]} cost
 * @return {number}
 */
var minimumCost = function(cost) {
    cost.sort((a, b) => b - a); // Sort descending

    let total = 0;

    for (let i = 0; i < cost.length; i++) {
        // Every third candy (i % 3 === 2) is free
        if (i % 3 !== 2) {
            total += cost[i];
        }
    }

    return total;
};

/**
 * @param {number} mass
 * @param {number[]} asteroids
 * @return {boolean}
 */
var asteroidsDestroyed = function(mass, asteroids) {
    // Sort asteroids so we always face the smallest one first.
    // Greedy logic: if we can't destroy the smallest, we can't destroy any larger one.
    asteroids.sort((a, b) => a - b);

    // Process each asteroid in ascending order.
    for (let a of asteroids) {
        // If our current mass is too small, we fail immediately.
        if (mass < a) retur

sk-lm-nwY7hWqR:CsvJ6aglD21jFQvWEzI1

/**
 * @param {number[][]} queries
 * @return {boolean[]}
 */
var getResults = function(queries) {
    const Q = queries.length;
    const MAXX = Math.min(50000, 3 * Q);

    // Collect all obstacle positions
    const obs = new Set([0, MAXX]);
    for (const q of queries) {
        if (q[0] === 1) obs.add(q[1]);
    }

    const arr = Array.from(obs).sort((a, b) => a - b);
    const idx = new Map();
    arr.forEach((v, i) => idx.set(v, i));

    const n = arr.length;
    const fenw = new Array(

/**
 * @param {number[]} nums
 * @return {number}
 */
var minElement = function(nums) {

    // Helper function to compute the digit sum of a number.
    // Example: 999 → 27, 14 → 5
    function digitSum(x) {
        let sum = 0;

        // Extract digits one by one using modulo and integer division.
        while (x > 0) {
            sum += x % 10;          // Add the last digit
            x = Math.floor(x / 10); // Remove the last digit
        }

        return sum;
    }

    // Track th

# Snow Monkey Forms フック一覧

> **MW WP Form との違い**
>
> - SMF には **フォーム ID ごとの動的フック名**（`xxx-123` のような suffix）はありません。すべて **全フォーム共通** のフックです。
> - 問い合わせデータの DB 保存機能は標準ではなく、ファイルアップロードの一時保存のみです。

---

# 全体

| フック名 | タイプ | 説明 |
|---|---|---|
| `snow_monkey_forms_pro` | フィルター | Snow Monkey テーマ利用時の Pro 判定を上書きできる。`is_pro()` で参照。 |
| `snow_monkey_forms/enqueue/fallback_style` | フィルター | Pro 以外の環境でフォールバック CSS（sass-basis 代替）を読み込むかどうか。デフォルトは `! is_pro()`。 |

---

# イベントフック（管理画面）

| フック名 | タイプ

/**
 * @param {string[]} wordsContainer
 * @param {string[]} wordsQuery
 * @return {number[]}
 */
var stringIndices = function(wordsContainer, wordsQuery) {
    const n = wordsContainer.length;
    const m = wordsQuery.length;

    // Precompute lengths
    const lengths = wordsContainer.map(w => w.length);

    // Find max query length to limit trie depth
    let maxQ = 0;
    for (const q of wordsQuery) maxQ = Math.max(maxQ, q.length);

    // Trie node constructor
    function Node() {
      

# Post-hoc Analyzer Agent

Analyze blind comparison results to understand WHY the winner won and generate improvement suggestions.

## Role

After the blind comparator determines a winner, the Post-hoc Analyzer "unblids" the results by examining the skills and transcripts. The goal is to extract actionable insights: what made the winner better, and how can the loser be improved?

## Inputs

You receive these parameters in your prompt:

- **winner**: "A" or "B" (from blind comparison)

!PWL]h]u}8moL-8

/**
 * @param {string} word
 * @return {number}
 */
var numberOfSpecialChars = function(word) {
    // first[c]  = first index (0-based) where char c appears
    // last[c]   = last index (0-based) where char c appears
    const first = Array(128).fill(-1);
    const last  = Array(128).fill(-1);

    // One pass: record first & last positions for every character
    for (let i = 0; i < word.length; i++) {
        const code = word.charCodeAt(i);
        if (first[code] === -1) first[code] = i;
 

https://docs.npmjs.com/about-semantic-versioning

// test.describe.configure({ mode: 'serial' });
// https://playwright.dev/docs/test-parallel#serial-mode
import { test, type Page } from '@playwright/test';

// Annotate entire file as serial.
test.describe.configure({ mode: 'serial' });

let page: Page;

test.beforeAll(async ({ browser }) => {
  page = await browser.newPage();
});

test.afterAll(async () => {
  await page.close();
});

test('runs first', async () => {
  await page.goto('https://playwright.dev/');
});

test('runs second', async