main

Commits

d904b0d
inline ternary operator in array indexer
main
mokha
2019-04-27 17:39:48
10e82cb
extract partition method
mokha
2019-04-27 17:37:38
bbb3fa3
collapse 2 loops into one.
mokha
2019-04-27 17:29:36
5a1b273
take 2
mokha
2019-04-27 17:10:00
36a43c7
first pass at luhn
mokha
2019-04-27 16:48:39
56907db
spec.
mo
2018-02-04 18:48:15
40ef5d4
rename other_index to complement
mo
2017-05-15 15:08:49
f646793
handle negative numbers
mo
2017-05-15 15:04:11
e9a585e
two sum.
mo
2017-05-15 14:59:25
a95632b
factor out duplication with tuple class.
mo khan
2016-08-17 02:55:39
5800691
football.dat
mo khan
2016-08-17 02:50:36
b1b071b
weather data kata.
mo khan
2016-08-17 02:38:56
30c9d52
chop with a loop.
mo khan
2016-08-17 02:01:45
df54bc1
recursive chop.
mo khan
2016-08-17 01:32:43
5a5a092
replace system under test (sut) with subject.
mo khan
2015-12-11 03:28:11
13559f9
solve problem 12.
mo khan
2015-11-30 04:54:34
cf063e9
update bundle.
mo khan
2015-11-28 04:10:55
ae92e49
attempt a recursive solution for problem 11.
mo khan
2015-03-15 17:20:31
5795117
add social graph.
mo khan
2015-03-08 00:57:19
b2433c6
use rubys prime for problem 10... its a bit faster.
mo khan
2015-03-07 04:52:10
cb1f150
solve problem nine with euclids formula.
mo khan
2015-03-07 04:32:19
26438db
remove upper bound.
mo khan
2015-03-06 21:45:11
e073283
attempt to solve pythagorean triplets.
mo khan
2015-03-06 21:06:32
17b68b9
return the greatest product from 13 contiguous digits.
mo khan
2015-03-06 20:47:01
153eadd
it computes the max product from the data.
mo khan
2015-03-06 20:42:45
72e26f1
start problem 8.
mo khan
2015-02-25 03:48:43
fc416be
solve problem seven.
mo khan
2015-02-24 01:37:29
00216bb
solve problem six.
mo khan
2015-02-24 01:25:24
531e57b
it computes the sum of the squares and square of sums.
mo khan
2015-02-24 01:22:42
454a829
brute force problem five.
mo khan
2015-02-12 05:17:41
2871742
find the largest not the first.
mo khan
2015-02-12 04:36:45
470cf52
solve problem 4.
mo khan
2015-02-12 04:23:11
be361e8
finish problem 3.
mo khan
2015-02-12 04:05:11
8f71d78
ignore .bundle
mo khan
2015-02-12 04:01:37
9fd9f37
do it manually.
mo khan
2015-02-10 21:30:45
755ab28
compute sum of all even fib numbers under 4,000,000.
mo khan
2015-02-10 21:26:48
c529b96
run transpec.
mo khan
2015-02-10 21:07:44
509c0c7
replace old spec_helper.
mo khan
2015-02-10 21:06:35
9027abe
specify rspec version.
mo khan
2015-02-10 21:01:08
312c54e
use reduce.
mo khan
2015-01-25 04:11:35
88f4f92
upgrade specs.
mo khan
2015-01-24 23:31:28
215585c
Merge branch 'master' of github.com:mokhan/algorithms
mo khan
2015-01-24 23:29:17
20b6a68
computer unique permutations for a string.
mo khan
2015-01-24 23:29:07
90847d0
upgrade maze and dijkstra specs.
mo khan
2015-01-24 19:01:24
e1fe68f
upgrade heap spec.
mo khan
2015-01-24 18:58:52
8faf501
upgrade to ruby 2.2.0
mo khan
2015-01-24 18:56:31
e050947
extract lets
mo khan
2014-08-01 03:12:58
91cc490
optimize performance of quick union by maintaining balance.
mo khan
2014-07-29 02:23:10
800887e
implement quick union.
mo khan
2014-07-23 04:15:29
9ab0197
implement quick find.
mo khan
2014-07-22 04:32:46
dd0af56
add license.
mo khan
2014-04-26 22:09:31
36fd1ca
merge expression spec.
mo khan
2014-02-28 22:02:14
e20ea60
finish problem one from project euler.
mo khan
2014-02-28 22:01:22
31df012
upgrade ruby and start project euler problems.
mo khan
2014-02-26 00:14:29
e22b0c7
it can assign variables.
mo khan
2013-11-27 03:32:51
495a06c
less than expression.
mo khan
2013-11-27 03:27:47
6eb07c9
add boolean and lessthan.
mo khan
2013-11-27 03:26:10
8d8fab9
create machine.
mo khan
2013-11-27 03:22:27
8dd2d0c
update ruby version.
mo khan
2013-11-27 03:01:33
677b417
try to figure out dijkstra's algorithm.
mo khan
2013-10-13 05:59:58
729602b
update heap to be able to specify a key and value.
mo khan
2013-10-13 04:01:42
dc8a76c
start to implement dijkstras shortest path algorithm using a min heap.
mo khan
2013-10-13 03:46:06
7d24648
alias push to insert.
mo khan
2013-10-13 03:45:43
1eb4cf6
adjust quick sort to use comparison operator.
mo khan
2013-10-13 03:45:25
94c96ee
switch MinHeap to Heap and adjust so that it can be used as both a min or max heap.
mo khan
2013-10-13 03:33:19
f199bfd
start to build a min heap.
mo khan
2013-10-13 03:16:07
4dc3879
add a primitive hash table.
mo khan
2013-10-13 03:00:09
9f8f967
add specs for in order traversal.
mo khan
2013-10-13 02:37:20
1adb262
update rspec.
mo khan
2013-10-13 02:37:06
d794ef1
remove sleep
mo khan
2013-09-11 04:09:49
cf3c698
add bsearch.
mo khan
2013-09-11 04:09:25
433aeb9
fix name of test.
mo khan
2013-09-11 03:06:56
72eac9a
solve maze using recursion.
mo khan
2013-09-08 15:51:09
f5342b4
create a maze.
mo khan
2013-09-08 15:33:26
f440dfe
switch dfs to walk a graph not just a tree.
mo khan
2013-09-05 04:09:01
40e98c3
move fizzbuzz and implement fibonacci.
mo khan
2013-09-05 03:59:59
4bfddb7
use Array#sample instead of finding a random pivot.
mo khan
2013-09-05 03:59:29
083ac9b
add depth first search and breadth first search.
mo khan
2013-09-05 03:58:59
130be5b
add in-order and post-order traversal strategies.
mo khan
2013-09-01 19:46:24
917f994
remove logging.
mo khan
2013-09-01 18:57:19
5a10d41
implement right left rotation in avl tree.
mo khan
2013-09-01 16:23:32
e2bbfb8
balance avl tree with left right case
mo khan
2013-08-30 23:36:46
e062610
add a fizzbuzz spec.
mo khan
2013-08-30 22:32:03
d5af900
handle a left-left case rotation
mo khan
2013-07-13 17:55:41
6b2cc28
handle right right case rotation on avl tree
mo khan
2013-07-13 17:52:49
fb4b787
begin construction of avl tree
mo khan
2013-07-13 17:24:39
6457c1d
tighten the binary tree
mo khan
2013-07-13 16:55:27
6dc1319
extract visitors to separate files
mo khan
2013-07-13 16:49:12
84b475c
extract block visitor to utility
mo khan
2013-07-13 16:46:54
0225329
add reader for data
mo khan
2013-07-13 16:30:18
1574b07
accept traversal strategy to be able to traverse the tree using pre-order, in-order or post-order traversal strategies
mo khan
2013-07-13 16:22:11
d44e57b
start construction of a binary tree
mo khan
2013-07-13 16:14:43
967cdf2
implement count on stack
mo khan
2013-07-13 07:34:14
894a47b
move dynamic array spec to another folder
mo khan
2013-07-13 07:22:27
b0ff6f9
shrink the merge sort
mo khan
2013-07-11 23:03:18
cd33f3b
tiny optimization to merge sort to exit loop early
mo khan
2013-07-11 22:50:25
a122fdf
create a stack using a dynamic array.. (sort of cheating a bit)
mo khan
2013-07-11 20:38:48
fa2bc82
remove null node
mo khan
2013-07-11 19:30:25
c63531f
build a stack using a linked list
mo khan
2013-07-11 14:53:19
4515451
add spec to record efficiency of each sorting algorithm with different input sizes
mo khan
2013-07-11 04:04:36