Enums, BitFlags, BitFields, BitMasks and BitArrays for JavaScript & TypeScript

A tiny and robust library to manage bitflags / bitsets / optionsets in TypeScript & JavaScript

Go library created to manage many permissions on different systems with constant complexity of the O(1) algorithm and optimizing memory usage.

This repository contains a C++ solution to the "Maximum Minimization" problem. The problem involves selecting two arrays from a set of arrays and forming a new array such that the minimum element of each position in the new array is maximized.

A low-latency Texas Hold'em solver in C++17. Engineered for speed with O(1) bitmask evaluation, parallelized Monte Carlo simulation, and direct Python bindings for high-frequency strategy analysis

No description provided.

A collection of C++ solutions for competitive programming problems from platforms like Codeforces, AtCoder, VJudge, and various contests

Notes about programming and computer science

Chess program with PGN database

the difficulty of those problems vary from 800 to 1600

Type-safe bitmasks for Go

My Codeforces handle is hobe_naki_hobe_na. Max Rating is 1647

my leetcode solutions

Fast Sudoku solver that leverages multithreading to process over 4.500.000 grids/second