Starting Items

Whirlispring Broom = For Balanced early game flight/travel
Back Slot Curios

reliquified_ars_nouveau:whirling_broom

Eats 66 Mana from Ars Nouveau (Try to buff to 25)

3397. Maximum Number of Distinct Elements After Operations

You are given an integer array nums and an integer k. You are allowed to perform the following operation on each element of the array at most once: Add an integer in the range [-k, k] to the element. Return the maximum possible number of distinct elements in nums after performing the operations.
/**
 * Calculates the maximum number of distinct elements that can be formed
 * by modifying each number within a range of ±k.
 *
 * @param {number[]} nums - Array of integers.
 * @param {number} k - Maximum allowed change per element.
 * @return {number} - Maximum number of distinct elements achievable.
 */
var maxDistinctElements = function(nums, k) {
    // Sort the array to group duplicates and process in ascending order
    nums.sort((a, b) => a - b);

    let prevValue = -Infinity; // Trac

gridの要素同士にborderを表示する

<div class="grid">
  <p class="_item">Item 1</p>
  <p class="_item">Item 2</p>
  <p class="_item">Item 3</p>
  <p class="_item">Item 4</p>
  <p class="_item">Item 5</p>
  <p class="_item">Item 6</p>
  <p class="_item">Item 7</p>
  <p class="_item">Item 8</p>
  <p class="_item">Item 9</p>
  <p class="_item">Item 10</p>
</div>

Exp Fluid Types

casting:molten_experience
justdirethings:xp_fluid_source
pneumaticcraft:memory_essence

Village Spawn Point

ctov:village_plains_fortified
ctov:village_plains
ctov:village_beach

3003. Maximize the Number of Partitions After Operations

You are given a string s and an integer k. First, you are allowed to change at most one index in s to another lowercase English letter. After that, do the following partitioning operation until s is empty: Choose the longest prefix of s containing at most k distinct characters. Delete the prefix from s and increase the number of partitions by one. The remaining characters (if any) in s maintain their initial order. Return an integer denoting the maximum number of resulting partitions after the operations by optimally choosing at most one index to change.
/**
 * Calculates the maximum number of partitions after performing operations
 * that allow up to `k` distinct characters per partition.
 *
 * @param {string} s - Input string consisting of lowercase letters.
 * @param {number} k - Maximum number of distinct characters allowed per partition.
 * @return {number} - Maximum number of partitions achievable.
 */
var maxPartitionsAfterOperations = function(s, k) {
    const n = s.length;

    // L[i] stores [leftPartitions, leftMask, leftCount] for p

1.21.1 JVM Arg

MC NeoForge 1.21.1 Java Runtime - Settings are applied in CursedForge Launcher
-Xms12G
-Xmx12G
-XX:+UnlockExperimentalVMOptions
-XX:+UseG1GC
-XX:+ParallelRefProcEnabled
-XX:MaxGCPauseMillis=50
-XX:+DisableExplicitGC
-XX:+AlwaysPreTouch
-XX:G1NewSizePercent=30
-XX:G1MaxNewSizePercent=40
-XX:G1HeapRegionSize=16M
-XX:G1ReservePercent=20
-XX:InitiatingHeapOccupancyPercent=15
-XX:G1MixedGCCountTarget=4
-XX:G1MixedGCLiveThresholdPercent=90
-XX:G1RSetUpdatingPauseTimePercent=5
-XX:SurvivorRatio=8
-XX:MaxTenuringThreshold=15
-XX:SoftRefLRUPolicyMSPerMB=10000
-XX

Get parameter from URL

{% comment %}
  Helper: retrieves all values for a given query key from the current URL.

  Usage:
  {% render 'get-parameter-from-url', key: 'filter.p.m.attributes.apparel_size' %}
{% endcomment %}

{%- liquid
  # Capture page URL from header
  capture content_for_query_string
    echo content_for_header
  endcapture

  # Extract path after shop domain
  assign page_url = content_for_query_string | split: '"pageurl":"' | last | split: '"' | first | split: '.myshopify.com' | last | replace: '\/'

B2B Checkout TEST

// backend/b2bCheckoutTest.web.js
import { Permissions, webMethod } from 'wix-web-module';
import wixStores from 'wix-stores-backend';
import { contacts } from 'wix-crm-backend';
import wixFetch from 'wix-fetch';
import { getSecret } from 'wix-secrets-backend';

/* ---------------------------------- Helpers ---------------------------------- */

function pseudoUuid() {
  return 'xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx'.replace(/[xy]/g, c => {
    const r = (Math.random() * 16) | 0; // es

Monthly Patch Cleanup

select
	[Superseded].Title [Superseded Title]
	, [Superseded].CI_ID [Superseded CI_ID]
	, [Superseded].CI_UniqueID [Superseded CI_UniqueID]
	, [Superseded].ArticleID [Superseded ArticleID]
	, [Superseded].InfoURL [Superseded InfoURL]

	, [Superseding].Title [Superseding Title]
	, [Superseding].CI_ID [Superseding CI_ID]
	, [Superseding].CI_UniqueID [Superseding CI_UniqueID]
	, [Superseding].ArticleID [Superseding ArticleID]
	, [Superseding].InfoURL [Superseding InfoURL]

	, [PSCmd] =

B2B Checkout v1

import { session } from 'wix-storage-frontend';
import { currentMember } from 'wix-members-frontend';
import wixLocation from 'wix-location';
import { computeDiscount } from 'backend/utils/discount';
import { shippingNet } from 'backend/utils/shipping';
import {
  createDealerOrderFromProfile,
  fetchMemberDefaultAddress
} from 'backend/b2bCheckout.web';

const CART_KEY = 'b2bCart';
const LAST_ORDER_KEY = 'b2bLastOrder';

function getCart() {
  try {
    return JSON.parse(session.

NFL

ALGORITHM DijkstraNFLStadiums(stadiums, distances, startStadium, endStadium)
INPUT:
    - stadiums: list of all stadium names
    - distances: matrix of distances between stadiums
    - startStadium: starting stadium name
    - endStadium: destination stadium name
OUTPUT:
    - shortest path as list of stadium names
    - total distance in miles

BEGIN
    // Initialize data structures
    distanceMap = empty map
    previousStadium = empty map
    unvisitedStadiums = set of all stadiums
    vis

Dynamic Script Injection Based on Page Type Footer/Header

This script conditionally loads an external JavaScript file only when certain UI elements (header/footer) are missing, helping avoid duplicate or conflicting scripts on pages that already include them.

```// Creates and injects a script tag into the page
const initialize = () => {
  const script = document.createElement("script");
  script.id = "footer-header-script";           // Unique ID to prevent duplicate injection
  script.type = "text/javascript";
  script.src = "https://www.example.com

Convert registry byte array (REG_BINARY) to text

function ConvertFrom-ByteArray {
    [CmdletBinding()]
    param (
        [Alias('appid')]
        [Parameter(Mandatory = $true, Position = 0, ValueFromPipeline = $true, ValueFromPipelineByPropertyName = $true)]
        [byte[]]
        $byteArray
    )
    
    begin {}

    process {
        try {
            [System.Text.Encoding]::UTF8.GetString($byteArray)
        }
        catch {
            throw $_
        }
    }

    end {}
}

2598. Smallest Missing Non-negative Integer After Operations

You are given a 0-indexed integer array nums and an integer value. In one operation, you can add or subtract value from any element of nums. For example, if nums = [1,2,3] and value = 2, you can choose to subtract value from nums[0] to make nums = [-1,2,3]. The MEX (minimum excluded) of an array is the smallest missing non-negative integer in it. For example, the MEX of [-1,2,3] is 0 while the MEX of [1,0,3] is 2. Return the maximum MEX of nums after applying the mentioned operation any number of times.
/**
 * @param {number[]} nums
 * @param {number} value
 * @return {number}
 */
var findSmallestInteger = function(nums, value) {
    // Step 1: Create a frequency map to count how many times each remainder appears
    const freq = new Map();

    for (let num of nums) {
        // Normalize the remainder to always be non-negative
        let mod = ((num % value) + value) % value;

        // Count how many times each remainder appears
        freq.set(mod, (freq.get(mod) || 0) + 1);
    }

    /

Layout resources

PLUGINS

• https://www.kadencewp.com/kadence-blocks/
• https://www.kadencewp.com/kadence-blocks/