Kory Becker primaryobjects

## polishNotation.cs
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)
            {

## readme.md

      
              1 file
            
          
              0 forks
            
          
                0 comments
              
            
              0 stars
            
          
                primaryobjects
                / readme.md
            
            
              Last active
              April 26, 2025 18:53
            
              
                TP Link AX1800 Archer TX20U Plus Settings to Fix Frequent Disconnect of Wifi Hotspot (Xfinity)
              
          
    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.


## drop.js
// 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

## index.html
<!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'>&lt;&lt;</button></div>
      <div id='division'>
        <div class='box'>1</div>

## remove-nth-list-node.ts
/**
 * 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)
 *     }
 * }

## quantum-hello-world.ipynb

      
              1 file
            
          
              0 forks
            
          
                0 comments
              
            
              0 stars
            
          
                primaryobjects
                / quantum-hello-world.ipynb
            
            
              Created
              March 16, 2025 21:08
            
              
                Quantum computing hello world in Python qiskit
              
          
      Loading

      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## maxProfit.js
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);
    }

## store.js
class Store {
  values = [];
  indices = {};

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

  add(value) {

## sumPowerTwo.js
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.

## acronym.ts
function isAcronym(words: string[], s: string): boolean {
    let result = true;
    let offset = 0;

    for (let i=0; i<words.length; i++) {
        const word = words[i];
        const letter = word[0];

        if (s[offset++] !== letter) {
            result = false;
	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>
	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.
	function isAcronym(words: string[], s: string): boolean {
	let result = true;
	let offset = 0;

	for (let i=0; i<words.length; i++) {
	const word = words[i];
	const letter = word[0];

	if (s[offset++] !== letter) {
	result = false;