README
¶
Back to School
Algorithms & data structures
Implementation of various algorithms and data structures, with the aim to learn Go.
References
- Algorithms & Data Structures, Jürg Nievergelt, Klaus H. Hinrichts, 1993 Prentice-Hall
- Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, 1997 MIT Press
- Algorithms and Data Structures, Niklaus Wirth 1985 (2004)
Useful Resources
- Big Oh Cheat Sheet
- Solutions to Introduction to Algorithms (Third Edition)
- Hacker Rank (YouTube)
- Algorithms (Khan Academy)
Go Specific Resources
Documentation
¶
There is no documentation for this package.
Source Files
Directories
¶
| Path | Synopsis |
|---|---|
|
apps
|
|
|
array/checkperm
command
|
|
|
array/licensekey
command
|
|
|
array/minmeetingrooms
command
|
|
|
array/mostwatercontainer
command
|
|
|
array/nextclosesttime
command
|
|
|
array/nextpermutation
command
|
|
|
array/oneaway
command
|
|
|
array/palindromeperm
command
|
|
|
array/rotatematrix
command
|
|
|
array/triplesum
command
|
|
|
array/twosum
command
|
|
|
array/unique
command
|
|
|
array/uniqueemail
command
|
|
|
array/urlify
command
|
|
|
augmentedstruct/lrucache
Example usage: cache := Constructor(capacity); value := cache.Get(key); cache.Put(key, value);
|
Example usage: cache := Constructor(capacity); value := cache.Get(key); cache.Put(key, value); |
|
backtracking/eightqueen
command
|
|
|
backtracking/knightstour
command
|
|
|
backtracking/robotgrid
command
|
|
|
bits/binarytostring
command
|
|
|
bits/conversion
command
|
|
|
bits/drawline
command
|
|
|
bits/fliptowin
command
|
|
|
bits/insertion
command
|
|
|
bits/pairswap
command
|
|
|
computgeom/rectanglecount
command
|
|
|
dynamicprog/editdistance
command
|
|
|
dynamicprog/jumpgame
command
|
|
|
dynamicprog/knapsack
command
|
|
|
dynamicprog/oddevenjump
command
|
|
|
dynamicprog/triangulation
command
|
|
|
dynamicprog/triplestep
command
|
|
|
graph/bintreemaxsum
command
|
|
|
graph/bstsequene
command
|
|
|
graph/buildorder
command
|
|
|
graph/checkbalanced
command
|
|
|
graph/checksubtree
command
|
|
|
graph/commonancestor
command
|
|
|
graph/commonvertex
command
|
|
|
graph/cracksafe
command
|
|
|
graph/listofdepth
command
|
|
|
graph/minsearchtree
command
|
|
|
graph/noderoute
command
|
|
|
graph/pathwithsum
command
|
|
|
graph/randomnodebst
command
|
|
|
graph/successor
command
|
|
|
graph/validbst
command
|
|
|
graph/wordladder
command
Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord, such that: * Only one letter can be changed at a time.
|
Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord, such that: * Only one letter can be changed at a time. |
|
greedy/fracknapsack
command
|
|
|
histvolume
command
|
|
|
linkedlist/intersect
command
|
|
|
linkedlist/ktolast
command
|
|
|
linkedlist/loopdetect
command
|
|
|
linkedlist/palindrome
command
|
|
|
linkedlist/partition
command
|
|
|
linkedlist/removedups
command
|
|
|
linkedlist/singlelistdelete
command
|
|
|
linkedlist/sumlists
command
|
|
|
permutation/bracket
command
|
|
|
permutation/rot13reader
command
|
|
|
permutation/strperm
command
|
|
|
search/rotated
command
|
|
|
slidingwindow/distinctkchars
command
|
|
|
slidingwindow/nonrepeatchars
command
|
|
|
stackqueue/animalshelter
command
|
|
|
stackqueue/setofstacks
command
|
|
|
stackqueue/sortstack
command
|
|
|
stackqueue/stackmin
command
|
|
|
stackqueue/stackqueue
command
|
|
|
stackqueue/threeinone
command
|
|
|
stat/continuousmedian
command
|
|
|
tree/equitree
command
|
|
|
bits
|
|
|
bitmagic
command
|
|
|
population
command
|
|
|
swap
command
|
|
|
data
|
|
|
design
|
|
|
oo/goinherit
command
|
|
|
number
|
|
|
fibonacci
command
|
|
|
poorman
command
|
|
|
prime
command
|
|
|
recursion
|
|
|
toh
module
|
|
|
sort
|
|
|
countsort
command
|
|
|
heapsort
command
|
|
|
insertsort
command
|
|
|
ksort
command
|
|
|
mergesort
command
|
|
|
orderstat/quickselect
command
|
|
|
quicksort
command
|
|
|
radixsort
command
Radix Sort in Golang
|
Radix Sort in Golang |
|
selectsort
command
|
|
|
struct
|
|
|
graph/matrix/bmm
command
|
|
|
graph/matrix/traversal
command
|
|
|
list/traverse
command
|
|
|
prioqueue
Package prioqueue provides a fixed-length priority queue using a heap.
|
Package prioqueue provides a fixed-length priority queue using a heap. |
|
tree/binarytree
command
|
|
|
tree/heap/binaryheap
Package heap provides a fixed-length binary heap.
|
Package heap provides a fixed-length binary heap. |
Click to show internal directories.
Click to hide internal directories.