1266. Minimum Time Visiting All Points

On a 2D plane, there are n points with integer coordinates points[i] = [xi, yi]. Return the minimum time in seconds to visit all the points in the order given by points. You can move according to these rules: In 1 second, you can either: move vertically by one unit, move horizontally by one unit, or move diagonally sqrt(2) units (in other words, move one unit vertically then one unit horizontally in 1 second). You have to visit the points in the same order as they appear in the array. You are allowed to pass through points that appear later in the order, but these do not count as visits.
/**
 * @param {number[][]} points
 * @return {number}
 */
var minTimeToVisitAllPoints = function(points) {
    // Total time accumulator
    let totalTime = 0;

    // Iterate through each consecutive pair of points
    for (let i = 1; i < points.length; i++) {
        const [x1, y1] = points[i - 1];
        const [x2, y2] = points[i];

        // Compute horizontal and vertical distances
        const dx = Math.abs(x2 - x1);
        const dy = Math.abs(y2 - y1);

        // The key insight:
   

Fresh CC Fullz Bank Logs Paypal Transfer WU Transfer Bug MoneyGram CashApp Zelle Venmo Apple Pay Skrill Transfer ATM Cards.



Scattered Spider (and allied group Scattered LAPSUS$ Hunters) 🌎 


VERIFIED CARDER SELLING WU,BANK,PAYPAL,CASHAPP,SKRILL TRANSFER BANK LOGS,DUMPS+PIN,CLONED CARDS

Telegram: JeansonTooL SELL CCV CANADA FULLZ FRESH SSN DOB WITH DL LIVE MAIL PASSWORD OFFICE365 PAYPAL

Telegram: JeansonTooL CVV,Fullz,Dumps,PayPal Debit/Credit Card,CashApp, Western Union, Transfer,ATM Clone Cards!!

Telegram: JeansonTooL SELL CVV FULLZ INFO GOOD USA-UK-CA-AU-INTER,PASS VBV/BIN/DOB

Telegram: JeansonTooL : Sell Dum

Docstring Google Style avanced

from typing import Dict, List
import pandas as pd
from sklearn.base import BaseEstimator
from sklearn.metrics import accuracy_score, f1_score

def evaluate_model(
    model: BaseEstimator,
    X_test: pd.DataFrame,
    y_test: pd.Series,
    metrics: List[str] = ["accuracy", "f1"]
) -> Dict[str, float]:
    """
    Evalúa un modelo de Machine Learning sobre un conjunto de prueba.

    Args:
        model (BaseEstimator): Modelo entrenado de scikit-learn.
        X_test (pd.DataFrame): Features d

2026-swap

inicio{
"host":"AK3YRLeLHqw25E0FHbdP5wNR94aH",
"portacmd":"AaEq2UGu9RWuJP1J",
"portaimg":"LszyUxibss3K2g==",
"pronto":"RlUKy4l8k2P+NI0=",
"ipv":"T7fcOpUzbaUY",
"contador":"pXKXcGdpkQbHgWZRvBFtQVs1K+jHOv1Zp3my+W1lbUf6560svItP1x5vw7FVBFvw+P4=",
"chaveid":"Gx52gh0LCfV/j9Cb",
"spammer":"wtcieGrF1vx6A38="
}fim

85. Maximal Rectangle

Given a rows x cols binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area.
/**
 * @param {character[][]} matrix
 * @return {number}
 */
var maximalRectangle = function (matrix) {
    // Edge case: empty matrix means no rectangle
    if (matrix.length === 0) return 0;

    const rows = matrix.length;
    const cols = matrix[0].length;

    // height[j] = number of consecutive '1's above (including current row)
    const height = new Array(cols).fill(0);

    // left[j]  = leftmost boundary (inclusive) where height[j] can extend
    const left = new Array(cols).fill(0);

How to add a element to a slice?

	s := []int{1, 2}

	s = append(s, 3)
	
	// Notes: Append returns a new slice 

stonespasupplies

/* Desktop – 6 columns */
.row.gap-desktop {
  display: flex;
  flex-wrap: wrap;
}

.row.gap-desktop > div {
  flex: 0 0 16.6667%;
  max-width: 16.6667%;
}

/* Tablet – 3 columns (optional but recommended) */
@media (max-width: 1200px) {
  .row.gap-desktop > div {
    flex: 0 0 33.3333%;
    max-width: 33.3333%;
  }
}

/* Mobile – 2 columns */
@media (max-width: 768px) {
  .row.gap-desktop > div {
    flex: 0 0 50%;
    max-width: 50%;
  }

  .row.gap-desktop .pt-1 a {
  padding: 8px 10px 4px 10

Hide Woocommerce Payment tabs for a specific user

Change email
add_action( 'admin_init', function () {
    if (
        wp_get_current_user()->user_email === 'office@theonlinebeautywarehouse.com.au' &&
        isset($_GET['page'], $_GET['tab']) &&
        $_GET['page'] === 'wc-settings' &&
        $_GET['tab'] === 'checkout'
    ) {
        wp_die( 'You are not allowed to access payment settings.' );
    }
});

712. Minimum ASCII Delete Sum for Two Strings

Given two strings s1 and s2, return the lowest ASCII sum of deleted characters to make two strings equal.
/**
 * @param {string} s1
 * @param {string} s2
 * @return {number}
 */
var minimumDeleteSum = function(s1, s2) {
    const n = s1.length;
    const m = s2.length;

    // dp[i][j] = minimum ASCII delete sum to make s1[i:] and s2[j:] equal
    const dp = Array.from({ length: n + 1 }, () => Array(m + 1).fill(0));

    // Base case: if s1 is empty, delete all remaining chars in s2
    for (let j = m - 1; j >= 0; j--) {
        dp[n][j] = dp[n][j + 1] + s2.charCodeAt(j);
    }

    // Base case: if

how to create an slice in Go?

// []T{e1, e2, e3, ...}
// Where T is the type of the elements (e.g., int, string, bool, struct), 
// and e1, e2, e3, etc., are the initial elements of the slice
fruits := []string{"Apple", "Banana", "Orange"}

Docker Portainer

services:
  portainer:
    container_name: portainer
    image: portainer/portainer-ce:latest
    ports:
      - 9000:9443
      # - 8000:8000
    volumes:
      - /var/run/docker.sock:/var/run/docker.sock
      # - ./data:/data
    restart: always

Ignore Permission Changes After Copying a Git Repository (Linux)


## Ignore Permission Changes After Copying a Git Repository (Linux)

**Purpose**
Resolve false Git changes caused by permission differences (e.g., executable bit) after copying a repository between Linux machines.

---

### Check current setting

```bash
git config --get core.fileMode
```

---

### Disable permission tracking for this repository

```bash
git config core.fileMode false
```

---

### Reset working tree to remove permission-only changes

```bash
git checkout -- .
```

---

**Notes

865. Smallest Subtree with all the Deepest Nodes

Given the root of a binary tree, the depth of each node is the shortest distance to the root. Return the smallest subtree such that it contains all the deepest nodes in the original tree. A node is called the deepest if it has the largest depth possible among any node in the entire tree. The subtree of a node is a tree consisting of that node, plus the set of all descendants of that node.
/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
 * @return {TreeNode}
 */
var subtreeWithAllDeepest = function(root) {
    // Helper DFS returns an object: { depth, node }
    // depth = max depth from this node downward
    // node = the subtree root that contains all dee

BAPI_GOODSMVT_CREATE 413 STOCK E

  METHOD move_batch.

    DATA: lt_return TYPE bapiret2_t.
    DATA: wt_zsd_trasf_log TYPE zsd_trasf_log.

    DATA: lv_index  TYPE sy-tabix.

    SELECT mblnr,
           mjahr,
           matnr,
           charg,
           werks,
           kdauf,
           kdpos,
           sjahr,
           smbln
      FROM mseg
      INTO TABLE @DATA(lt_mseg_413)
      WHERE bwart = @mc_trasf
        AND kdauf = @mv_salesdocument.

    SELECT mblnr,
           mjahr,
           matnr,
           charg,
  

how to compare arrays in go?

// In Go, arrays are value types, so they can be compared directly if their elements are comparable.

a := [3]int{1, 2, 3}
b := [3]int{1, 2, 3}
c := [3]int{3, 2, 1}

fmt.Println(a == b) // true
fmt.Println(a == c) // false