ChatGPT Gratuit : une révolution numérique à portée de main 

Dans le monde digital actuel, l’intelligence artificielle occupe une place de plus en plus centrale. Parmi les outils qui transforment notre manière de travailler, d’apprendre et de communiquer, ChatGPT Gratuit s’impose comme une solution incontournable. Accessible en ligne, sans abonnement coûteux, il offre aux particuliers comme aux professionnels une nouvelle façon d’interagir avec la technologie.

Qu’est-ce que ChatGPT Gratuit ?

ChatGPT Gratuit est un modèle de langage avancé, capable de gé

Audit serial number against Active Directory 

$CommandText = @"
SELECT
	[t1].[computer_id]
	, [t1].[name]
    , [t1].[serial_num]
    , [t1].[last_inventory]
	, [GS] = (SELECT TOP 1 UPPER([hostname]) FROM mmsettings)
FROM
	[computer] [t1]
"@

$GSSQLData = @()
$GSServers = Get-GSServers
foreach ($GSServer in $GSServers) {
    $GSSQLData += Get-GSSQLData -Instance "$GSServer\SQLEXPRESS" -Database "eXpress" -CommandText $CommandText
}
$GSSQLDataByGS = $GSSQLData | Sort-Object -Property GS
 
if ( ($GSSQLDataByGS | Measure-Obje

Identify serial devices tty 

# How to identify serial device tty
[Source](https://superuser.com/a/1095432/393146)

You can check the current tty connection configuration using ```cat```.

```
# cat /proc/tty/driver/serial
serinfo:1.0 driver revision:
0: uart:16550A port:000003F8 irq:4 tx:0 rx:0
1: uart:16550A port:000002F8 irq:3 tx:111780 rx:1321 RTS|DTR|DSR
2: uart:unknown port:000003E8 irq:4
3: uart:unknown port:000002E8 irq:3
```

* A line with uart:unknown means: nothing detected (and likely not existent)
* CTS, DSR, (D

☁️ AWS VPC Learning 

# VPC et Subnets
## Image Globale
Un VPC est comme un étage entier loué dans l'immense gratte-ciel AWS.
Cet étage est complètement isolé des autres locataires, personne ne pouvant y entrer ou y sortir sans autorisation.

## Subnets
Un étage vide n'est pas très utile. On va vouloir y aménager des pièces pour différentes fonctions.
C'est là qu'internviennent les **subnets** (ou **sous-réseaux**).
Un subnet est simplement une subdivision d'un VPC, un peu comme une ou plusieurs pièces de l'étage.

#

966. Vowel Spellchecker

Given a wordlist, we want to implement a spellchecker that converts a query word into a correct word. For a given query word, the spell checker handles two categories of spelling mistakes: Capitalization: If the query matches a word in the wordlist (case-insensitive), then the query word is returned with the same case as the case in the wordlist. Example: wordlist = ["yellow"], query = "YellOw": correct = "yellow" Example: wordlist = ["Yellow"], query = "yellow": correct = "Yellow" Example: wordlist = ["yellow"], query = "yellow": correct = "yellow" Vowel Errors: If after replacing the vowels ('a', 'e', 'i', 'o', 'u') of the query word with any vowel individually, it matches a word in the wordlist (case-insensitive), then the query word is returned with the same case as the match in the wordlist. Example: wordlist = ["YellOw"], query = "yollow": correct = "YellOw" Example: wordlist = ["YellOw"], query = "yeellow": correct = "" (no match) Example: wordlist = ["YellOw"], query = "yllw": correct = "" (no match) In addition, the spell checker operates under the following precedence rules: When the query exactly matches a word in the wordlist (case-sensitive), you should return the same word back. When the query matches a word up to capitlization, you should return the first such match in the wordlist. When the query matches a word up to vowel errors, you should return the first such match in the wordlist. If the query has no matches in the wordlist, you should return the empty string. Given some queries, return a list of words answer, where answer[i] is the correct word for query = queries[i].
/**
 * @param {string[]} wordlist
 * @param {string[]} queries
 * @return {string[]}
 */
var spellchecker = function(wordlist, queries) {
    // Helper function to normalize vowels in a word
    const normalizeVowels = (word) => {
        return word.toLowerCase().replace(/[aeiou]/g, '*');
    };

    // Step 1: Build lookup structures
    const exactWords = new Set(wordlist); // For exact match
    const caseInsensitiveMap = new Map(); // For case-insensitive match
    const vowelErrorMap = new

K8S | MariaDB Galera 

# ===============================
# Secrets for MariaDB and MaxScale
# ===============================
apiVersion: v1
kind: Secret
metadata:
  name: mariadb-root-secret
  namespace: mariadb-ha
stringData:
  password: aaaaaaPDaA8fKDv

# ===============================
# MySQL Configuration (ConfigMap)
# ===============================

---
apiVersion: v1
kind: ConfigMap
metadata:
  name: mariadb-config
  namespace: mariadb-ha
data:
  my.cnf: |
    [mariadb]
    skip-name-resolve
    
    max_allo

TinyMCE WYSIWYG HTML Editor 

<!doctype html>
<html lang="he">
<meta charset="utf-8">

<head>
  <script src="https://cdn.tiny.cloud/1/API_KEY_FROM_TINYME_WEBSITE/tinymce/8/tinymce.min.js" referrerpolicy="origin" crossorigin="anonymous"></script>
</head>

<body>

<div style="width: 50%; display: block; margin-left: auto; margin-right: auto; text-align: center; ; direction: rtl;">
    <h2>TinyMCE - דוגמה</h2>
    <textarea id="test_textarea">
      ברוכים הבאים ל-TinyMCE
    </textarea>
</div>

<script>
    t

CKEditor 5 WYSIWYG HTML Editor - using Vanilla JS 

<!doctype html>
<html lang="en">
	<head>
		<meta charset="utf-8">
		<title>CKEditor 5 Sample</title>
		<link rel="stylesheet" href="./style.css">
		<link rel="stylesheet" href="https://cdn.ckeditor.com/ckeditor5/46.1.0/ckeditor5.css" crossorigin>
	</head>
	<body>
		<div class="main-container">
			<div class="editor-container editor-container_classic-editor editor-container_include-fullscreen" id="editor-container">
				<div class="editor-container__editor"><div id="editor"></div></div

GET_DATA 

import yfinance as yf
import pandas as pd
from datetime import datetime, timedelta
import logging
 
def get_data(symbols, start_date, end_date=None, frequency='daily'):
 
    """
    Fetches historical data for one or more ETFs using yfinance.
 
    Args:
        symbols (str or list of str): Ticker symbol(s) of the ETF(s).
        start (str): Start date for data retrieval (YYYY-MM-DD).
        end (str, optional): End date for data retrieval (YYYY-MM-DD).

Investment 

OSKAR 100% vermögenwirksame Leistungen komplett in ETF -> nur bei OSKAR

Bücher:
Gottfried Heller "Der einfache Weg zum Wohlstand"
TODO
Sparkasse

- Union Pacific (Schienenverkehr) USA
Konkurent BSNF 
Faierer Wert 200 Euro
KGV 17,4
Cash Flow
Dividentet 2,7
Wächst 13,7

- Johnson & Johnson
Konkurent Rosh
KGV 16
Fairer Wert 170
Dividended 2,7

- Apple
Fairer Preis 103
Cashflow 5 %
Dividenden 0,56

- Altria (Tabac)
Riskant
Fiarer Wert 70$ = Gewinn pro Aktie 4,84 * 10 Jahres KGV 14,4
Kurs 45 $
Cashf

Le Coloriage Enfants : une activité essentielle pour le développement 

Accéder à des coloriages de qualité n'a jamais été aussi simple. Le web regorge de ressources gratuites qui vous permettent d'imprimer des dessins directement chez vous, sans frais. C'est une solution pratique et économique pour divertir les enfants à tout moment. Pour une source fiable et variée, consultez https://coloriageenfants.com/. Il vous suffit d'un clic pour trouver le dessin parfait pour votre enfant.

3541. Find Most Frequent Vowel and Consonant

You are given a string s consisting of lowercase English letters ('a' to 'z'). Your task is to: Find the vowel (one of 'a', 'e', 'i', 'o', or 'u') with the maximum frequency. Find the consonant (all other letters excluding vowels) with the maximum frequency. Return the sum of the two frequencies. Note: If multiple vowels or consonants have the same maximum frequency, you may choose any one of them. If there are no vowels or no consonants in the string, consider their frequency as 0. The frequency of a letter x is the number of times it occurs in the string.
/**
 * @param {string} s
 * @return {number}
 */
var maxFreqSum = function(s) {
    // Step 1: Define vowels for easy lookup
    const vowels = new Set(['a', 'e', 'i', 'o', 'u']);

    // Step 2: Create frequency maps for vowels and consonants
    const vowelFreq = {};
    const consonantFreq = {};

    // Step 3: Loop through each character in the string
    for (let char of s) {
        if (vowels.has(char)) {
            // It's a vowel
            vowelFreq[char] = (vowelFreq[char] || 0) + 1

ZSH Config 

# Amazon Q pre block. Keep at the top of this file.
[[ -f "${HOME}/Library/Application Support/amazon-q/shell/zshrc.pre.zsh" ]] && builtin source "${HOME}/Library/Application Support/amazon-q/shell/zshrc.pre.zsh"
# Enable Powerlevel10k instant prompt. Should stay close to the top of ~/.zshrc.
# Initialization code that may require console input (password prompts, [y/n]
# confirmations, etc.) must go above this block; everything else may go below.
# if [[ -r "${XDG_CACHE_HOME:-$HOME/.cache}/p10k-

Arreglar vistas en blanco en laravel

Arreglar vistas en blanco en laravel
php artisan view:clear

CSS if 

<!--
https://jsbin.com/kiliyineca/2/edit?html,css,output
-->



<!--  /// 1 /// -->	

<!-- .btn -->
<div class="btn" style="--status: success">Success</div>
<div class="btn" style="--status: danger">Danger</div>
<div class="btn" style="--status: warning">Warning</div>	
<div class="btn">Else</div>	
	
<!-- .cover -->	
<div class="cover" style="--priority: medium;">Iam Cover</div>
	
	
<!-- .container -->	
<div class="container">Container</div>
	
	
	
<!--  /// 2 /// -->

3227. Vowels Game in a String

Alice and Bob are playing a game on a string. You are given a string s, Alice and Bob will take turns playing the following game where Alice starts first: On Alice's turn, she has to remove any non-empty substring from s that contains an odd number of vowels. On Bob's turn, he has to remove any non-empty substring from s that contains an even number of vowels. The first player who cannot make a move on their turn loses the game. We assume that both Alice and Bob play optimally. Return true if Alice wins the game, and false otherwise. The English vowels are: a, e, i, o, and u.
/**
 * @param {string} s
 * @return {boolean}
 */
var doesAliceWin = function(s) {
    // Define a set containing all lowercase English vowels
    const vowels = new Set(['a', 'e', 'i', 'o', 'u']);
    let prefixParity = new Set();
    // Initialize a counter to track the number of vowels in the string
    let count = 0;

    // Add initial parity (empty prefix)
    prefixParity.add(0);

    // Loop through each character in the string
    for (let char of s) {
        // If the character is a v