fbyrne.bsky.social
@fbyrne.bsky.social
I summon pot of greed
November 13, 2025 at 1:51 AM
I summon pot of greed
Was thinking about what to do with it when I get home. Seems like there are some good opportunities like: github.com/Night-Trader...
If you can get it the networking peripherals.
If you can get it the networking peripherals.
GitHub - Night-Traders-Dev/pico_dns
Contribute to Night-Traders-Dev/pico_dns development by creating an account on GitHub.
github.com
October 29, 2025 at 2:35 PM
Was thinking about what to do with it when I get home. Seems like there are some good opportunities like: github.com/Night-Trader...
If you can get it the networking peripherals.
If you can get it the networking peripherals.
Perhaps, the idea is that after a certain boundary the sort should be maintained and there is a common case of small descriptor arrays in the V8 Engine. 🤔
v8.dev/blog/fast-pr...
v8.dev/blog/fast-pr...
v8.dev
October 29, 2025 at 1:18 PM
Perhaps, the idea is that after a certain boundary the sort should be maintained and there is a common case of small descriptor arrays in the V8 Engine. 🤔
v8.dev/blog/fast-pr...
v8.dev/blog/fast-pr...
How to decide? Well perhaps we can graph a linear search vs binary search operations.
Also, Binary Search really only provides a benefit if you are maintaining sort order on inserts.
Also, Binary Search really only provides a benefit if you are maintaining sort order on inserts.
October 29, 2025 at 1:09 PM
How to decide? Well perhaps we can graph a linear search vs binary search operations.
Also, Binary Search really only provides a benefit if you are maintaining sort order on inserts.
Also, Binary Search really only provides a benefit if you are maintaining sort order on inserts.
And there was already something for this: algo.monster/flowchart
AlgoMonster Flowchart: Decision Tree to Solve LeetCode Problems
Coding interviews stressing you out? Get the structure you need to succeed. Get Interview Ready In 6 Weeks.
algo.monster
October 28, 2025 at 11:56 AM
And there was already something for this: algo.monster/flowchart
#claude 's guidance:
Use sliding window when ALL THREE conditions are met:
1. Contiguous subarray/substring problem
2. Monotonic constraint: Adding elements to the window maintains invariant.
3. O(1) or O(k) validation: Can check if window is valid quickly
Use sliding window when ALL THREE conditions are met:
1. Contiguous subarray/substring problem
2. Monotonic constraint: Adding elements to the window maintains invariant.
3. O(1) or O(k) validation: Can check if window is valid quickly
October 27, 2025 at 2:45 PM
#claude 's guidance:
Use sliding window when ALL THREE conditions are met:
1. Contiguous subarray/substring problem
2. Monotonic constraint: Adding elements to the window maintains invariant.
3. O(1) or O(k) validation: Can check if window is valid quickly
Use sliding window when ALL THREE conditions are met:
1. Contiguous subarray/substring problem
2. Monotonic constraint: Adding elements to the window maintains invariant.
3. O(1) or O(k) validation: Can check if window is valid quickly
For example "Longest Nice Substring" is tagged as a sliding window problem, but because we can have "abAB" it is difficult to check the validity of the sliding window. "ab" and "AB" are not nice, but together they are nice.
October 27, 2025 at 2:44 PM
For example "Longest Nice Substring" is tagged as a sliding window problem, but because we can have "abAB" it is difficult to check the validity of the sliding window. "ab" and "AB" are not nice, but together they are nice.