lm studio mcp

{
  "mcpServers": {
    "firecrawl-mcp": {
      "command": "npx",
      "args": [
        "-y",
        "firecrawl-mcp"
      ],
      "env": {
        "FIRECRAWL_API_KEY": "fc-0b4d8657290a4ffdacee91bb1614089d"
      }
    },
    "exa": {
      "command": "npx",
      "args": [
        "-y",
        "exa-mcp-server"
      ],
      "env": {
        "EXA_API_KEY": "e030e9c4-3bbb-47d1-ae23-7f12dce7ed2a"
      }
    },
    "mem0-mcp": {
      "url": "https://mcp.mem0.ai/mcp"
    },
    "playwright"

bottoken

8627698076:AAHWaPdj1mPCTd-Foq4NwWmE0K28otWIuow 

48. Rotate Image

You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise). You have to rotate the image in-place, which means you have to modify the input 2D matrix directly. DO NOT allocate another 2D matrix and do the rotation.
/**
 * @param {number[][]} matrix
 * @return {void} Do not return anything, modify matrix in-place instead.
 */
var rotate = function(matrix) {
    const n = matrix.length;

    // 1. Transpone
    for (let i = 0; i < n; i++) {
        for (let j = i + 1; j < n; j++) {
            [matrix[i][j], matrix[j][i]] = [matrix[j][i], matrix[i][j]];
        }
    }

    // 2. Reverse each row
    for (let i = 0; i < n; i++) {
        matrix[i].reverse();
    }
};

newimage.md

[Subject]: A highly detailed, vintage Chicano tattoo-style illustration featuring ornate, hand-lettered typography reading 'Trilla Than Tha Rest' in the center and 'Paul Weezy DESIGN' at the bottom. Flanked by a classic vintage lowrider car, a stylized human skull wearing aviator sunglasses, a majestic eagle, and detailed saguaro cacti. [Action]: Arranged in a dense, balanced composition, with decorative filigree and floral flourishes framing the central text and seamlessly integrating the vario

laravel-claude

# https://github.com/laravel/agent-skills
/plugin marketplace add laravel/agent-skills
/plugin install laravel@laravel
/plugin install laravel-cloud@laravel
/plugin install laravel-nightwatch@laravel

# Laravel Boost (Offiziell/MCP): Ein MCP-Server (Model Context Protocol), der Claude Code direkten Zugriff auf die Laravel-Anwendung gibt, 
# um Artisan-Befehle auszuführen, Eloquent-Abfragen zu generieren und die Dokumentation zu durchsuchen. Installation via Composer:
composer require laravel/boo

cursor-subaagents

---
name: senior-fullstack-js
description: Senior full‑stack engineer; world‑class JavaScript developer and agentic development specialist
model: inherit
readonly: false
---

You are a senior full‑stack engineer with decades of experience designing and building scalable web applications. You write clean, maintainable JavaScript and TypeScript across the entire stack and mentor others in best practices. You are especially skilled at integrating AI agents into software systems using modern agentic

GitHub Copilot CLI

# Non-interactive
gh copilot -p "suggest how do I list large files recursively"

# Interactive
gh copilot -i "suggest"


# Remark: to run latest installed version of powershell: run pwsh command from windows powershell or from terminal

search for files/folder under the current folder in powershell

# files & folders
Get-ChildItem -Path . -Recurse -Force -FollowSymlink:$false -Filter "myname*" -ErrorAction SilentlyContinue

# files only
Get-ChildItem -Path . -Recurse -File -FollowSymlink:$false -Force -Filter "myname*" -ErrorAction SilentlyContinue

# directories only
Get-ChildItem -Path . -Recurs -Directory -FollowSymlink:$false -Force -Filter "myname*" -ErrorAction SilentlyContinue

# One line per result
Get-ChildItem -Path . -Recurse -Directory -Force -FollowSymlink:$false -Filter "mynam

claude-config

#install claude foundation rules from kaparthy - 4 simple rules - https://raw.githubusercontent.com/forrestchang/andrej-karpathy-skills/main/CLAUDE.md
/plugin marketplace add forrestchang/andrej-karpathy-skills
/plugin install andrej-karpathy-skills@karpathy-skills

# install directly in project
curl -o CLAUDE.md https://raw.githubusercontent.com/forrestchang/andrej-karpathy-skills/main/CLAUDE.md

comfyui-mcp

#install in claude code
/plugin install comfyui-mcp@artokun-comfyui-mcp
#search in list for comfy
/plugin list
#click and install
/reload-plugins

nvidia service key

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

deepseek.md

import OpenAI from 'openai';

const openai = new OpenAI({
  apiKey: '$NVIDIA_API_KEY',
  baseURL: 'https://integrate.api.nvidia.com/v1',
})

 
async function main() {
  const completion = await openai.chat.completions.create({
    model: "deepseek-ai/deepseek-v4-pro",
    messages: [{"content":"can you help me build: Agent Action Plan\n1. Introduction\n1.1 Executive Summary\n1.1.1 Brief Overview Of The Project\nThe Cloud-First AI Development Platform is a modern web application built with React 

nvidia-nim api key

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

788. Rotated Digits

An integer x is a good if after rotating each digit individually by 180 degrees, we get a valid number that is different from x. Each digit must be rotated - we cannot choose to leave it alone. A number is valid if each digit remains a digit after rotation. For example: 0, 1, and 8 rotate to themselves, 2 and 5 rotate to each other (in this case they are rotated in a different direction, in other words, 2 or 5 gets mirrored), 6 and 9 rotate to each other, and the rest of the numbers do not rotate to any other number and become invalid. Given an integer n, return the number of good integers in the range [1, n].
/**
 * @param {number} n
 * @return {number}
 */
var rotatedDigits = function(n) {
    // 0 = unchanged-valid, 1 = change-valid, -1 = invalid
    const type = {
        0: 0, 1: 0, 8: 0,
        2: 1, 5: 1, 6: 1, 9: 1,
        3: -1, 4: -1, 7: -1
    };

    let count = 0;

    for (let x = 1; x <= n; x++) {
        let changed = false;
        let valid = true;
        let num = x;

        while (num > 0) {
            const d = num % 10;
            const t = type[d];

            if (t === -

e2b api key- pmontag9

e2b_9f901103a80a303948ca4bb02a09f023bad327c2

396. Rotate Function

You are given an integer array nums of length n. Assume arrk to be an array obtained by rotating nums by k positions clock-wise. We define the rotation function F on nums as follow: F(k) = 0 * arrk[0] + 1 * arrk[1] + ... + (n - 1) * arrk[n - 1]. Return the maximum value of F(0), F(1), ..., F(n-1). The test cases are generated so that the answer fits in a 32-bit integer.
/**
 * @param {number[]} nums
 * @return {number}
 */
var maxRotateFunction = function(nums) {
    const n = nums.length;
    const sum = nums.reduce((a, b) => a + b, 0);

    // Compute F(0)
    let F = 0;
    for (let i = 0; i < n; i++) {
        F += i * nums[i];
    }

    let best = F;

    // Apply recurrence for F(1) ... F(n-1)
    for (let k = 0; k < n - 1; k++) {
        F = F + sum - n * nums[n - 1 - k];
        best = Math.max(best, F);
    }

    return best;
};