SVG Optimizer

https://svgomg.net/

GA4 - menu - Bioderma

<script>
  window.dataLayer = window.dataLayer || [];
  window.dataLayer.push({
        event: 'navigation', // Name of the event
    // Common event parameters
    parameters: {
      parameter1: 'todos los productos', // categoría padre
      parameter2: 'corporal', // subcateogría
      parameter3: 'higiene corporal' // sección
  });
</script>

内部処理用のid(index)と外部公開用のUUIDを両方保持するテーブル設計

```sql
CREATE TABLE users (
    id BIGINT UNSIGNED AUTO_INCREMENT PRIMARY KEY,  -- 内部用(高速)
    uuid BINARY(16) NOT NULL UNIQUE,                 -- 外部公開用
    name VARCHAR(255),
    created_at TIMESTAMP DEFAULT CURRENT_TIMESTAMP,
    
    INDEX idx_uuid (uuid)
);

-- 挿入
INSERT INTO users (uuid, name) 
VALUES (UUID_TO_BIN(UUID(), 1), 'Taro');
```

### 使い分け
内部JOIN・FK: id (BIGINT)
APIレスポンス: uuid
URL: /users/{uuid}
ログ・デバッグ: id でも uuid でもどちらでも可

プリフライトリクエストについて

### ブラウザが自動で実施するケース
- GET、POST、HEAD 以外のメソッド(PUT、DELETE など)
- カスタムヘッダーを含む(Authorization、X-Custom-Header など)
- Content-Type が application/json など

### 実行順序

1. ブラウザがOPTIONSメソッドでプリフライトリクエストを送る
2. サーバーが許可情報(許可するオリジン・メソッド・ヘッダー)を返す
3. ブラウザが許可情報を検証し、本番リクエストが許可されているか判断する
4. 許可されていれば、ブラウザが本番リクエストを送る
5. サーバーがリクエストを処理する
6. サーバーがレスポンスを返す
7. ブラウザがレスポンスを受け取り、JavaScriptに結果が返る

### 送信側の構成要素
```javascript
const response = await fetch('http://localhost:8080/api/users', {
  method: 'OPTIONS',  // プリフライトは必ずOPTIONSメ

3010. Divide an Array Into Subarrays With Minimum Cost I

You are given an array of integers nums of length n. The cost of an array is the value of its first element. For example, the cost of [1,2,3] is 1 while the cost of [3,4,1] is 3. You need to divide nums into 3 disjoint contiguous subarrays. Return the minimum possible sum of the cost of these subarrays.
/**
 * @param {number[]} nums
 * @return {number}
 */
var minimumCost = function(nums) {
    const n = nums.length;

    // We must split into 3 subarrays, so n must be at least 3.
    // If n == 3, there's no choice: each element starts a subarray.
    if (n === 3) {
        return nums[0] + nums[1] + nums[2];
    }

    // -------------------------------
    // Step 1: Build suffix-min array
    // suffixMin[i] = minimum value in nums[i ... n-1]
    // -------------------------------
    const

C1 U14

H
the magic formula
invormative
a half of annual
quick fix
golden rule
60 seconds
iverwelm
templates

I
on the doldmine
like wildfire
nail on the head
scrolling
racking up
come up with

hump day
vege out
fit note
sick note
mama's boy
daddy's girl

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


______ JEANSON ANCHETA _______


💻💸 Fresh Logs Pricing 💸💻
🔐 UK Logs / Clean Bank Drops (GBP)
💰 10K GBP = $250
💰 12K GBP = $300
💰 16K GBP = $350
💰 20K GBP = $500
💰 30K GBP = $800

🛡️ Verified • HQ Access • Fast Delivery
💬 DM for escrow or direct 🔥
WESTERN UNION / MONEY GRAM/BANKS LOGINS/BANK TRANFERS/PAYPAL TRANSFERS WORLDWIDE/CASHAPP/ZELLLE/APPLE PAY/SKRILL/VENMO TRANSFER
Telegram:@JeansonCarder     
Group: https://t.me/+2__ynBAtFP00M2Fk                 
Group: https://t.me/+CsF2t7HvV_ljMmU8


Liquibase HOW-TO

# Liquibase HOW TO

## Modify changeset to be ignored by liquibase (if it causes issues)

Update the change set and replace the content with a comment for liquibase to let it pass.

```xml
<changeSet id="ignore-faulty-changeset" author="dev" runOnChange="false">
    <validCheckSum>ANY</validCheckSum>
    <comment>
        This changeset has been retired as the SQL was too demanding for the
        server. The original changeset attempted to move X records to a new
        table but the operation

744. Find Smallest Letter Greater Than Target

You are given an array of characters letters that is sorted in non-decreasing order, and a character target. There are at least two different characters in letters. Return the smallest character in letters that is lexicographically greater than target. If such a character does not exist, return the first character in letters.
/**
 * @param {character[]} letters
 * @param {character} target
 * @return {character}
 */
var nextGreatestLetter = function(letters, target) {
    // Binary search boundaries
    let left = 0;
    let right = letters.length - 1;

    // This will store the index of the smallest letter > target
    let answerIndex = -1;

    while (left <= right) {
        // Middle index
        let mid = Math.floor((left + right) / 2);

        // Case 1: letters[mid] is strictly greater than target
        /

CSS

def load_custom_css():
    st.markdown("""
        <style>
        /* Main container styling */
        .main {
            padding: 2rem;
        }
        
        /* Header styling */
        .custom-header {
            background: linear-gradient(90deg, #667eea 0%, #764ba2 100%);
            padding: 2rem;
            border-radius: 10px;
            color: white;
            text-align: center;
            margin-bottom: 2rem;
            box-shadow: 0 4px 6px rgba(0, 0, 0,

2977. Minimum Cost to Convert String II

You are given two 0-indexed strings source and target, both of length n and consisting of lowercase English characters. You are also given two 0-indexed string arrays original and changed, and an integer array cost, where cost[i] represents the cost of converting the string original[i] to the string changed[i]. You start with the string source. In one operation, you can pick a substring x from the string, and change it to y at a cost of z if there exists any index j such that cost[j] == z, original[j] == x, and changed[j] == y. You are allowed to do any number of operations, but any pair of operations must satisfy either of these two conditions: The substrings picked in the operations are source[a..b] and source[c..d] with either b < c or d < a. In other words, the indices picked in both operations are disjoint. The substrings picked in the operations are source[a..b] and source[c..d] with a == c and b == d. In other words, the indices picked in both operations are identical. Return the minimum cost to convert the string source to the string target using any number of operations. If it is impossible to convert source to target, return -1. Note that there may exist indices i, j such that original[j] == original[i] and changed[j] == changed[i].
/**
 * @param {string} source
 * @param {string} target
 * @param {string[]} original
 * @param {string[]} changed
 * @param {number[]} cost
 * @return {number}
 */
var minimumCost = function (source, target, original, changed, cost) {
    // A very large BigInt used to represent "infinity"
    const INF = BigInt("18446744073709551615");

    // Map each unique substring to a numeric ID
    const id = new Map();

    // Track all substring lengths that appear in rules
    const lens = new Set();

How to casting values in Java?

// (targetType) value

byte myNewByteValue = (myMinByteValue / 2)

// |  Error:
// |  incompatible types: possible lossy conversion from int to byte
// |  byte myNewByteValue = (myMinByteValue / 2);
// |                         ^----------------^

byte myNewByteValue = (byte) (myMinByteValue / 2)
myNewByteValue ==> -64

EXPLAIN

EXPLAIN FORMAT=JSON
SELECT
    id,
    status,
    freeRoundFeature
FROM
    AccountFreeSpin
WHERE 1
  AND id IN (1)
--- живой
EXPLAIN ANALYZE
    SELECT
    id,
    status,
    freeRoundFeature
FROM
    AccountFreeSpin
WHERE 1
  AND id IN (1)

表示中のセクション・その前後をCSSで判定する

<nav class="toc">
<ol class="toc-list">
  <li><a href="#section1" class="link">セクション1</a></li>
  <li><a href="#section2" class="link">セクション2</a></li>
  <li><a href="#section3" class="link">セクション3</a></li>
  <li><a href="#section4" class="link">セクション4</a></li>
</ol>
</nav>

<main>
<section id="section1" class="section">
  <h2>セクション1</h2>
</section>
<section id="section2" class="section">
  <h2>セクション2</h2>
</section>
<section id="section3" class="section">
  <h2>セクション3</h2>
</section>
<section id=

DLS3 - Project cd /project/2024/202404/202404.01/001/



# Load in study data
# -- for creating the 'unlinked' files, general demog checking, and eventually extracting the index date
create table prj20240401_demog(studyid varchar, first_name varchar, middle_initials varchar, last_name varchar, dob varchar, sex varchar, address_1 varchar, suburb varchar, address_3 varchar, postcode varchar, hsn_issued_date varchar);
\copy prj20240401_demog from minehealth.txt delimiter E'\t';
delete from prj20240401_demog where studyid='HSN_NUM';
#244085

# 

Geocoding

For all WACR records in WADLS, Epi have requested a one-off extract of:
-       WACR OID (raw, no encryption needed)
-       LGA (1996, 2001, 2006, 2011, 2016, 2021)
-       SLA (1996, 2001, 2006)
-       SA2 (2011, 2016, 2021)
______________________________________________________________

Total no. of records
>> SELECT COUNT(distinct lpno) AS total_count
FROM cancdata ;
 total_count
-------------
      632419
>>\pset format unaligned
>>\pset footer off
# Copy the required conten