Zachary Mansell manzaloros

Machine

Beelink Ser7

What doesn't work

Ser7

Machine USB A port -> USB 2 Hub -> all 2.4g dongles
- This will greatly increase the effective range of wireless devices, allowing true usage in a home theater environment.

Windows

Some games using Anti Cheat will freeze the entire PC after 4-5 minutes. This seems to be a problem with the Ser5 BIOS, I've seen it on multiple machines. However, booting the games on Linux rather than Windows seems to fix the issue

Top Down Recursive DP:

Non-memoized:

dp(n) => O((number of recursive calls) ^ (number of inputs))

recursive calls is how many times backtrack(...) is called recursively

Fibonacci:

         f(4)
 / \

K is a sum you want to equal or be greater than in your window.

If you make an array of prefix sums, B, then you're looking for B[left] <= B[right] - K which means that the sum of the window in your original array A has to be >= K.

Given B[right], you're looking for B[left] such that B[left] <= B[right] - K.

You need to use an increasing monotonic queue because with each new B[i], the larger elements on the left won't work as candidates to make some future element B[j] >= B[i] + K where j > i.

	#!/bin/bash

	# Loop over all files in the current directory with a ".cue" extension
	for file in *.cue; do
	# Invoke chdman createcd with input and output options
	chdman createcd -i "${file%.}.cue" -o "${file%.}.chd"
	done

	// If you have a function working on two arrays:
	const compareArrays = (nums1, nums2) => {
	...
	}

	// And you need the larger or smaller array to be in a certain position,
	// you can do:
	const compareArrays = (nums1, nums2) => {
	// invoke function making smaller array first in the order:
	if (nums1.length > nums2.length) return compareArrays(nums2, nums1);

	const replace = (word, index, replacement) => {
	return word.substr(0, index) + replacement + word.substr(index + replacement.length);
	}

	// another replace:
	const replaceChar = (index, newChar, string) => {
	if (index < string.length) return `${string.substring(0, index)}${newChar}${string.substring(index + 1)}`
	}

	const differByCase = (c1, c2) => Math.abs(c1.charCodeAt(0) - c2.charCodeAt(0) === 32)

	const parent = Array(rows * cols).fill(0).map((value, index) => index);
	const rank = Array(rows * cols).fill(0);

	const find = (i) => {
	if (parent[i] !== i) parent[i] = find(parent[i]);

	return parent[i];
	};

	const union = (x, y) => {

	// Time: O(number of vertices)
	// Space: O(number of vertices)
	// Using the params for course scheduler:

	const findOrder = (numCourses, prerequisites) => {
	/*
	// Make graph adjacency list if needed:
	const graph = new Map();

	prerequisites.forEach(([course, prerequisite]) => {

	for (let i = 0; i < 26; i += 1) {
	const currentLetter = String.charCodeFrom(i + 97);
	}