Export network agents email addresses from outlook to csv to be imported to sendmsg

Option Explicit

Function GetRecipientSMTPAddress(recip As Outlook.Recipient) As String

    Dim pa As Outlook.PropertyAccessor
    Dim smtpAddress As String
    Dim exchUser As Outlook.ExchangeUser

    On Error Resume Next

    If recip.AddressEntry.Type = "EX" Then
        Set exchUser = recip.AddressEntry.GetExchangeUser

        If Not exchUser Is Nothing Then
            smtpAddress = exchUser.PrimarySmtpAddress
        End If
    End If

    If smtpAddress = "" Then
   

how to run a logged test on canada billpyament

E2E_AUTH_TOKEN='JWT' E2E_BASE_URL='http://localhost:3002/' npx playwright test

3612. Process String with Special Operations I

You are given a string s consisting of lowercase English letters and the special characters: *, #, and %. Build a new string result by processing s according to the following rules from left to right: If the letter is a lowercase English letter append it to result. A '*' removes the last character from result, if it exists. A '#' duplicates the current result and appends it to itself. A '%' reverses the current result. Return the final string result after processing all characters in s.
/**
 * @param {string} s
 * @return {string}
 */
var processStr = function(s) {
    let res = [];

    for (const ch of s) {
        if (ch >= 'a' && ch <= 'z') {
            // Append letter
            res.push(ch);

        } else if (ch === '*') {
            // Remove last char if exists
            if (res.length > 0) res.pop();

        } else if (ch === '#') {
            // Duplicate the entire result
            res = res.concat(res);

        } else if (ch === '%') {
            // Re

Top Mem Setup

# topmem Script Setup Notes

**Machine:** Lenovo ThinkPad T14 Gen 2
**OS:** Ubuntu 24.04 LTS (Dual Boot)
**Date:** March 24, 2026

---

## Overview

`topmem` is a shell script that shows memory usage aggregated by process name. Unlike `ps aux` which lists every individual process instance separately, `topmem` collapses multiple instances of the same program (e.g. multiple `node` or `chrome` processes) and shows their combined memory footprint — making it easy to answer "which application is usin

Top Cpu Setup

# topcpu Script Setup Notes

**Machine:** Lenovo ThinkPad T14 Gen 2
**OS:** Ubuntu 24.04 LTS (Dual Boot)
**Date:** March 24, 2026

---

## Overview

`topcpu` is a shell script that shows CPU usage aggregated by process name. Unlike `ps aux` which lists every individual process instance separately, `topcpu` collapses multiple instances of the same program (e.g. multiple `node` or `chrome` processes) and shows their combined CPU footprint — making it easy to answer "which application is consuming 

Monitoring - Top Mem with Watcher

#!/bin/bash

WATCH=false
INTERVAL=30
COUNT=10

if [[ "$1" == "-w" ]]; then
    WATCH=true
    [[ -n "$2" && "$2" =~ ^[0-9]+$ ]] && INTERVAL="$2"
elif [[ -n "$1" ]]; then
    COUNT="$1"
fi

run() {
    free -h | awk '/^Mem:/ {printf "Memory: %s used / %s total\n", $3, $2}'
    echo "────────────────────────────────────────"
    ps aux | awk 'NR>1 {mem[$11]+=$4} END {for (p in mem) printf "%6.2f%% %s\n", mem[p], p}' | sort -nr | head -n "$COUNT"
}

if $WATCH; then
    while true; do
        clear

Monitoring - Top Cpu with Watcher

#!/bin/bash

WATCH=false
INTERVAL=30
COUNT=10

if [[ "$1" == "-w" ]]; then
    WATCH=true
    [[ -n "$2" && "$2" =~ ^[0-9]+$ ]] && INTERVAL="$2"
elif [[ -n "$1" ]]; then
    COUNT="$1"
fi

run() {
    cpu_used=$(top -bn1 | grep '%Cpu' | awk '{printf "%.1f", 100 - $8}')
    cores=$(nproc)
    printf "CPU: %s%% used / %s cores total\n" "$cpu_used" "$cores"
    echo "────────────────────────────────────────"
    ps aux | awk 'NR>1 {cpu[$11]+=$3} END {for (p in cpu) printf "%6.2f%% %s\n", cpu[p], p}

BlogPosting schema

<script type="application/ld+json">
[
  {
    "@context": "https://schema.org",
    "@type": "BlogPosting",
    "headline": {{ article.title | json }},
    "description": {% if article.excerpt != blank %}{{ article.excerpt | strip_html | truncate: 300 | json }}{% else %}{{ article.content | strip_html | truncate: 300 | json }}{% endif %},
    "image": [
      {% if article.image != blank %}{{ article.image | image_url: width: 800 | prepend: 'https:' | json }}{% else %}""{% endif %}
    ],
    "a

2095. Delete the Middle Node of a Linked List

You are given the head of a linked list. Delete the middle node, and return the head of the modified linked list. The middle node of a linked list of size n is the ⌊n / 2⌋th node from the start using 0-based indexing, where ⌊x⌋ denotes the largest integer less than or equal to x. For n = 1, 2, 3, 4, and 5, the middle nodes are 0, 1, 1, 2, and 2, respectively.
/**
 * Definition for singly-linked list.
 * function ListNode(val, next) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.next = (next===undefined ? null : next)
 * }
 */
/**
 * @param {ListNode} head
 * @return {ListNode}
 */
var deleteMiddle = function(head) {
    // 1. Edge case: only one node
    if (!head.next) return null;

    // 2. Find the node BEFORE the middle
    let slow = head;
    let fast = head.next.next;

    while (fast && fast.next) {
        slow = slow.next;
   

Получение xml заказа

/bitrix/admin/1c_exchange.php?type=sale&mode=checkauth
/bitrix/admin/1c_exchange.php?type=sale&mode=init&sessid=ID_Сессии
/bitrix/admin/1c_exchange.php?type=sale&mode=query&sessid=ID_Сессии

IELTS 5 -12

B
B
C
C
A
hills
bus
5
picnic
map
B
E
D - A
F
G
D
B
C
I - H
A
D
A
H
E - B
G
sand
lower part
? undercut
? the coastguard
mobile phones
personality
numerous  - mean
verbal
psychological 
? literacy
extremes
assessment? - interpretation
brain damage
school
reliability

Vocabulary:
red tape
ears poped

image.md

Here are five distinct iterations of the Chicano tattoo-style theme, each expanding the narrative and scenery while maintaining the fineline black-and-grey aesthetic on vintage parchment.

### 1. The Boulevard Cruise
This scene shifts focus to a late-night cruise down Whittier Boulevard. The **Chevrolet lowrider** is depicted in motion, its front end hopped high in a "three-wheel motion" stance, captured with dynamic motion lines and blurred stippling. The **two skeleton figures** are seated 

2130. Maximum Twin Sum of a Linked List

In a linked list of size n, where n is even, the ith node (0-indexed) of the linked list is known as the twin of the (n-1-i)th node, if 0 <= i <= (n / 2) - 1. For example, if n = 4, then node 0 is the twin of node 3, and node 1 is the twin of node 2. These are the only nodes with twins for n = 4. The twin sum is defined as the sum of a node and its twin. Given the head of a linked list with even length, return the maximum twin sum of the linked list.
/**
 * Definition for singly-linked list.
 * function ListNode(val, next) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.next = (next===undefined ? null : next)
 * }
 */
/**
 * @param {ListNode} head
 * @return {number}
 */
var pairSum = function(head) {
    // 1. Find middle using slow/fast pointers
    let slow = head, fast = head;
    while (fast && fast.next) {
        slow = slow.next;
        fast = fast.next.next;
    }

    // 2. Reverse second half
    let prev = null, curr

Claude - Settings

{
  "outputStyle": "Explanatory",
  "enableAllProjectMcpServers": true,
  "permissions": {
    "defaultMode": "acceptEdits",
    "allow": ["Read", "Skill", "Bash", "Ide*", "WebSearch", "WebFetch", "mcp__*"]
  }
}

3838. Weighted Word Mapping

You are given an array of strings words, where each string represents a word containing lowercase English letters. You are also given an integer array weights of length 26, where weights[i] represents the weight of the ith lowercase English letter. The weight of a word is defined as the sum of the weights of its characters. For each word, take its weight modulo 26 and map the result to a lowercase English letter using reverse alphabetical order (0 -> 'z', 1 -> 'y', ..., 25 -> 'a'). Return a string formed by concatenating the mapped characters for all words in order.
/**
 * @param {string[]} words
 * @param {number[]} weights
 * @return {string}
 */
var mapWordWeights = function(words, weights) {
    let out = "";

    for (const w of words) {
        let sum = 0;

        // Sum weights of characters
        for (const ch of w) {
            sum += weights[ch.charCodeAt(0) - 97]; // 'a' = 97
        }

        // Modulo 26
        const v = sum % 26;

        // Reverse alphabetical mapping: 0→'z', 1→'y', ..., 25→'a'
        const mapped = String.fromCharCo

chatGPT

Je veux comprendre Fabric en profondeur.

Mon niveau : développeur Python/Django.

Explique-moi d’abord le problème que cette technologie résout, 

Puis les concepts clés, puis un exemple simple, puis un cas réel professionnel. 

Pose-moi des questions pour vérifier ma compréhension.