2273. Find Resultant Array After Removing Anagrams

You are given a 0-indexed string array words, where words[i] consists of lowercase English letters. In one operation, select any index i such that 0 < i < words.length and words[i - 1] and words[i] are anagrams, and delete words[i] from words. Keep performing this operation as long as you can select an index that satisfies the conditions. Return words after performing all operations. It can be shown that selecting the indices for each operation in any arbitrary order will lead to the same result. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase using all the original letters exactly once. For example, "dacb" is an anagram of "abdc".
/**
 * @param {string[]} words
 * @return {string[]}
 */
var removeAnagrams = function(words) {
    // Helper function to check if two words are anagrams
    const isAnagram = (word1, word2) => {
        // Sort the letters of both words and compare
        return word1.split('').sort().join('') === word2.split('').sort().join('');
    };

    // Initialize a result array with the first word (it can't be removed)
    const result = [words[0]];

    // Start from the second word and compare with

Azure Exam AZ -900 

Describe cloud concepts (25–30%)
Describe cloud computing
Define cloud computing

Describe the shared responsibility model

Define cloud models, including public, private, and hybrid

Identify appropriate use cases for each cloud model

Describe the consumption-based model

Compare cloud pricing models

Describe serverless

Describe the benefits of using cloud services
Describe the benefits of high availability and scalability in the cloud

Describe the benefits of reliability

Css only type grinding 

/* https://www.bitovi.com/blog/css-only-type-grinding-casting-tokens-into-useful-values */

@property --variant {
  syntax: "primary|secondary|success|error";
  initial-value: primary;
  inherits: true;
}

@property --_v-primary-else-0 {
  syntax: "primary|<integer>"; initial-value: 0; inherits: true;
}


@property --_v-primary-bit {
  syntax: "<integer>"; initial-value: 1; inherits: true;
}


.element {
  --variant: primary;
  --_v-primary-else-0: var(--variant);
  --_v-primary-bit: var(--_v-pr

3539. Find Sum of Array Product of Magical Sequences

You are given two integers, m and k, and an integer array nums. A sequence of integers seq is called magical if: seq has a size of m. 0 <= seq[i] < nums.length The binary representation of 2seq[0] + 2seq[1] + ... + 2seq[m - 1] has k set bits. The array product of this sequence is defined as prod(seq) = (nums[seq[0]] * nums[seq[1]] * ... * nums[seq[m - 1]]). Return the sum of the array products for all valid magical sequences. Since the answer may be large, return it modulo 109 + 7. A set bit refers to a bit in the binary representation of a number that has a value of 1.
/**
 * @param {number} m
 * @param {number} k
 * @param {number[]} nums
 * @return {number}
 */
var magicalSum = function(m, k, nums) {
    const MOD = BigInt(1e9 + 7); // Modulo for large number arithmetic
    const n = nums.length;

    // Precompute binomial coefficients: comp[i][j] = C(i, j)
    const comp = Array.from({ length: m + 1 }, () => Array(m + 1).fill(0n));
    for (let i = 0; i <= m; i++) {
        comp[i][0] = 1n;
        comp[i][i] = 1n;
        for (let j = 1; j < i; j++) {

C1 U6 

persecute vs prosecute
  get arrested and hold in prision -> prosecute,
  persecute - just verolgen, Hitler persecuted Juews
lessen vs diminish
make out capital of sth - only about money?
  90% yes. But e.g. human capital.
paramount vs the most - which context
a body of - The committee is made up of a body of experts in the field.
  =group of
rally vs protest
  rally - promote smth - women rights, working rights
  protest - against sth
inequity vs inequality
  inequity = difference in money, e.g

3186. Maximum Total Damage With Spell Casting

A magician has various spells. You are given an array power, where each element represents the damage of a spell. Multiple spells can have the same damage value. It is a known fact that if a magician decides to cast a spell with a damage of power[i], they cannot cast any spell with a damage of power[i] - 2, power[i] - 1, power[i] + 1, or power[i] + 2. Each spell can be cast only once. Return the maximum possible total damage that a magician can cast.
/**
 * @param {number[]} power
 * @return {number}
 */
var maximumTotalDamage = function(power) {
    // Step 1: Count how many times each damage value appears
    const count = new Map();
    for (const dmg of power) {
        count.set(dmg, (count.get(dmg) || 0) + 1);
    }

    // Step 2: Sort unique damage values in ascending order
    const unique = Array.from(count.keys()).sort((a, b) => a - b);
    const n = unique.length;

    // Edge case: only one unique damage value
    if (n === 1) {

Laravel VISA - probar email 

<?php

/**
 * Archivo de prueba para enviar un email usando DocumentMail
 * 
 * Este archivo es SOLO para pruebas y NO debe usarse en producción.
 * No modifica ningún archivo existente del proyecto.
 * 
 * Para ejecutar: php test-document-mail.php
 */

require_once __DIR__ . '/vendor/autoload.php';

use Illuminate\Foundation\Application;
use Illuminate\Contracts\Console\Kernel;
use App\Mail\DocumentMail;
use Illuminate\Support\Facades\Mail;

// Inicializar Laravel
$app = requ

IP地址工具类

IP地址工具类
import lombok.extern.slf4j.Slf4j;
import org.springframework.util.StringUtils;

import javax.servlet.http.HttpServletRequest;
import java.net.Inet4Address;
import java.net.InetAddress;
import java.net.NetworkInterface;
import java.util.Enumeration;

/**
 * IP地址工具类
 */
@Slf4j
public class IpUtils {

    private static final String[] IP_HEADERS = {
            "X-Forwarded-For",
            "Proxy-Client-IP",
            "WL-Proxy-Client-IP",
            "HTTP_CLIENT_IP",
            "HTTP_X_FORWA

javascript - selector de birth date 

const birthDatePicker = new easepick.create({
    ...defaultPickerConfig,
    element: "#birth_date",
    AmpPlugin: {
        dropdown: {
            maxYear: new Date().getFullYear(),
            minYear: 1930,
            months: true,
            years: true,
        },
        resetButton: true,
        darkMode: false
    },
    LockPlugin: {
        minDate: null,
        maxDate: todayInAruba,
        filter(date, picked) {
            return date.getTime() > todayInArub

3147. Taking Maximum Energy From the Mystic Dungeon

In a mystic dungeon, n magicians are standing in a line. Each magician has an attribute that gives you energy. Some magicians can give you negative energy, which means taking energy from you. You have been cursed in such a way that after absorbing energy from magician i, you will be instantly transported to magician (i + k). This process will be repeated until you reach the magician where (i + k) does not exist. In other words, you will choose a starting point and then teleport with k jumps until you reach the end of the magicians' sequence, absorbing all the energy during the journey. You are given an array energy and an integer k. Return the maximum possible energy you can gain. Note that when you are reach a magician, you must take energy from them, whether it is negative or positive energy.
/**
 * @param {number[]} energy
 * @param {number} k
 * @return {number}
 */
var maximumEnergy = function(energy, k) {
    // Initialize the answer to a very low number to ensure any valid energy path will be higher
    let ans = -1e99;

    // Try starting from each index i in the range [0, k)
    // These are the only starting points that can reach the end via i + k jumps
    for (let i = 0; i < k; i++) {
        // Start with the energy at index i
        let cur = energy[i];

        // Set

Simple tabs 

document.addEventListener("DOMContentLoaded", function() {
  var customTabsTitles = document.querySelectorAll('.product-custom-tabs-header-item');
  if (customTabsTitles.length) {
    customTabsTitles.forEach(function(item) {
      item.addEventListener("click", function() {
        var customTabsBody = this.closest('.product-custom-tabs').querySelectorAll('.product-custom-tabs-body-item');
        var currentId = this.getAttribute('data-id'); 
        customTabsTitles.forEach(function(el

📒 Notebook LM - Sourcing Liens 

# 20 High-Quality Educational Resources: VS Code and Jupyter for Programming Beginners

This curated collection provides approximately 20 premium educational resources specifically selected for business users new to programming. These materials cover VS Code features, Jupyter notebook fundamentals, and their integration—ideal for generating training content with Notebook LM.

## VS Code Fundamentals (6 resources)

### 1. Tutorial: Get started with Visual Studio Code
**URL:** https://code.

📒 Notebook LM - Video Example 

# TARGET AUDIENCE
Data professionals with a few coding experience, including data analysts, product owners, project leaders, managers.

# GOAL
Build foundational understanding of VS Code and Jupyter environment, essentially in Python to enable ease in practical use within a few days

# INCLUDE
- "What are VS Code and Jupyter environment?" in simplest possible terms (use analogies)
- Why VS Code and Jupyter environment were created (the problem it solves)
- The ONE most important thing t

📒 Notebook LM - Video Template 

# AUDIENCE

# GOAL

# INCLUDE

# EXCLUDE

# TONE

# STRUCTURE

# VISUAL STYLE

# PEDAGOGICAL PRINCIPLES

📒 Notebook LM - Flashcards Template 

# LANGUAGE
French (MANDATORY, translate if necessary).

# INCLUDE
Focus on questions about {{TOPIC_1}}.

# EXCLUDE
Limit questions about {{TOPIC_2}} to {{LIMIT}}.