Implementation of Algorithms and Data Structures, Problems and Solutions

Mastering Algorithms with C 《算法精解：C语言描述》源码及Xcode工程、Linux工程

A simple fast, easy use distributed file system written in go.

A tool to automate and optimize DraftKings and FanDuel lineup construction.

High-quality LeetCode solutions

JavaScript AC solutions to problems on LeetCode

🍃 Agnostic tree traversal library.

AI research environment for the game of Snake 🐍 .

NodeJS wrapper for the MySportsFeeds Sports Data API

Feature requests for the MySportsFeeds Sports Data API.

A python script that solves ruzzle boards

Kertish-dfs is a simple distributed storage platform, implements file storage on a single distributed computer cluster, and provides interfaces for file/folder handling. Kertish-dfs aims primarily for completely distributed operation without a single point of failure, scalable to the exabyte level.

breaking cycles in noisy hierarchies

My solved challenges and hacks (Golang, Java, Python)

Different Searching algorithms (DFS, BFS, IDS, Greedy, A*) opting to find optimal path from source to destination

This a repository for WPI CS2223 Algorithms D Term 2018

Library for functional graph & geometry algorithms

Visualizes specific Graph Algorithms like BFS, DFS, MST etc. on interactive user input graphs.

使用Canvas制作的围住神经猫，算法基于广度优先搜索实现。

Python methods for reading, writing and creating Dfs0, Dfs2, Dfs3, Dfsu, Mesh and Res1D

Puppet module for LizardFS (highly-available and scalable open source distributed file system)

DFS Suggestions and Bug Reports are all reported here.

Lineup optimization for daily fantasy sports

🚲 Consistent Hashing FS for Big Data

This project contains the implementation of basic graph theory algorithms like BFS, DFS, Kruskal's MST, Prim's MST, Dijkstras Shortest Path

Resources for Competitive Programming

All projects of Data Structure course in an integrated GUI application

I have written some important Algorithms and Data Structures in an efficient way in Java with proper references to time and space complexity. These Pre-cooked and well-tested codes help to implement larger hackathon problems in lesser time. DFS, BFS, LCA, All Pair Shortest Path, Longest Common Subsequence, Binary Search, Lower Bound Search, Maximal Matching, Matrix Exponentiation, Segment Tree, Sparse Table, Merge Sort, Miller Prime Test, Prims - Minimum Spanning Tree, BIT - Binary Index Tree, Two Pointers, BST - Binary Search Tree, Maximum Subarray Sum, Immutable Data Structures, Persistent Data Structurs - Persistent Trie, Dijkstra, Z - Function, Minimum Cost Maximal Matching, Heavy Light Decomposition, Knapsack, Suffix Array and LCP - Longest Common Prefix, Squre Root Decomposition, Kth Order Statics, Trie / Prefix Tree, LIS - Longest Increasing Subsequence