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

Weplayed

# site example: https://gocamels.com/
<script>
  require(['//media.weplayed.com/widget/v1/widget.js'], function ($) {

    // 1) Fix: aria-hidden="true" must not be focusable
    function fixAriaHiddenFocusable(root = document) {
      let changed = false;
      root.querySelectorAll('[aria-hidden="true"][tabindex]').forEach(el => {
        const ti = el.getAttribute('tabindex');
        if (ti === '0') {
          el.setAttribute('tabindex', '-1');
          changed = true;
        }
      });
      return changed;
  

DBT - DATA FLOW (exemple du template)

# Flux de donnรฉes dbt โ€” Vue complรจte

## Schรฉma global

```
โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
โ”‚                              FICHIERS SOURCE                                โ”‚
โ”œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ค
โ”‚                                                                             โ”‚
โ”‚   seeds/sample_data/              seeds/reference/                          โ”‚
โ”‚   โ”œโ”€โ”€ raw_customers.csv           โ”œโ”€โ”€ 

DUCKDB - CLI - CheatSheet - Quick Inspection

# DuckDB CLI โ€” Cheatsheet inspection

## Ouvrir une base

```bash
duckdb dev.duckdb
```

## Schemas

```sql
-- Lister tous les schemas
SELECT * FROM duckdb_schemas();

-- Filtrer les schemas utilisateur (non internes)
SELECT schema_name FROM duckdb_schemas() WHERE internal = false;

-- Schema courant
SELECT current_schema();

-- Changer de schema
USE main_raw_dev;
```

## Tables

```sql
-- Lister toutes les tables (tous schemas)
SHOW ALL TABLES;

-- Lister les tables du schema courant
SHOW TABLE

ใ‚ตใ‚คใƒˆAใ‹ใ‚‰ใ‚ตใ‚คใƒˆBใซ็€ๅœฐใ—ใŸไบบๆ•ฐใ‚’ใ‚ตใ‚คใƒˆAใซ้€ไฟกใ™ใ‚‹

# ใ‚ฏใƒญใ‚นใ‚ตใ‚คใƒˆใ‚ณใƒณใƒใƒผใ‚ธใƒงใƒณ่จˆๆธฌ๏ผˆimg ใƒ”ใ‚ฏใ‚ปใƒซๆ–นๅผ๏ผ‰

ใ‚ตใ‚คใƒˆA๏ผˆ้€ๅฎขๅ…ƒ๏ผ‰ใ‹ใ‚‰ใ‚ตใ‚คใƒˆB๏ผˆ้€ๅฎขๅ…ˆ๏ผ‰ใธใฎ้ท็งปใ‚’่จˆๆธฌใ™ใ‚‹ๆฑŽ็”จ็š„ใชๆ‰‹ๆณ•ใ€‚
CMS ใ‚„็‰นๅฎšใฎใ‚ตใƒผใƒ“ใ‚นใซไพๅญ˜ใ—ใชใ„ใ€ใƒ”ใƒฅใ‚ข HTML + JavaScript ใงๅฎŸ็พใงใใ‚‹ใ‚ขใƒ—ใƒญใƒผใƒใ€‚

---

## ๅ‰ๆ

- ใ‚ตใ‚คใƒˆA ใจใ‚ตใ‚คใƒˆB ใฏ็•ฐใชใ‚‹ใƒ‰ใƒกใ‚คใƒณใง้‹็”จใ•ใ‚Œใฆใ„ใ‚‹
- ใ‚ตใ‚คใƒˆB ใซใฏ่ค‡ๆ•ฐใฎๆตๅ…ฅ็ตŒ่ทฏใŒใ‚ใ‚Šใ€ใ‚ตใ‚คใƒˆA ็ตŒ็”ฑใฎใƒฆใƒผใ‚ถใƒผใฎใฟใ‚’่ญ˜ๅˆฅใƒป่จˆๆธฌใ—ใŸใ„
- ใ‚ตใ‚คใƒˆA ๅดใซ่จˆๆธฌใƒ‡ใƒผใ‚ฟใ‚’ๅ—ใ‘ๅ–ใ‚‹ API ใ‚จใƒณใƒ‰ใƒใ‚คใƒณใƒˆใŒๅญ˜ๅœจใ™ใ‚‹

---

## ๆ‰‹้ †ๆฆ‚่ฆ

### 1. ใ‚ตใ‚คใƒˆA โ†’ ใ‚ตใ‚คใƒˆB ใธใฎใƒ‘ใƒฉใƒกใƒผใ‚ฟไป˜ใ้ท็งป

ใ‚ตใ‚คใƒˆA ใ‹ใ‚‰ใ‚ตใ‚คใƒˆB ใธใฎ้ท็งปใƒชใƒณใ‚ฏใซใ€ไธ€ๆ„ใฎ่ญ˜ๅˆฅๅญใ‚’ใƒ‘ใƒฉใƒกใƒผใ‚ฟใจใ—ใฆไป˜ไธŽใ™ใ‚‹ใ€‚

```
https://siteb.hoge?id=fuga123
```

ใ“ใฎ่ญ˜ๅˆฅๅญ๏ผˆไปฅไธ‹ `click_id`๏ผ‰ใซใ‚ˆใ‚Šใ€ใ‚ตใ‚คใƒˆB ๅดใงใ€Œใ‚ตใ‚คใƒˆA ็ตŒ็”ฑใฎๆตๅ…ฅใงใ‚ใ‚‹ใ€ใจๅˆคๅฎšใงใใ‚‹ใ€‚

### 2. ใ‚ตใ‚คใƒˆB ๅดใง URL ใƒ‘ใƒฉใƒกใƒผใ‚ฟใ‚’ Cookie ใซไฟๅญ˜

ใ‚ตใ‚คใƒˆB ใฎ LP๏ผˆใƒฉใƒณใƒ‡ใ‚ฃใƒณใ‚ฐใƒšใƒผใ‚ธ๏ผ‰ใงใ€URL ใƒ‘ใƒฉใƒกใƒผใ‚ฟใ‹

DBT - dbt seed

# dbt seed โ€” Guide pรฉdagogique

## Ce que `dbt seed` fait

1. **Parse** les fichiers YAML pour connaรฎtre la configuration (schema, types, colonnes)
2. **Pour chaque fichier CSV** dans `seeds/` :
   - Supprime la table si elle existe (DROP)
   - Crรฉe la table avec les types dรฉfinis (CREATE)
   - Insรจre les donnรฉes du CSV (INSERT)

## Ce que `dbt seed` ne fait PAS

| Action | Commande |
|--------|----------|
| Exรฉcuter les models | `dbt run` |
| Exรฉcuter les tests | `dbt test` |
| Compiler le SQL 

DBT - Cascade de Configuration

# Cascade de configuration dbt

## Principe

dbt applique les configurations par hรฉritage : le niveau le plus spรฉcifique gagne toujours.

## Niveaux de prioritรฉ

```
โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
โ”‚  1. config() dans le fichier SQL        โ† Plus spรฉcifique   โ”‚
โ”œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ค
โ”‚  2. Fichier YAML (_seeds.yml, _models.yml)                  โ”‚
โ”œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ค
โ”‚  3. dbt_proj