A chess engine based on AlphaBeta Pruning search, developed for UCI protocols supported GUIs.

This Go package allows for the creation of bitmasks of theoretically infinite size.

solved problems from various websites

This is an public repository for Accepted solutions of coding problems on different coding platforms like codeforces , hackerearth, codechef , hackerrank .......

Leetcode, Leetcode Solutions, Competitive Programming, Algodesign

nyt letter boxed solver. uses backtracking and bitmasking to search solutions. generalized for number of sides and characters per side.

STM32F4DISC board LD4 (Green) is being turned on.

This repository is containing all 2-star gyms with my accepted solution

This repository offers a comprehensive collection of algorithms, techniques, and solutions for efficiently solving bitmasking problems. Whether you're tackling coding challenges or optimizing performance, you'll find practical examples and insightful explanations to enhance your understanding of bit operations.

This is a C library for handling bitmaps. It includes functions for initializing a BitmapSet, setting and unsetting bits, retrieving the value of a bit, and printing the binary value of a BitmapSet.

This has all the solutions to the problems solved in Coding ninjas Competetive programming course

A simple interactive game made as a tutorial for bitwise operations and bitmasks for embedded programming.

CP work

Standard Template Library ( STL ) of C++

Some random Problems and their Codes

This project was mostly designed to explore microinteractions and their effectiveness of creating immersive and exciting gameplay in spite of simple art assets and environmental design.

This simple library provides a set of functions for easier life when dealing with bitmasks.

Bit Manipulation.

Takes 2 ASCII characters as input and outputs a 21-bit Hamming Code (16-bit code with 5 parity bits) using simple algorithm involving bit-masking.