How to Master the Cps Test: A Fun Guide for Gamers

Introduction: What’s the Buzz About Cps Test?
If you’re into gaming or just love testing your reflexes, you’ve probably heard of the <a href="https://cpstestpro.com">Cps Test</a>  (short for "clicks per second test"). It’s a simple yet addictive online tool that measures how fast you can click your mouse in a set amount of time. Whether you’re a competitive gamer looking to improve your APM (actions per minute) or just someone who enjoys quick challenges, the Cps Test is a great way to test and

Hide out-of-stock products from related products on single product pages only.

/**
 * Hide out-of-stock products from related products on single product pages only.
 */
add_filter( 'woocommerce_related_products', function( $related_posts, $product_id, $args ) {
    if ( ! is_product() ) {
        return $related_posts;
    }
    foreach ( $related_posts as $key => $post_id ) {
        $product = wc_get_product( $post_id );
        if ( $product && ! $product->is_in_stock() ) {
            unset( $related_posts[ $key ] );
        }
    }
    return $related_pos

1559. Detect Cycles in 2D Grid

Given a 2D array of characters grid of size m x n, you need to find if there exists any cycle consisting of the same value in grid. A cycle is a path of length 4 or more in the grid that starts and ends at the same cell. From a given cell, you can move to one of the cells adjacent to it - in one of the four directions (up, down, left, or right), if it has the same value of the current cell. Also, you cannot move to the cell that you visited in your last move. For example, the cycle (1, 1) -> (1, 2) -> (1, 1) is invalid because from (1, 2) we visited (1, 1) which was the last visited cell. Return true if any cycle of the same value exists in grid, otherwise, return false.
/**
 * @param {character[][]} grid
 * @return {boolean}
 */
var containsCycle = function(grid) {
    const m = grid.length;
    const n = grid[0].length;
    const visited = Array.from({ length: m }, () => Array(n).fill(false));

    const dirs = [[1,0], [-1,0], [0,1], [0,-1]];

    function dfs(r, c, pr, pc) {
        visited[r][c] = true;

        for (const [dr, dc] of dirs) {
            const nr = r + dr;
            const nc = c + dc;

            // bounds check
            if (nr < 0 || 

Reading

Article Georgia declares state of emergency as wildfires destroy dozens of homes
https://www.bbc.com/news/articles/c1mkdvpzzpno

Vocab:
acres
to prompt
blaze
The fires began sprouting up
foil balloon
The blaze was about 10% contained
stray spark
welding operation
counties
outdoor burn ban
engulfed 
gut-wrenching
go up in flames
fire ban

claude

dism.exe /online /enable-feature /featurename:VirtualMachinePlatform /all /norestart 

3464. Maximize the Distance Between Points on a Square

You are given an integer side, representing the edge length of a square with corners at (0, 0), (0, side), (side, 0), and (side, side) on a Cartesian plane. You are also given a positive integer k and a 2D integer array points, where points[i] = [xi, yi] represents the coordinate of a point lying on the boundary of the square. You need to select k elements among points such that the minimum Manhattan distance between any two points is maximized. Return the maximum possible minimum Manhattan distance between the selected k points. The Manhattan Distance between two cells (xi, yi) and (xj, yj) is |xi - xj| + |yi - yj|.
/**
 * @param {number} side
 * @param {number[][]} points
 * @param {number} k
 * @return {number}
 */
var maxDistance = function (side, points, k) {

    // -------------------------------
    // 1. Convert (x, y) → perimeter position
    // -------------------------------
    const n = points.length;
    const pos = new Array(n);

    for (let i = 0; i < n; i++) {
        const [x, y] = points[i];
        let p;

        // Map each boundary point to its clockwise perimeter distance
        if

MAC OS

# AH le MAC :)

## Shell Profile stuff Zprofile etc...

Loading order on macOS:

`.zshenv → .zprofile → .zshrc → .zlogin → .zlogout`

#### Usage Notes:
`/etc/zshenv` : (optional) read first and everytime. ( good place for system wide ENV VAR )

`.zprofile` and `.zlogin` are basically the same thing - they set the environment for login shells

`.zshrc` This gets loaded after .zprofile. It's typically a place where you "set it and forget it" type of parameters like $PATH, $PROMPT, aliases, and fun

Azure AD/Intune Device Export using MS Graph

MS Graph script to export all devices information from EntraID environment note - alternative option is to 'export' from GUI of Devices|All devices
#Providing scope definition
Connect-MgGraph -Scopes "Device.Read.All"

<#Get all devices and export to AllDevices.csv path - include columns specified under "Select-Object".
- find additional fields to include beyond:
DisplayName
operating system
operating system version
registration date/time
last logon date/time
account enabled status
compliance?
compliance grace period?
ownership
#>
Get-MgDevice -All | Select-Object DisplayName, OperatingSystem, OperatingSystemVersion, Registra

2833. Furthest Point From Origin

You are given a string moves of length n consisting only of characters 'L', 'R', and '_'. The string represents your movement on a number line starting from the origin 0. In the ith move, you can choose one of the following directions: move to the left if moves[i] = 'L' or moves[i] = '_' move to the right if moves[i] = 'R' or moves[i] = '_' Return the distance from the origin of the furthest point you can get to after n moves.
/**
 * @param {string} moves
 * @return {number}
 */
var furthestDistanceFromOrigin = function(moves) {
    let L = 0, R = 0, U = 0;

    for (let ch of moves) {
        if (ch === 'L') L++;
        else if (ch === 'R') R++;
        else U++; // wildcard
    }

    return Math.abs(R - L) + U;
};

Haskell Perfect Numbers

import Data.Bits

import Control.Applicative

prime :: Int -> Bool
prime 1 = False
prime 2 = True
prime 3 = True
prime x
    | x `mod` 2 == 0 = False
    | x `mod` 3 == 0 = False
    | otherwise = all
                    -- check if x is not divisibile by the divisors
                    ((/= 0) . (x `mod`))

                    -- only take divisors less than or equal to sqrt(x)
                    . takeWhile (<= (floor . sqrt . fromIntegral $ x))

                    -- generate divisors as a

ensureDir

[typescript] ensureDir #typescript
export async function ensureDir(fileOrDirPath: string) {
  const entryStat = await fs.stat(fileOrDirPath);

  try {
    await fs.mkdir(entryStat.isDirectory() ? fileOrDirPath : path.basename(fileOrDirPath), {
      recursive: true
    });
  } catch (err: unknown) {
    logger.debug({ err }, `Failed to ensure directory exists: ${fileOrDirPath}`);
    throw err;
  }
}

Block comments WP

// ============================================================
// BLOCCO TOTALE COMMENTI WORDPRESS
// ============================================================

// 1. Chiude i commenti su tutti i post esistenti e futuri
function disable_comments_status() {
    return false;
}
add_filter( 'comments_open', 'disable_comments_status', 20, 2 );
add_filter( 'pings_open',    'disable_comments_status', 20, 2 );

// 2. Nasconde i commenti già esistenti
add_filter( 'comments_array', '__return_empty_ar

タイトルの後ろだけborderを途切れさせるboxをCSSのみでやる

<div class="box">
  <p class="caption">ポラーノの広場</p>
  <p>あのイーハトーヴォのすきとおった風、夏でも底に冷たさをもつ青いそら、うつくしい森で飾られたモリーオ市、郊外のぎらぎらひかる草の波。</p>
</div>

chat gpt ide

# ChatGPT Snippet Workspace — Design Spec

**Date:** 2026-04-13
**Status:** Draft for review
**Owner:** Paul Montag

## Summary

Build a ChatGPT-first coding workspace that unifies chat, editable code artifacts, runnable contexts, and reusable snippets in one product. The product should make two things feel effortless in v1:

1. turning good ChatGPT code output into durable, reusable snippets, and
2. opening a real project/workspace so ChatGPT can iterate directly against code in context.

The p

Mapa RGB en Y

vector bbox = relbbox(0,@P);
int select = chi("axis");
v@Cd = vector(chramp("color",bbox[select]));

2615. Sum of Distances

You are given a 0-indexed integer array nums. There exists an array arr of length nums.length, where arr[i] is the sum of |i - j| over all j such that nums[j] == nums[i] and j != i. If there is no such j, set arr[i] to be 0. Return the array arr.
/**
 * @param {number[]} nums
 * @return {number[]}
 */
var distance = function(nums) {
    const groups = new Map();

    // 1. Collect indices for each value
    for (let i = 0; i < nums.length; i++) {
        if (!groups.has(nums[i])) groups.set(nums[i], []);
        groups.get(nums[i]).push(i);
    }

    const result = Array(nums.length).fill(0);

    // 2. Process each group independently
    for (const idx of groups.values()) {
        const m = idx.length;
        if (m === 1) continue;