algodeck - An Open-Source Collection of 200+ Algorithmic Flash Cards to Help you Preparing your Algorithm & Data Structure Interview 💯

•    

---

Algo Deck is an open-source collection of 200+ algorithmic flash cards. It helps you preparing and succeeding in your algorithm & data structure interview. The code examples are in Java.

tree algorithm linked-list stack queue math algorithms graph array recursion bit-manipulation data-structures complexity sorting-algorithms heap interview-practice dynamic-programming hashtable greedy-algorithms

javascript-algorithms - 🤖 Algorithms and data structures implemented in JavaScript with explanations and links to further readings

•    Javascript

---

This repository contains JavaScript based examples of many popular algorithms and data structures. Each algorithm and data structure has its own separate README with related explanations and links for further reading (including ones to YouTube videos).

algorithms algorithm javascript-algorithms computer-science interview data-structures interview-preparation cs sorting-algorithms graph tree

C-Sharp-Algorithms - A C# plug-and-play class-library project of standard Data Structures and Algorithms

•    CSharp

---

A C# plug-and-play class-library project of standard Data Structures and Algorithms. It contains 35+ Data Structures and 30+ Algorithms designed as Object-Oriented isolated components. Even though this project started for educational purposes, the implemented Data Structures and Algorithms are standard, efficient, stable and tested.This project originally started out as an interview preparation project. However, after receiving a great amount of positive responses on reddit, and noticing excitement from a few GitHubers to contribute furthermore to it, the project took on a different meaning. So, I decided to keep maintaining it as a reference for data structures and algorithm implementations in C# as well as my own research side-project under these topics.

algorithms data-structures graph graph-algorithms tree binary-trees algorithm

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

•    C

---

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

mastering-algorithms-c algorithm xcode tree graph list linked-list set lz77 haffman queue sort heap stack bfs dfs bistree rsa des

Buckets-JS - A complete, fully tested and documented data structure library written in pure JavaScript

•    Javascript

---

Buckets is a complete, fully tested and documented data structure library written in pure JavaScript.

data-structures collections collection linked-list dictionary map multimap stack queue set bag binary-heap priority-queue binary-search binary-search-tree tree tree-structure buckets data structure linked list heap priority binary data-structure hashmap

typescript-collections - A generically typed set of collections for use with TypeScript

•    TypeScript

---

It is a complete, fully tested data structure library written in TypeScript. This project uses TypeScript Generics so you need TS 0.9 and above.

typescript generics data structures collections linked list dictionary default multi binary search tree key value stack queue set bag heap priority array

java-algorithms-implementation - Algorithms and Data Structures implemented in Java

•    Java

---

This is a collection of algorithms and data structures which I've implement over the years in my academic and professional life. The code isn't overly-optimized but is written to be correct and readable. The algorithms and data structures are well tested and, unless noted, are believe to be 100% correct.

algorithm sort graph tree data-structures

tstl - TypeScript-STL (Standard Template Library, migrated from C++)

•    TypeScript

---

Implementation of STL (Standard Template Library) in TypeScript. TSTL is an open-source project providing features of STL, migrated from C++ to TypeScript. You can enjoy the STL's own specific containers, algorithms and functors in the JavaScript. If TypeScript, you also can take advantage of type restrictions and generic programming with the TypeScript.

typescript stl container collection iterator algorithm critical-section mutex semaphore hashmap treemap tstl typescript-stl typescript-standard-template-library functor exception functional utility thread numeric special_math vector deque list forward_list stack queue priority_queue set multiset unordered_set unordered_multiset map multimap unordered_map unordered_multimap treeset treemultiset hashset hashmultiset treemultimap hashmultimap shared_mutex timed_mutex shared_timed_mutex unique_lock shared_lock timed_semaphore latch barrier flex_barrier

algorithms - Minimal examples of data structures and algorithms in Python

•    Python

---

Minimal and clean example implementations of data structures and algorithms in Python 3.

algorithm competitive-programming data-structure interview algorithms sort search tree graph

gods - GoDS (Go Data Structures)

•    Go

---

Implementation of various data structures and algorithms in Go.Containers are either ordered or unordered. All ordered containers provide stateful iterators and some of them allow enumerable functions.

data-structure map tree set list stack iterator enumerable sort avl-tree red-black-tree b-tree binary-heap collections go-collection

SwiftGraph - A Graph Data Structure in Pure Swift

•    Swift

---

SwiftGraph is a pure Swift (no Cocoa) implementation of a graph data structure, appropriate for use on all platforms Swift supports (iOS, macOS, Linux, etc.). It includes support for weighted, unweighted, directed, and undirected graphs. It uses generics to abstract away both the type of the vertices, and the type of the weights. It includes copious in-source documentation, unit tests, as well as search functions for doing things like breadth-first search, depth-first search, and Dijkstra's algorithm. Further, it includes utility functions for topological sort, Jarnik's algorithm to find a minimum-spanning tree, detecting a DAG (directed-acyclic-graph), and enumerating all cycles.

graph data-structure graph-algorithms dijkstra-algorithm topological-sort breadth-first-search depth-first-search prims-algorithm

Data-Structures-and-Algorithms - Data Structures and Algorithms implementation in Go

•    Go

---

There are several data structures and algorithms implemented in this project. The list will be replenished with time. The library is not intended for direct use by importing. We strongly recommend copying the necessary implementations and adjusting to your case.

datastructures algorithms algorithms-datastructures algorithms-and-data-structures algorithm data-structures

dsjslib - A library implementing several standard data structures and utilities, in JavaScript

•    Javascript

---

This is a collection of different data structures and utilities, implemented in JavaScript. Its written and tested using Node.js which is also the target platform.CircularBuffer - A data structure that uses a single, fixed-size buffer as if it were connected end-to-end. When the buffer is filled, new data is written starting at the beginning of the buffer and overwriting the old.

algorithms datastructures ds sort-map data-structures avl avltree trie ternarysearchtrie multiwaytrie skiplist btree binarysearch binarysearchtree sortedmap lru cache eviction maximize least-recently-used loading guava async delay-queue delayqueue priorityqueue heap binaryheap bitset bitarray bitvector circularbuffer ringbuffer graph directed undirected shortest cycle path topological bloomfilter bloom filter

computer-science-in-javascript - Computer science reimplemented in JavaScript

•    Javascript

---

This repository contains code about various series of posts that I made on my blog about computer science (mostly data structures and sorting algorithms) reimplemented in JavaScript. The #data-structures series is a collection of posts about reimplemented data structures in JavaScript.

sorting-algorithms computer-science data-structures tree list

DataStructureAndAlgorithms - Write code that run faster, use less memory and prepare for your Job Interview

•    Java

---

In this course you will learn how to Analysis algorithms like Sorting, Searching, and Graph algorithms. And how to reduce the code complexity from one Big-O level to another level. Furthermore, you will learn different type of Data Structure for your code. Also you will learn how to find Big-O for every data structure, and how to apply correct Data Structure to your problem in Java. By the end you will be able to write code that run faster and use low memory. You Also will learn how to analysis problems using Dynamic programming.

algorithm algorithm-analysis analysis-algorithms complexity job-interviews graph-algorithms sort

mnemonist - Curated collection of data structures for the JavaScript language.

•    Javascript

---

Mnemonist is a curated collection of data structures for the JavaScript language. It gathers classic data structures (think heap, trie etc.) as well as more exotic ones such as Buckhard-Keller trees etc.

data-structure bag bimap bit-array bit-set bit-vector bitset bk-tree burkhard-keller-tree circular-buffer counter data-structures disjoint-set fibonacci-heap fuzzy-map hashed-array-tree heap interval-tree inverted-index linked-list multimap multiset queue sparse-set stack structures suffix-tree symspell trie union-find vantage-point-tree vector vp-tree

algorithms

•    Javascript

---

Classic algorithms and data structures implemented in JavaScript, you know... FOR SCIENCE.

algorithms binary-trees graph data-structures sorting-algorithms computer-science cs

go-algorithms - Algorithms and data structures for golang

•    Go

---

go-algorithms - implementation of different algorithms and data structures with golang. Clone https://github.com/0xAX/go-algorithms.git repo, it must be in your $GOPATH.

algorithm data-structures sort tree-structure

Java - All Algorithms implemented in Java

•    Java

---

Algorithms are implemented in Java. This is for education purpose only. Algorithms include Sorting, Search Algorithms, Dynamic Programming, Ciphers, Data Structures and few more.

algorithms implementation algorithms-implemented algorithms-datastructures algorithm-challenges wiki reference tutorial

GraphView - Android GraphView is used to display data in graph structures.

•    Java

---

Android GraphView is used to display data in graph structures. The library is designed to support different algorithms. Currently, only the algorithms from Walker (with the runtime improvements from Buchheim) and Fruchterman&Reingold (for small graphs) have been implemented.

android treeview tree-structure android-treeview view graph graphview graph-structure