This repository contains detailed pdf notes with all approaches for every topic and code for each problem which has been accepted on GFG or Leetcode.
Game of Knights where 6 knights should hit the one at their left with a random amount of damage of a range. Then they should fight until there's only one knight standing. All actions should be displayed (knight 1 hits 2 with X damage, knight 4 dies, knight 5 wins)
Competitive Programming
Solutions to free LeetCode problems, in Golang.
yandex-algorithm-trainings-2.0
a simple implementation of the Dijkstra algorithm to find the shortest path between two point in the grid
'Grokking Algorithms'. An illustrated manual for programmers and the curious from Bhargava A. It is a project for practicing the basic algorithms and examples given in this book in the Dart language
C program that implements simple sorting algorithms: bubble sort, merge sort, and insert sort.
An interactive visualization for Principal Component Analysis (PCA).
A simple command-line tool for calculating the MD5, SHA-1, and SHA-256 hash values of a text or a file, written in Python.
Shows various simple algorithm implementations done by flowcharts, JS, and Java. The JS variant of the algorithms can be run locally, as well as you can run your own implementation to see if it is correct.
Harris-Corner-Detection-algorithm
Add a description, image, and links to the algor topic page so that developers can more easily learn about it.
To associate your repository with the algor topic, visit your repo's landing page and select "manage topics."