3714. Longest Balanced Substring II

You are given a string s consisting only of the characters 'a', 'b', and 'c'. A substring of s is called balanced if all distinct characters in the substring appear the same number of times. Return the length of the longest balanced substring of s.
/**
 * @param {string} s
 * @return {number}
 */
var longestBalanced = function(s) {
    const n = s.length;
    let ans = 0;

    // 1) Case: only one distinct character (runs like "aaaa")
    ans = Math.max(ans, longestSingleCharRun(s));

    // 2) Case: exactly two distinct characters with equal counts, no third present
    // Pairs: (a, b), (a, c), (b, c)
    ans = Math.max(ans, longestEqualTwoChars(s, 'a', 'b', 'c'));
    ans = Math.max(ans, longestEqualTwoChars(s, 'a', 'c', 'b'));
    ans

cloudinary_config 

//dependency:
		<dependency>
			<groupId>com.cloudinary</groupId>
			<artifactId>cloudinary-http44</artifactId>
			<version>1.32.2</version>
		</dependency>
		
//entity:
@Column(name = "image", nullable = true)
private String imageUrl; // saves url

//service:
import org.springframework.stereotype.Service;

import com.cloudinary.Cloudinary;
import com.cloudinary.utils.ObjectUtils;
import org.springframework.beans.factory.annotation.Value;

@Service
public class CloudinaryService {
    private fi

Css anchor example 

<!DOCTYPE html>
<html lang="cs">
<head>
    <meta charset="UTF-8">
    <title>CSS Anchor Positioning Demo 2026</title>
    <style>
        /* Pomocný styling pro demo */
        body {
            margin: 0;
            font-family: sans-serif;
        }

        section {
            height: 100vh;
            background: orange;
            display: flex;
            align-items: center;
            justify-content: center;
            font-size: 2rem;
            color: whi

application.properties 

# for env
spring.config.import=optional:file:.env[.properties]

# for spring project
spring.application.name=
server.port=${SPRING_PORT}

# for database
spring.datasource.url=${SPRING_DATASOURCE_URL}
spring.datasource.username=${SPRING_DATASOURCE_USERNAME}
spring.datasource.password=${SPRING_DATASOURCE_PASSWORD}

spring.datasource.driver-class-name=org.postgresql.Driver
spring.jpa.database-platform=org.hibernate.dialect.PostgreSQLDialect
spring.jpa.hibernate.ddl-auto=update
# opti

env config 

#for Spring
SPRING_PORT=7070

#for DB
SPRING_DATASOURCE_URL=jdbc:postgresql://localhost:5432/
SPRING_DATASOURCE_USERNAME=postgres
SPRING_DATASOURCE_PASSWORD=

#for jwt
JWT_SECRET_KEY=

#for mail
SUPPORT_EMAIL=
APP_PASSWORD=

#for Cloudinary
CLOUDINARY_NAME=
CLOUDINARY_KEY=
CLOUDINARY_SECRET=

PYQGIS script - convert et export Vecteurs et WFS layers en rester (Projet Moindre Impact) 

import processing
import os
import tempfile
import math
from qgis.core import (
    QgsProject,
    QgsVectorLayer,
    QgsRasterLayer,
    QgsRasterPipe,
    QgsRasterFileWriter,
    QgsProcessingFeedback,
    QgsWkbTypes
)

# ======================
# PARAMÈTRES
# ======================

output_dir = r"R:/Ingénierie et Études techniques/Documentation Interne/Etudes Projet Ingé/4 Données SIG/RASTER_QGIS_TEST"
temp_dir = r"C:\temp"

pixel_size = 3
no_data_value = 0
buffer_d

3713. Longest Balanced Substring I

You are given a string s consisting of lowercase English letters. A substring of s is called balanced if all distinct characters in the substring appear the same number of times. Return the length of the longest balanced substring of s.
/**
 * @param {string} s
 * @return {number}
 */
var longestBalanced = function(s) {
    const n = s.length;
    let maxLen = 0;

    // Try every possible starting index i
    for (let i = 0; i < n; i++) {

        // Frequency array for 'a' to 'z'
        const freq = Array(26).fill(0);

        // Expand the substring from i to j
        for (let j = i; j < n; j++) {
            const idx = s.charCodeAt(j) - 97; // map 'a'..'z' to 0..25
            freq[idx]++;

            // Check if substr

Telegram:@lazarustoolz PayPal Transfer, CashApp,Skrill,Zelle,Venmo, ATM Skimmer Bank Logs 


--------------------------------- LAZARUS GROUP-----------------------------------


Welcome to Lazarus Group! Our team is always ready to provide the best service in the field of verification, account warmup, and drop services anywhere in the world.
https://t.me/lazarustoolz- catalog with current prices and the ability to purchase with instant delivery
The stock of products in the store is replenished daily (if the product you need is not available, write to our manager to clarify the details)

backup_data_insert 

pg_dump --host 100.101.10.90 --port 5432 --username uma_centos105 --table=XXX --data-only --column-inserts uma_centos105 > data.sql

Telegram:@lazarustoolz Bank To Bank Drop Wire Logs PayPal Zelle Venmo Apple Pay Skrill WU Transfer Bug MoneyGram Transfer 

\______\_ LAZARUS GROUP______\_

             🌎 

💻💸 Fresh Logs Pricing 💸💻

🔐 UK/US 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:@lazarustoolz      

Group: [https://t.me/+2__ynBAtFP00M2Fk](https://t.me/+2__yn

3721. Longest Balanced Subarray II

You are given an integer array nums. A subarray is called balanced if the number of distinct even numbers in the subarray is equal to the number of distinct odd numbers. Return the length of the longest balanced subarray.
/**
 * Longest Balanced Subarray:
 * A subarray is balanced if the number of DISTINCT even values
 * equals the number of DISTINCT odd values.
 *
 * This solution uses:
 *  - value compression
 *  - tracking first occurrences of each value
 *  - a segment tree with lazy propagation
 *  - sliding left boundary
 *
 * It is the official O(n log n) solution.
 */

var longestBalanced = function(nums) {
    const n = nums.length;
    if (n === 0) return 0;

    // -------------------------------------

Azure AD/Intune Device Export using MS Graph

MS Graph script to export all devices information from EntraID environment note - alternative option is to 'export' from GUI of Devices|All devices
#Providing scope definition
Connect-MgGraph -Scopes "Device.Read.All"

<#Get all devices and export to AllDevices.csv path - include columns specified under "Select-Object".
- find additional fields to include beyond:
DisplayName
operating system
operating system version
registration date/time
last logon date/time
account enabled status
compliance?
compliance grace period?
ownership
#>
Get-MgDevice -All | Select-Object DisplayName, OperatingSystem, OperatingSystemVersion, Registra

Статусы задач 

Ready to test → In testing → ТП (Testing Passed) → Ready for release → Prod

カードレイアウト(grid) 

.grid {
  display: block grid;
  grid-template-columns: repeat(auto-fill, minmax(min(20rem, 100%), 1fr));
  gap: 1.5rem;
}

min-width(指定値以下では100%表示) 

.main_column {
  min-width: min(320px, 100%);
}

3719. Longest Balanced Subarray I

You are given an integer array nums. A subarray is called balanced if the number of distinct even numbers in the subarray is equal to the number of distinct odd numbers. Return the length of the longest balanced subarray.
/**
 * @param {number[]} nums
 * @return {number}
 */
var longestBalanced = function(nums) {
    const n = nums.length;
    let maxLen = 0;

    // Fix a starting index i
    for (let i = 0; i < n; i++) {
        // For each new start, we reset the distinct sets
        const evens = new Set();
        const odds = new Set();

        // Extend the subarray to the right: j is the ending index
        for (let j = i; j < n; j++) {
            const x = nums[j];

            // Track distinct even