Kory Becker primaryobjects

Programs Written in Hex Code (Binary) with AI

The following programs were created by Claude Sonnet 4 and ChatGPT (Bing) in binary hex codes. The resulting hex codes were copied into HxD and saved to a .exe or .com file. The resulting executable was run in DOSBox.

Quick Start

Install HxD or ImHex.
Install DOSBox.
In HxD or ImHex, select File > New. Then type 00 and delete it. Skip to step 5. You are now ready to enter code.

How to Fix Frequent Disconnects of the TP Link AX1800 Archer TX20U Plus

If you are experiencing frequent disconnects when using a TP Link AX1800 Archer TX20U Plus Wifi Adapter, especially when connecting to an Xfinity Wifi Hotspot, it may be due to the Roaming Sensitivity Level. The following settings can fix this issue.

Quick Start

In Windows, click Start.

	public class Solution {
	public int EvalRPN(string[] tokens) {
	char[] operators = { '+', '-', '*', '/' };
	Stack<int> operands = new Stack<int>();

	foreach (string token in tokens)
	{
	bool isOperator = token.Length == 1 && token.IndexOfAny(operators) != -1;
	if (!isOperator)
	{

	// Check if the figure can be placed at a specific row and column
	const canPlaceFigure = (figure, field, startRow, startCol) => {
	for (let i = 0; i < figure.length; i++) {
	for (let j = 0; j < figure[0].length; j++) {
	if (figure[i][j] === 1 && field[startRow + i][startCol + j] === 1) {
	return false; // Conflict detected
	}
	}
	}
	return true; // Placement is possible

	<!DOCTYPE html>
	<html>
	<head>
	</head>
	<body class="main">
	<h1>Frontend Task</h1>
	<div>
	<div id='left-box'><button id='left' class='btn-box left-shift-button'><<</button></div>
	<div id='division'>
	<div class='box'>1</div>

-/**
- * Definition for singly-linked list.
- * class ListNode {
- *     val: number
- *     next: ListNode | null
- *     constructor(val?: number, next?: ListNode | null) {
- *         this.val = (val===undefined ? 0 : val)
- *         this.next = (next===undefined ? null : next)
- *     }
- * }

	const maxProfit = prices => {
	let left = 0;
	let right = 1;
	let maxProfit = 0;

	while (right < prices.length) {
	if (prices[left] < prices[right]) {
	const profit = prices[right] - prices[left];
	maxProfit = Math.max(maxProfit, profit);
	}

	class Store {
	values = [];
	indices = {};

	constructor() {
	this.values = [];
	this.indices = {};
	}

	add(value) {

	const countSumPowerTwo = arr => {
	let result = 0;
	const hash = {};

	// Iterate each number in the array.
	for (let i=0; i<arr.length; i++) {
	const element = arr[i];
	const powerOfTwos = [];

	// Increment the count for the occurrence of this element.