A complete, fully tested and documented data structure library written in pure JavaScript.

A collection of improved binary search algorithms.

Ruby implementation of Algorithms,Data-structures and programming challenges

leetcode.com , algoexpert.io solutions in python and swift

Currently Implemented Word Searching, Path Finding (Dijkstras, BFS, DFS, A Star, BiDirectional) Sorting (Merge, Quick, Heap, Bubble, Insertion, Selection) Backtracking (NQueen Problem) Searching (Linear, Binary)

LeetCode 系列题解, 在线阅读 https://offer.hi-dhl.com

High-quality LeetCode solutions

A collection of classical algorithms and data-structures implementation in C++ for coding interview and competitive programming

Data Structures with Go Language

📓 算法学习笔记

✔ My Solutions of (Algorithmic-Toolbox ) Assignments from Coursera ( University of California San Diego ) With "Go In Depth" Part Which Contains More Details With Each of The Course Topics

A C++14 compile-time/constexpr map and hash map with minimal binary footprint

I am not good at algorithms, so I practice

SPOJ solutions (user: mahmud2690)

Very fast C# class for weighted random picking.

Collection of solution for problems on InterviewBit

Collection of slides/documents online related to ICPC

Probabilistic question-asking system: the program asks, the users answer. The minimal goal of the program is to identify what the user needs (a target), even if the user is not aware of the existence of such thing/product/service. The maximal goal is to achieve the processing power of a single neuron of a human brain on a single PC. Interactions with billions of other computers should achieve human-level intelligence (AGI).

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

Solutions for popular algorithms and data structures problems on leetcode

Code for various YouTube video lessons + extras

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

Extensions for ordered Rust slices.

Comparing linear and binary searches

More readable and easier ordering and comparison tasks

A brief summary of various algorithms. Each algorithm provides examples written in Python and Ruby.

Key-value database for time series data, with indexing and data compression.

Searching and sorting with modern Fortran