3702. Longest Subsequence With Non-Zero Bitwise XOR

You are given an integer array nums. Return the length of the longest subsequence in nums whose bitwise XOR is non-zero. If no such subsequence exists, return 0.
/**
 * @param {number[]} nums
 * @return {number}
 */
var longestSubsequence = function(nums) {
    let xor = 0;
    for (let x of nums) xor ^= x;

    if (xor !== 0) return nums.length;

    // xor == 0
    for (let x of nums) {
        if (x !== 0) return nums.length - 1;
    }

    return 0; // all zeros
};

3090. Maximum Length Substring With Two Occurrences

Given a string s, return the maximum length of a substring such that it contains at most two occurrences of each character.
/**
 * @param {string} s
 * @return {number}
 */
var maximumLengthSubstring = function(s) {
    let freq = new Map();
    let left = 0;
    let maxLen = 0;

    for (let right = 0; right < s.length; right++) {
        const char = s[right];
        freq.set(char, (freq.get(char) || 0) + 1);

        // shrink window while any char appears more than twice
        while (freq.get(char) > 2) {
            const leftChar = s[left];
            freq.set(leftChar, freq.get(leftChar) - 1);
            

Claude doc files

# Project Structure

A reference tree of the repository. Generated from the working tree; regenerate when the
layout changes materially.

## Excluded from this tree

`.git/`, `.venv/`, `__pycache__/`, `.pytest_cache/`, `node_modules/`, media uploads
(`uploads/`), and log files. `.idea/` (JetBrains IDE config, tracked in git) is collapsed
to a single line.

Included by request even though they are build output / local-only: the collected
`staticfiles/` tree and the `db.sqlite3` databa

CLAUDE.md , AGENTS.md

refer to AGENTS.md

Claude Rules files

# Planning Rules

Owner: Gal Sarig ~ Last updated: 15/08/2026

## Purpose

- Define how plans are created, reviewed, and executed in this repository.

## Plan Location and Lifecycle

- Treat `.claude/plans/` at the repository root as the source of truth for plans.
- For any plan-related request, fir3st read existing `.claude/plans/*.md` plans, even when no specific plan file is
  referenced.
- Save every new or updated implementation plan as a Markdown file in `.claude/plans/`.
- I

Speed Stars

<a href="https://speedstarsonline.io">Speed Stars</a> is a fun choice if you enjoy simple sports games that are easy to understand but difficult to master. Its focus on timing gives every race a little challenge, while the short format makes it convenient for quick sessions.

Whether you're playing casually or trying to beat your personal best, Speed Stars keeps the goal simple: run faster, make fewer mistakes, and keep improving. If you like competitive games where small improvements actually f

Stickman Hook

Play <a href="https://stickmanhookgame.org">Stickman Hook</a> online and swing through tricky levels, dodge obstacles, and master every jump. Enjoy fast, simple, addictive arcade action today!
The main goal in Stickman Hook is to reach the finish line safely. Tap or click to attach your hook to a nearby point, then release at the right moment to launch your character forward. Timing is everything.

When playing Stickman Hook, try to watch the position of your character and the next hook point at

bio for browser agent.

1.when you get to https://app.fivesurveys.com/surveys, click on any button that says Take Survey, then use your best judgement to fill out the questions.

Sample data based off of me:
Name: Paul Montag
age: 42
marital-status: living with partner, and 3 children.
wifes-name: Ashley Balderrama
oldest-child: Roberto Rios, aka Bubba, age:21 has autism.
middle-child: Jasmine Martinez, 19 
youngest-child: Elyse Garcia. age:13, even though she thinks shes 30, but in real life acts like a 2 yea

mastra self-improving

Mastra browser survey agent: architecture, memory, evals, and a safe improvement loop

Research date: 2026-08-14
Status: design research; no application code changed
sources_reviewed: 272 candidate results across four research tracks; 30 primary sources retained and cited
Research method: Exa deep search and full-page fetch, restricted to Mastra's official documentation and first-party GitHub repository

Executive answer

This is feasible with Mastra, with one important qualification: build a br

2213. Longest Substring of One Repeating Character

You are given a 0-indexed string s. You are also given a 0-indexed string queryCharacters of length k and a 0-indexed array of integer indices queryIndices of length k, both of which are used to describe k queries. The ith query updates the character in s at index queryIndices[i] to the character queryCharacters[i]. Return an array lengths of length k where lengths[i] is the length of the longest substring of s consisting of only one repeating character after the ith query is performed.
/**
 * @param {string} s
 * @param {string} queryCharacters
 * @param {number[]} queryIndices
 * @return {number[]}
 */
var longestRepeating = function(s, queryCharacters, queryIndices) {
    const n = s.length;
    const tree = Array(4 * n);

    // Create a leaf node representing a single character
    function makeNode(ch) {
        return {
            leftChar: ch,   // char at left boundary
            rightChar: ch,  // char at right boundary
            prefix: 1,      // longest prefix 

digitalocean inferance

doo_v1_2d9e530a43a2f57dde94e673b9b19763318a2a4b262a92b6ca03981784e1a1d9


//url

https://inference.do-ai.run/v1/chat/completions


const url = "https://inference.do-ai.run/v1/chat/completions";
const headers = {
    "Content-Type": "application/json",
    "Authorization": "Bearer YOUR_MODEL_ACCESS_KEY"
};
const data = {
    "model": "kimi-k3",
    "messages": [
        {
            "role": "user",
            "content": "What is the capital of France?"
        }
    ],
    "max_tokens": 100
};

INSERT multiple values with INSERT...SELECT method

INSERT INTO "AgencyProperties" ("agencyId", "key", "value", "createdAt", "updatedAt")
SELECT
  id,
  'DRIVERS_LICENSE_COLLECTION_ENABLED',
  'true'::jsonb,
  now(),
  now()
FROM "Agencies"
WHERE id IN (
  112,
  131,
  150,
  384,
  433,
  446,
  476
);

dig ocean funcs

personal access token
3rTU7erL6I0gfOimIOwajQdPT8QOKU0SG8qZZmSMekirxR1v6OQCQfZo5VyZYP3S

access key
dof_v1_db047988-74e6-4897-aa7e-b71b5625

2958. Length of Longest Subarray With at Most K Frequency

You are given an integer array nums and an integer k. The frequency of an element x is the number of times it occurs in an array. An array is called good if the frequency of each element in this array is less than or equal to k. Return the length of the longest good subarray of nums. A subarray is a contiguous non-empty sequence of elements within an array.
/**
 * @param {number[]} nums
 * @param {number} k
 * @return {number}
 */
var maxSubarrayLength = function(nums, k) {
    const freq = new Map();
    let l = 0;
    let best = 0;

    for (let r = 0; r < nums.length; r++) {
        const x = nums[r];
        freq.set(x, (freq.get(x) || 0) + 1);

        // If x exceeds k, shrink window
        while (freq.get(x) > k) {
            const y = nums[l];
            freq.set(y, freq.get(y) - 1);
            l++;
        }

        best = Math.max(be

Prompt

Hello World!

Rotacion de los puntos sobre el mismo eje aleatorio

Este Código va antes del copy to points junto con un Att randomize - Orient

vector axis = rand(@ptnum * 13.123);
axis = fit01(axis, -1, 1);
axis = normalize(axis);

float speed = fit01(rand(@ptnum * 91.77), chf("minspeed"), chf("maxspeed"));

float angle = @Time * speed;

vector4 q = quaternion(angle, axis);

// Add to existing orient
@orient = qmultiply(q, @orient);