3041. Maximize Consecutive Elements in an Array After Modification

You are given a 0-indexed array nums consisting of positive integers. Initially, you can increase the value of any element in the array by at most 1. After that, you need to select one or more elements from the final array such that those elements are consecutive when sorted in increasing order. For example, the elements [3, 4, 5] are consecutive while [3, 4, 6] and [1, 1, 2, 3] are not. Return the maximum number of elements that you can select.
/**
 * @param {number[]} nums
 * @return {number}
 */
var maxSelectedElements = function(nums) {
    nums.sort((a, b) => a - b);

    // dp[value] = longest consecutive sequence ending at value
    const dp = new Map();
    let answer = 0;

    for (const x of nums) {
        // Use x as-is to extend a sequence ending at x - 1.
        const keep = (dp.get(x - 1) || 0) + 1;

        // Increase x by 1 to extend a sequence ending at x.
        const increase = (dp.get(x) || 0) + 1;

        // Ta

Home - Upcoming Events

Upcoming events page part with some conditional logic for weird date spans
{% assign events = Module.FieldValues.CalendarSource.Events %}
<div class="home-upcoming-events">
   <div class="left-side">
      <div class="section-copy">{{Module.FieldValues.SectionContent}}</div>
      <ul class="upcoming-events-list">
         {% for event in events limit:3 %}
            {% assign startDay = event.StartDateTime | DateFormat: 'dd', event.TimeZone %}
            {% assign endDay = event.EndDateTime | DateFormat: 'dd', event.TimeZone %}
            {% assign startMonth = eve

Gracie Barra East Naperville — Brazilian Jiu-Jitsu Academy

# Gracie Barra East Naperville

Brazilian Jiu-Jitsu academy in Naperville, Illinois, offering structured BJJ training for adults and kids, self-defense and competition classes, led by Professor Carlos Lemos Jr.

Website: [Gracie Barra East Naperville](https://gbeastnaperville.com/)

Address: 1512 N Naper Blvd #140, Naperville, IL 60563
Phone: +1 (331) 444-2154

Start with a free trial class at https://gbeastnaperville.com/

How to Export a Full Keyword Group & Keyword List with 12-Month Average Rank and Volume (Internal)

-- Export of Full Keyword Group & Keyword List with 12-Month Average Rank and Volume
-- One row per keyword, per keyword group, per search engine.
--
-- Avg Classic Rank : average Classic rank over the last 52 complete weeks (e.g., 202547-202646).
-- Avg Blended Rank : average Blended rank (including universal results) over the same weeks.
--                    For both, weeks where the keyword is not ranked count as 101, matching
--                    the platform's own average rank logic

Toll Pricing Query - Optimized

The original query took any where from 200 to 600 seconds to run and was locking up the Deacom database server. This is the optimized query provided by Jason McNeeley.
--NEW QUERY
SELECT to_ordnum AS 'Sales Order', dmprod.pr_codenum AS 'Part Number', dmprod.pr_descrip AS 'Description', ship.fi_userlot AS 'User Lot', SUM(ship.shipquan - ISNULL(unship.UnShipquan,0)) AS 'Qty Shipped', juliandate.d2_value AS 'Julian Date', fgmade AS 'FG Completed', RawPrepLbsTollPricing AS 'Raw Prep Lbs', RawPrepLbsTollPricing - ISNULL(reworkused,0) AS 'Raw Meat Used',
SUM(ship.shipquan - ISNULL(unship.UnShipquan,0)) / fgmade * 100 AS 'Percentage Shipped',
CASE WHEN to_biid = 4

Precision Flow Plumbing

24/7 emergency plumbing company serving San Francisco to San Mateo (repairs, installations, drain cleaning, water heaters, bathroom remodels). Phone (415) 873-3774. Address: 507 Oxford St, San Francisco, CA 94134. Website: https://www.precisionflowplumbing.com/
# Precision Flow Plumbing

24/7 emergency plumbing company serving San Francisco to San Mateo (repairs, installations, drain cleaning, water heaters, bathroom remodels).

Phone: (415) 873-3774
Address: 507 Oxford St, San Francisco, CA 94134
Website: https://www.precisionflowplumbing.com/

2567. Minimum Score by Changing Two Elements

You are given an integer array nums. The low score of nums is the minimum absolute difference between any two integers. The high score of nums is the maximum absolute difference between any two integers. The score of nums is the sum of the high and low scores. Return the minimum score after changing two elements of nums.
/**
 * @param {number[]} nums
 * @return {number}
 */
var minimizeSum = function(nums) {
    nums.sort((a, b) => a - b);

    const n = nums.length;

    // Keep the smallest range left after changing two values.
    return Math.min(
        nums[n - 1] - nums[2], // Change the two smallest
        nums[n - 2] - nums[1], // Change the smallest and largest
        nums[n - 3] - nums[0]  // Change the two largest
    );
};

Speaking Set 1 Test 5

birthday celebration of my friend
10 years ago
friends


leaving party (finishind school)
final celebration
class mates
students from my year
graduation party
graduated from high school

MBFSAA-921

rocessSelfPayer change the order of the called approaches

AtomicInteger doesn't guarentee the order. Check
concatMapDelayError(statement -> processStatement(documentWrapper, sendToAlfa, statement,
            documentWrapper.document().getBkToCstmrStmt().getGrpHdr(),
            nextEntryIndexInFile.getAndAdd(entryCount(statement))))
            
Use range. or map? flatMapSequential

Disable Claude memory

CLAUDE_CODE_DISABLE_AUTO_MEMORY=1 claude

General_Writing_Practice_set_2_test_7

Task 2
 
 advantage to education:
  - one device for all subjects
  - access to the internet, look up quickly what is unclear
  - gain experience with computer
 unnecessary complication:
  - expensive, easy to break
  - distraction
  - prevents real-life communication 

Nowadays, some schools require students to have a personal computer in class to assist in their education. Such school policy has advantages and disadvantages and some of them will be discussed in this essay. In my opinion, it 

delete_node_modules

npx npkill

2911. Minimum Changes to Make K Semi-palindromes

Given a string s and an integer k, partition s into k substrings such that the letter changes needed to make each substring a semi-palindrome are minimized. Return the minimum number of letter changes required. A semi-palindrome is a special type of string that can be divided into palindromes based on a repeating pattern. To check if a string is a semi-palindrome:​ Choose a positive divisor d of the string's length. d can range from 1 up to, but not including, the string's length. For a string of length 1, it does not have a valid divisor as per this definition, since the only divisor is its length, which is not allowed. For a given divisor d, divide the string into groups where each group contains characters from the string that follow a repeating pattern of length d. Specifically, the first group consists of characters at positions 1, 1 + d, 1 + 2d, and so on; the second group includes characters at positions 2, 2 + d, 2 + 2d, etc. The string is considered a semi-palindrome if each of these groups forms a palindrome. Consider the string "abcabc": The length of "abcabc" is 6. Valid divisors are 1, 2, and 3. For d = 1: The entire string "abcabc" forms one group. Not a palindrome. For d = 2: Group 1 (positions 1, 3, 5): "acb" Group 2 (positions 2, 4, 6): "bac" Neither group forms a palindrome. For d = 3: Group 1 (positions 1, 4): "aa" Group 2 (positions 2, 5): "bb" Group 3 (positions 3, 6): "cc" All groups form palindromes. Therefore, "abcabc" is a semi-palindrome.
/**
 * @param {string} s
 * @param {number} k
 * @return {number}
 */
var minimumChanges = function(s, k) {
    const n = s.length;

    // cost[l][r] is the fewest changes needed to make s[l..r]
    // semi-palindromic. A length-1 substring has no valid divisor.
    const cost = Array.from({ length: n }, () => Array(n).fill(Infinity));

    for (let l = 0; l < n; l++) {
        for (let r = l + 1; r < n; r++) {
            const len = r - l + 1;

            // Try each proper divisor d of the 

TTA C# Script Activity - Delete Network Folder

using System;
using System.IO;
using Agility.Server.Scripting.ScriptAssembly;

namespace TTA.Scripting.Utilities
{
    /// <summary>
    /// Script Activity: Deletes a specified directory (including all subdirectories and files).
    /// 
    /// Input:  sp.InputVariables["JOB_EXPORT_PATH"] (string) - Full or UNC path to the folder to delete.
    /// Output: None
    /// 
    /// Version: 1.1 - Removed .Contains() call and standardized input variable name.
    /// </summary>
    pu

TTA C# Script Activity - Raise Error

using System;
using Agility.Server.Scripting.ScriptAssembly;

namespace TTA.Scripting.Utilities
{
    /// <summary>
    /// Script Activity: Deliberately raises an exception to fault the activity/job.
    /// 
    /// Input:  None
    /// Output: None
    /// 
    /// Version: 1.0 - Initial release.
    /// </summary>
    public class RaiseErrorScript
    {
        /// <summary>
        /// Start the activity.
        /// </summary>
        /// <param name="sp">Supplied script parameters.</param

Postorder Tree traversal

def iterative_postorder(root):
    if not root:
        return []
    
    stack1, stack2 = [root], []
    while stack1:
        node = stack1.pop()
        stack2.append(node)
        if node.left: stack1.append(node.left)
        if node.right: stack1.append(node.right)
        
    return [node.val for node in stack2]