search for files/folder under the current folder in powershell 

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

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

# directories only
Get-ChildItem -Path . -Recurse -Directory -Force -Filter "myname*" -ErrorAction SilentlyContinue

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

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;
};

Claude Settings 

{
  "statusLine": {
    "type": "command",
    "command": "bash /Users/rinesh/.claude/statusline-command.sh",
    "padding": 2
  },
  "enabledPlugins": {
    "code-review@claude-plugins-official": true,
    "feature-dev@claude-plugins-official": true,
    "code-simplifier@claude-plugins-official": true,
    "ralph-loop@claude-plugins-official": true,
    "security-guidance@claude-plugins-official": true,
    "claude-md-management@claude-plugins-official": true,
    "claude-code-setup@claude-plug

Status Line Command 

#!/usr/bin/env bash
# Claude Code status line — mirrors Powerlevel10k p10k-rainbow layout:
#   LEFT : dir  git-branch/status
#   RIGHT: user@host  model  context%

input=$(cat)

# Color variables with actual escape characters
BOLD_BLUE=$'\033[1;34m'
BOLD_YELLOW=$'\033[1;33m'
DIM_WHITE=$'\033[0;37m'
CYAN=$'\033[0;36m'
GREEN=$'\033[0;32m'
YELLOW=$'\033[0;33m'
RED=$'\033[0;31m'
RESET=$'\033[0m'

# --- Claude Code data ---
cwd=$(echo "$input"   | jq -r '.workspace.current_dir // .cwd // ""')
model=$

agency-osv2 

Agent Action Plan
1. Introduction
1.1 Executive Summary
1.1.1 Brief Overview Of The Project
The Cloud-First AI Development Platform is a modern web application built with React 19.2 and React Router v7 with React Server Components (RSC) that enables developers to offload heavy coding tasks to the cloud through AI-assisted development workflows. The platform leverages Vercel Sandboxes for running arbitrary code in isolated, ephemeral Linux VMs and Vercel's Workflow Development Kit (WDK) for build

ubuntu=62910eac-55e1-478e-bc18-fe9df708085a 

62910eac-55e1-478e-bc18-fe9df708085a

Align Left within margins 

calc((100vw - 1200px) / 2 + 5px)

3742. Maximum Path Score in a Grid

You are given an m x n grid where each cell contains one of the values 0, 1, or 2. You are also given an integer k. You start from the top-left corner (0, 0) and want to reach the bottom-right corner (m - 1, n - 1) by moving only right or down. Each cell contributes a specific score and incurs an associated cost, according to their cell values: 0: adds 0 to your score and costs 0. 1: adds 1 to your score and costs 1. 2: adds 2 to your score and costs 1. ​​​​​​​ Return the maximum score achievable without exceeding a total cost of k, or -1 if no valid path exists. Note: If you reach the last cell but the total cost exceeds k, the path is invalid.
/**
 * @param {number[][]} grid
 * @param {number} k
 * @return {number}
 */
var maxPathScore = function(grid, k) {
    const m = grid.length;
    const n = grid[0].length;

    // dp[i][j][c] = max score reaching (i,j) with cost c
    // Use -1  to represent unreachable
    const dp = Array.from({ length: m }, () =>
        Array.from ({ length: n }, () => Array(k + 1).fill(-1))
    );

    const startScore = grid[0][0];
    const startCost = (grid[0][0] === 0 ? 0 : 1);

    if (startCost <= k)

Text Based Button in Kajabi Email 

style="font-size: 18px; padding: 15px 30px; font-weight: bold; color: #ffffff; display: inline-block; text-decoration: none; line-height: 1.6; border-radius: 4px;background-color: #b8845e;"