2452. Words Within Two Edits of Dictionary

You are given two string arrays, queries and dictionary. All words in each array comprise of lowercase English letters and have the same length. In one edit you can take a word from queries, and change any letter in it to any other letter. Find all words from queries that, after a maximum of two edits, equal some word from dictionary. Return a list of all words from queries, that match with some word from dictionary after a maximum of two edits. Return the words in the same order they appear in queries.
/**
 * @param {string[]} queries
 * @param {string[]} dictionary
 * @return {string[]}
 */
var twoEditWords = function(queries, dictionary) {
    // Helper: returns true if a and b differ in <= 2 positions
    function withinTwoEdits(a, b) {
        let diff = 0;
        for (let i = 0; i < a.length; i++) {
            if (a[i] !== b[i]) {
                diff++;
                if (diff > 2) return false; // early exit
            }
        }
        return true;
    }

    const result = [];

Obtener tipoAmazon por linea

SELECT DISTINCT
	AR.tipoProductoAmazon, 
	R.nombreRefaccion, 
	L.linea 
FROM AMAZON_REFACCION AR
	INNER JOIN REFACCION R
		ON R.cveRefaccion = AR.cveRefaccion
	INNER JOIN U_PRODUCTO P
		ON P.cveRefaccion = R.cveRefaccion
	INNER JOIN LINEA L
		ON L.cveLinea = P.cveLinea
WHERE L.cveLinea = 80

desktop app

# Desktop Dictation Tool Spec

## 1. Product Requirements Document

### 1.1 Product Summary

Build a desktop dictation tool similar in spirit to Wispr Flow that can be invoked from anywhere using a customizable global hotkey. The product opens a lightweight floating widget, captures live speech, converts it to text with low latency, cleans speech disfluencies in real time, and inserts the result into the currently focused input when possible. When direct insertion is not possible, the tool

supa pokers

Texan Wire Wheels 15″ ’84s® Super Poke® 30 Spoke Elbow® wire wheels for late model cars, classic cars, vintage cars, street rods, hot rods, and low riders.

Direct bolt on wheels for most 1978-1989 Cadillac vehicles.

The wheels will fit most FWD vehicles with a bolt pattern of 5 on 4.5, 5.5, or 5 on 4.75.

 

Disclaimer 

This is a set of four wheels that come with CHROME NONAGON or CHROME 2‑BAR CAP COMBO—whichever is available at the time of purchase. 

 

**Please Note: You can 

pp - Image Slider

Whitney's image slider/gallery. Uses Glightbox. To install, be sure to `npm install glightbox`, and bring in the css from glightbox into the page part's head
<div class="pp-image-slider" data-gallery="gallery-{{Matrix.MatrixId}}">
   <div class="main-strip">
      {% for el in List.Items %}
         <div 
            class="pp-image-slider__strip-item {% if forloop.index == 1 %} active{% endif %}"
            data-alt="{{el.FieldValues.Image.Alt}}"
         >
            <a 
               class=" glightbox"
               data-index="{{forloop.index  | Minus: 1}}"
               data-title="{{el.FieldValues.Image.Alt}}"
               data-gallery="

new image

[Subject]: Skull in cap and sunglasses, lowrider car, cash stacks, roses. [Action]: Symmetrical floating skull over an ornate banner. [Environment]: Night city skyline framed by barbed wire. [Cinematography]: Flat 2D graphic composition. [Lighting/Style]: Black and white stippling, high contrast. [Technical]: Crisp ink streetwear apparel design.

git worktree cleanup

# how to cleanup git worktrees

List what you have:
`git worktree list`

Remove a specific worktree (clean):

`git worktree remove <path>`

Use `--force` if it has uncommitted changes or is locked.

Prune stale entries (worktree dir was deleted manually, but git still tracks it): 

`git worktree prune`

Add `-v` to see what gets pruned, or `-n` for a dry-run.

Typical cleanup flow:

1. `git worktree list` — see all worktrees
2. `git worktree remove <path>` — for each one you're done with
3. `git

【Next.js】use serverで書いた処理は公開エンドポイントとなるため、内部でしか使用しない関数には記述しない

# `"use server"` に関する備忘録

## 基本動作

- `"use server"` を付けた関数(Server Action)は、実装コードはサーバー側にのみ存在し、クライアントバンドルには含まれない。
- Next.js は自動でエンドポイントを生成し、クライアントから POST リクエストで呼び出せる状態になる。
- 結果として、認証されていないユーザーを含め、誰でもそのエンドポイントを呼び出せる。

## セキュリティ上の扱い

- `"use server"` 関数は公開 API と同等に扱う。
- 関数内で認証・認可・入力バリデーションを実装する必要がある。
- closure 経由で渡した変数は暗号化されてクライアントに送られるため、秘密情報を closure で渡すのは避ける。

## 使用判断

### `"use server"` を付ける場面

- クライアント(フォーム送信、ボタンクリック等)から直接呼び出す関数。
- 例: フォーム送信、いいねボタン、コメント投稿。

### `"use server"` を付けない場面

- Server 

.md

# `"use server"` に関する備忘録

## 基本動作

- `"use server"` を付けた関数(Server Action)は、実装コードはサーバー側にのみ存在し、クライアントバンドルには含まれない。
- Next.js は自動でエンドポイントを生成し、クライアントから POST リクエストで呼び出せる状態になる。
- 結果として、認証されていないユーザーを含め、誰でもそのエンドポイントを呼び出せる。

## セキュリティ上の扱い

- `"use server"` 関数は公開 API と同等に扱う。
- 関数内で認証・認可・入力バリデーションを実装する必要がある。
- closure 経由で渡した変数は暗号化されてクライアントに送られるため、秘密情報を closure で渡すのは避ける。

## 使用判断

### `"use server"` を付ける場面

- クライアント(フォーム送信、ボタンクリック等)から直接呼び出す関数。
- 例: フォーム送信、いいねボタン、コメント投稿。

### `"use server"` を付けない場面

- Server 

1722. Minimize Hamming Distance After Swap Operations

You are given two integer arrays, source and target, both of length n. You are also given an array allowedSwaps where each allowedSwaps[i] = [ai, bi] indicates that you are allowed to swap the elements at index ai and index bi (0-indexed) of array source. Note that you can swap elements at a specific pair of indices multiple times and in any order. The Hamming distance of two arrays of the same length, source and target, is the number of positions where the elements are different. Formally, it is the number of indices i for 0 <= i <= n-1 where source[i] != target[i] (0-indexed). Return the minimum Hamming distance of source and target after performing any amount of swap operations on array source.
/**
 * @param {number[]} source
 * @param {number[]} target
 * @param {number[][]} allowedSwaps
 * @return {number}
 */
var minimumHammingDistance = function(source, target, allowedSwaps) {
    const n = source.length;

    // --- DSU (Union-Find) ---
    const parent = Array.from({ length: n }, (_, i) => i);
    const find = x => parent[x] === x ? x : parent[x] = find(parent[x]);
    const union = (a, b) => parent[find(a)] = find(b);

    // Build DSU from allowed swaps
    for (const [a, b] of

sqlalchemy foundation

SQLALCHEMY - Наиболее популярная библиотека для работы с базой данных.
Алхимия делится на core/orm части. 

Можно использовать только core без использования orm.

agent-skills

---
name: web-artifacts-builder
description: Suite of tools for creating elaborate, multi-component claude.ai HTML artifacts using modern frontend web technologies (React, Tailwind CSS, shadcn/ui). Use for complex artifacts requiring state management, routing, or shadcn/ui components - not for simple single-file HTML/JSX artifacts.
license: Complete terms in LICENSE.txt
---

# Web Artifacts Builder

To build powerful frontend claude.ai artifacts, follow these steps:
1. Initialize the fr

RAG Projects

"I want to build an advanced RAG project using only PDF data. The data includes mixed content such as text, mathematics, diagrams, and other elements from the electrical energy domain. Please suggest the best approach for the data cleaning and chunking parts only, so that my RAG system will perform better."

2078. Two Furthest Houses With Different Colors

There are n houses evenly lined up on the street, and each house is beautifully painted. You are given a 0-indexed integer array colors of length n, where colors[i] represents the color of the ith house. Return the maximum distance between two houses with different colors. The distance between the ith and jth houses is abs(i - j), where abs(x) is the absolute value of x.
/**
 * @param {number[]} colors
 * @return {number}
 */
var maxDistance = function(colors) {
    const n = colors.length;
    let ans = 0;

    // Check from the left end
    for (let j = n - 1; j >= 0; j--) {
        if (colors[j] !== colors[0]) {
            ans = Math.max(ans, j - 0);
            break; // this is the farthest possible from the left
        }
    }

    // Check from the right end
    for (let i = 0; i < n; i++) {
        if (colors[i] !== colors[n - 1]) {
            ans = M

Account upgrade links


Change to team plan - app.cacher.io/enter?action=change_to_plan&p=team
Change to expert plan - app.cacher.io/enter?action=change_to_plan&p=expert

pi-project-manager

---
name: projectmanager
description: End-to-end project management specialist for this repo. Acts as roadmap/sprint manager, technical PM, active coordinator that delegates to other subagents, and status reporter while preferring local repo inspection over web tools.
systemPromptMode: replace
inheritProjectContext: true
inheritSkills: true
maxSubagentDepth: 3
---

You are projectmanager, an end-to-end software project management specialist embedded in this repository.

You combine fo