Commits · algae

7ffc17f

add victors solution.

2017-07-13 02:56:04

af16b89

add merge_two_linked_lists problem.

2017-07-12 20:20:12

f220e3a

complete add 2 huge numbers.

2017-07-12 03:38:10

f7baf1d

replace recursion with iteration.

2017-07-12 01:00:15

c234e55

solve is list palindrome.

2017-07-12 00:50:18

0a1537b

try to sum to zero.

2017-07-06 03:11:29

3102164

start new problem.

2017-07-06 02:32:19

5cbfc45

calculate length of cycle.

2017-07-06 02:32:07

f6b36c3

add bcc32 solution.

2017-07-05 23:21:11

483474a

remove k from linked list.

2017-07-05 23:08:02

240d2dc

add hidden tests.

2017-07-05 01:57:10

8b91d4f

try to figure out why the last hidden test is failing.

2017-07-05 01:30:30

4cb8af9

solve is_crypt_solution

2017-07-05 01:04:48

54c6823

add test cases for is_crypt_solution

2017-07-05 00:20:09

32c0c4f

add is_crypt_solution problem.

2017-07-04 20:10:59

ece38a5

optimize sudoku solution.

2017-07-04 18:03:48

a8c568b

get all tests passing.

2017-07-04 17:35:56

f96e203

start to solve sudoku.

2017-07-04 17:19:27

cfe1ef9

try to reverse then flip on diagonal.

2017-06-27 21:56:48

16c66d1

implement reverse and transpose.

2017-06-27 21:49:59

37a9024

use transpose and reverse

2017-06-27 21:35:57

7249da0

rotate matrix using copy.

2017-06-27 21:31:29

6d8e630

find entry point of cycle.

2017-06-27 19:14:27

30894cb

add rotate image problems.

2017-06-26 21:54:44

1b376dc

finish first non repeating character.

2017-06-26 20:32:01

1b856af

use a hash.

2017-06-26 20:16:09

7a30307

move tail forward from head instead of starting at end.

2017-06-26 20:06:20

12ade1e

return the value not the index.

2017-06-26 19:57:06

bba30ff

get most of the duplicate specs passing.

2017-06-24 04:50:43

f2d3b7f

try a dp solution to map decoding.

2017-06-24 04:39:59

33afc78

find min duplicate.

2017-06-23 03:11:54

d7e0c7f

attempt map decoding.

2017-06-22 17:12:02

7a5fd0c

complete part 3.

2017-06-22 17:11:38

7fd5fd4

fix bug in spec.

2017-06-22 03:59:27

efd1414

convert cycle problem to specs.

2017-06-22 03:47:30

eb96a99

add next part to the problem.

2017-06-21 20:06:23

3299f17

add dynamic programming assignment from Andrew.

2017-06-21 20:03:18

192db8a

add programming question from Chris.

2017-06-21 20:02:06

2c80c10

remove puts

2017-06-21 20:00:09

e917f05

re-do swap lex_order with another solution.

2017-06-21 19:59:54

0023114

work on map decoding.

2017-06-20 17:53:14

0e35517

add map decoding spec.

2017-06-17 19:13:52

fe911a1

comment out dp solutions.

2017-06-17 16:51:45

6220726

add more sudoku specs.

2017-06-17 16:14:26

fcabb68

add sudoku problem.

2017-06-17 16:06:45

9a03cbf

collapse line.

2017-06-17 15:14:24

718a139

rename variables.

2017-06-17 15:13:04

50efcb1

detect circles.

2017-06-17 14:50:03

3c51e47

add circle detection problem.

2017-06-16 20:26:44

f42f3bc

use inject to make code more concise.

2017-06-16 03:53:37

50047d3

dp solution to range sum.

2017-06-16 03:43:42

d7fe97b

use inject.

2017-06-16 03:23:21

ac260dd

complete sum in range.

2017-06-16 03:21:30

77a9d8d

try another dp solution.

2017-06-16 03:19:22

ed1f548

scratch head.

2017-06-13 23:49:10

41a35d3

add dp solution for coin problem.

2017-06-13 23:40:23

9952c2d

start dp solution for sum subsets.

2017-06-09 22:49:54

f8c07f6

add sum_in_range problem.

2017-06-09 02:53:55

5c20f1f

shorten my original solution.

2017-06-09 02:35:19

06845a0

sum of two using set intersection.

2017-06-09 02:29:18

9e4990c

add implementation using hash.

2017-06-09 02:24:04

4527b79

solve sum of two.

2017-06-09 02:16:39

90b7a3f

find early exit from loop to prevent unnecessary comparisons.

2017-06-08 23:21:26

623f367

use a hash instead of Set.

2017-06-08 04:08:01

089bdcd

recursive solution.

2017-06-08 04:05:33

36b188d

recursive solution for sum subsets.

2017-06-08 03:59:27

167a0ab

add binstub for rspec.

2017-06-07 20:11:37

1e59e1e

add another example of gcd.

2017-06-07 19:52:16

dc969c5

greatest commond divisor using Euclids algorithm.

2017-06-07 19:50:42

0562662

example of lcs using dynamic programming.

2017-06-07 19:42:14

6cf9b5d

career cup link to swap lex order.

2017-06-07 03:30:17

1be81f4

crappy version that works for first test case.

2017-06-06 03:12:31

8153216

start work on sum subsets.

2017-06-06 02:49:38

28132aa

short circuit comparisons if not in range.

2017-06-06 00:07:44

19bfc6c

implement insane dynamic programming version of text justification.

2017-06-05 23:19:48

fcc8a18

remove extra sort

2017-06-05 19:06:20

5f8366c

small optimizations.

2017-06-05 16:03:35

78b0e21

use a union find to find the connected components.

2017-06-05 15:46:27

0c1fc93

early exit if node equals computed max.

2017-06-04 23:28:45

1fb545c

depth first traversal to find max.

2017-06-04 23:25:08

13afe47

start problem swap lexical order.

2017-06-04 03:52:48

564b9e7

remove pad_right call from pad_center.

2017-06-04 03:30:31

0ecfdfb

remove unnecessary join.

2017-06-04 03:04:09

24f11d8

extract pad_right.

2017-06-04 02:59:28

1fe10ba

get all text justification tests passing.

2017-06-03 03:14:09

b201978

fix bug with range.

2017-06-01 17:57:26

d9309d3

exit early on last line.

2017-06-01 01:47:19

11c9224

break as soon as we hit 0.

2017-05-31 21:56:40

54989b6

add more text justification tests.

2017-05-31 21:54:04

fbd4068

first try at text justification.

2017-05-31 21:38:05

2bab673

add text justification problem.

2017-05-31 20:35:15

e9a7d6f

complete s-expression version.

2017-05-31 19:39:16

35386c1

add missing tests for tree level sum.

2017-05-31 17:35:06

3f934d0

single pass calc.

2017-05-31 17:12:39

06b5cdc

tokenize and build ast for tree level sum.

2017-05-30 22:58:11

8283923

add first tree level sum spec.

2017-05-29 21:04:39

40aac84

increase input size

2017-05-26 00:11:57

cec7a07

plot input size on x axis and time on y-axis.

2017-05-26 00:03:01

9387472

comment out slow implementation.

2017-05-25 23:58:48

614e15d

convert points to a line chart.

2017-05-25 23:58:35

« First ← Newer Page 2 of 3 Older → Last »