Travelling salesman problem on OpenStreetMap data. Shortest path distances by Dijkstra's algortihm. Frontend built with react and leaflet.

Convert arrays to bitmask representations to quickly operate with them through bitwise operations. (uses JSBI)

divorcePRED offers an end to end solution from predicting the state of marriage with the help of machine learning, finding like minded people through clustering, emotional analysis through natural language processing and finding optimal routes and therapy centres through graph algorithms.

BIT-MAGIC

Leetcode, Leetcode Solutions, Competitive Programming, Algodesign

All about Competitive Programming

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

This repository contains algorithms for Competitive Programming as a part of my competitive programming Journey.

Python Alternative Flags

Monte Carlo Tree Search implementation for playing Ultimate Tic Tac Toe

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

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 .......

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

CP work

competitive learner can revise a lot of program and topic from this repo ,here i organised all of my practised and tested code in well manner...

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 Go package allows for the creation of bitmasks of theoretically infinite size.

STM32F4DISC board LD4 (Green) is being turned on.