Cacher is the code snippet organizer for pro developers

/**
 * @param {number} n
 * @return {boolean}
 */
var checkDivisibility = function(n) {
    // Convert the number to a string so we can iterate through each digit
    let sum = 0;
    let prod = 1;

    // Loop through each character (digit) in the number
    for (const ch of String(n)) {
        const d = ch - '0';   // Convert character to actual digit
        sum += d;             // Add digit to the running sum
        prod *= d;            // Multiply digit into the running product
    }

 

import os
import django
from django.contrib.auth import get_user_model

# Start Django setup
os.environ.setdefault("DJANGO_SETTINGS_MODULE", "Django_project_4.settings")
django.setup()
# End of djang o setup


User = get_user_model()

# Find user by username or email
user = User.objects.get(username="username")
# user = User.objects.get(email="email@email.com")
password = "password"

if user.check_password(password):
    print("Password match!")
else:
    print("Wrong passwor

# =============================================================================
# Single Deployment Script (PRODUCTION)
# - Password is hardcoded below
# - Encrypts it on the jump box
# - Writes the processing script (with encrypted password only) to C:\Scripts
# - Creates a reboot-resistant scheduled task (Daily + every 5 minutes)
# - FTPS (Explicit TLS) + Passive + Hostname
# - Gracefully handles 425 on close (known FileZilla quirk)
# - Archives files LOCALLY on C: drive
# ===========

/**
 * @param {number[]} coins
 * @param {number} k
 * @return {number}
 */
var findKthSmallest = function(coins, k) {
    const n = coins.length;

    // Precompute all subset LCMs
    const lcms = [];
    const gcd = (a, b) => b === 0 ? a : gcd(b, a % b);
    const lcm = (a, b) => a / gcd(a, b) * b;

    for (let mask = 1; mask < (1 << n); mask++) {
        let L = 1;
        for (let i = 0; i < n; i++) {
            if (mask & (1 << i)) {
                L = lcm(L, coins[i]);
                

https://www.npmjs.com/package/validatorjs

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

    // arr1 starts with the first element
    const arr1 = [nums[0]];

    // arr2 starts with the second element
    const arr2 = [nums[1]];

    // Process the rest of the array starting from index 2
    for (let i = 2; i < nums.length; i++) {

        // Compare the last elements of arr1 and arr2
        // If arr1's last element is greater, append to arr1
        if (arr1[arr1.length - 1] > arr2[arr2.

Here is a comprehensive .NET CLI cheat sheet formatted cleanly in Markdown. 
If you are just getting started, you might want to learn how to install the .NET SDK first, or explore how to use .NET CLI in CI/CD pipelines to automate your builds. 
.NET CLI Cheat Sheet 
ℹ️ Environment & Diagnostics 

| Command | Description  |
| --- | --- |
| — | Display the active .NET SDK version.  |
| — | Display detailed environment information (OS, architecture, runtimes).  |
| — | List all installed .NET SDK v

/**
 * @param {number} n
 * @param {number[][]} reservedSeats
 * @return {number}
 */
var maxNumberOfFamilies = function(n, reservedSeats) {
    const map = new Map();

    // Build row → reserved seats set
    for (const [r, s] of reservedSeats) {
        if (!map.has(r)) map.set(r, new Set());
        map.get(r).add(s);
    }

    let result = 0;

    // Blocks
    const A = [2,3,4,5];
    const B = [4,5,6,7];
    const C = [6,7,8,9];

    function free(block, reserved) {
        return block.

# Fable usage policy

Fable is for orchestration, design, and decisions ONLY. Never spend Fable tokens on chores, implementation, file reading/summarizing, documentation writing, or verification passes. Two sanctioned patterns:

1. **Fable as orchestrator**: Fable plans and delegates all actual work to worker subagents (`model: "opus"` or `model: "sonnet"` via the Agent tool). Workers read, implement, write docs, and verify; Fable judges their reports and decides.
2. **Fable as advisor**: a Sonn

import requests
import os
from pathlib import Path

from dotenv import load_dotenv

load_dotenv()

# ============================================================
# CONFIGURATION
# ============================================================

# Put the GUID from the Cacher snippet URL here
SNIPPET_GUID = "guid:e85aaf8e119674c40f13"
OUTPUT_FOLDER = Path("cacher_download")

CACHER_API_KEY = os.environ.get("CACHER_API_KEY")
CACHER_API_TOKEN = os.environ.get("CACHER_API_TOKEN")

# 

/**
 * @param {number[]} nums
 * @param {number} k
 * @return {number}
 */
var largestInteger = function(nums, k) {
    const n = nums.length;

    // Case 1: k = 1;
    if (k === 1) {
        const freq = new Map();
        for (let x of nums) freq.set(x, (freq.get(x) || 0) + 1);

        let ans = -1;
        for (let [x, f] of freq) {
            if (f === 1) ans = Math.max(ans, x);
        }
        return ans;
    }

    // Case 2: k = n
    if (k === n) {
        return Math.max(...nums);

https://markpinero.com/blog/no-js-variants

/**
 * @param {number[]} stoneValue
 * @return {number}
 */
var stoneGameV = function(stoneValue) {
    const n = stoneValue.length;
    const prefix = new Array(n + 1).fill(0);
    for (let i = 0; i < n; i++) prefix[i + 1] = prefix[i] + stoneValue[i];

    const sum = (l, r) => prefix[r + 1] - prefix[l];

    const dp = Array.from({ length: n }, () => Array(n).fill(0));

    // length = size of interval
    for (let len = 2; len <= n; len++) {
        for (let l = 0; l + len - 1 < n; l++) {
   

# Resend送信ドメイン設定（Xserver）

## 手順

### 1. Resendにドメインを追加

- ドメイン：`dentalhr.jp`
- リージョン：東京（`ap-northeast-1`）
- 理由：ドメイン用のDKIM鍵と検証対象のDNSレコードをResendに発行させるため

### 2. XserverにDNSレコードを追加

Resendに表示された値をXserverの`dentalhr.jp`用DNSレコード設定へ登録。

#### DKIM

- 種別：`TXT`
- ホスト名：`resend._domainkey`
- 値：Resendが発行したDKIM公開鍵
- 理由：受信側がメールのDKIM署名を検証するため

#### Return-Path

- 種別：`MX`
- ホスト名：`send`
- 値：`feedback-smtp.ap-northeast-1.amazonses.com`
- 優先度：`10`
- 理由：バウンスなどの配送結果をAmazon SES側で処理するため

#### SPF

- 種別：`TXT`
- ホスト名：`s

/**
 * @param {number[]} stones
 * @return {boolean}
 */
var stoneGameIX = function(stones) {
    // cnt[0], cnt[1], cnt[2] = counts of stones with value % 3 == 0, 1, 2
    const base = [0, 0, 0];
    for (let x of stones) {
        base[x % 3]++;
    }

    // Check function: assumes we try to start with remainder 1
    function check(cnt) {
        // If we have no remainder-1 stones, this start is impossible
        if (cnt[1] === 0) return false;

        // Use one remainder-1 stone as Alic

/**
 * @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
};