63 N-dimensional N^N array filled with N 2017-02-28T16:48:37.493

44 Implementing a stack 2018-07-27T11:27:25.810

30 Should we be friends? 2017-03-29T04:08:02.937

24 Drawing a tree from an array 2019-02-13T18:39:30.470

23 Stack Exchanging 2016-05-30T16:54:38.967

22 Neutralize data 2017-01-16T09:44:45.540

21 Implement lazy lists, preferably in a language you don't know well 2011-05-01T06:31:58.643

20 Implement bag operations 2016-07-02T21:37:45.730

20 Validate a stem-and-leaf plot 2016-09-13T22:05:14.477

19 Turn over a new leaf 2015-06-20T21:24:49.660

18 Numbering Hierarchical Outlines 2015-07-21T22:19:06.310

17 Search text for a prefix and list all its suffixes in the text 2018-07-16T12:06:46.970

16 Binary tree rotations 2018-05-19T10:28:18.173

14 Is it a max-heap? 2016-07-10T22:50:19.270

13 Prefix Tree Traversal 2015-08-15T03:14:00.623

13 Evaluate a simple spreadsheet 2017-03-27T09:15:41.977

12 Simple CSV/DSV importer 2017-02-28T19:35:40.317

12 Disentangle doubly linked data 2017-12-29T16:34:37.350

9 Flexagonal flexagation 2016-09-14T23:45:02.340

8 Compute the height of a radix tree 2016-12-02T08:19:04.343

8 Charlie and the evil hyphen 2017-04-11T20:51:51.467

8 Squaring Off (fit to smallest possible square) 2017-05-15T05:52:02.063

6 Generate the python dictionary of phone keypresses for any letter 2014-04-11T19:35:06.263

6 Collatz Graph Plotting 2014-08-01T16:45:51.553

6 Shortest class to implement Perl hash-of-hashes 2016-03-25T02:50:59.547

6 Regrowing trees 2018-01-19T11:45:02.337

5 Shortest implementation of a linked list, stack and queue 2013-11-08T21:08:28.110

5 Heaps of trouble 2015-01-15T00:12:03.430

5 Most efficient table storage for determining recurrence 2015-07-14T21:01:11.800

5 Decode my I2C Stream! 2017-06-15T13:35:48.333

4 Implement cdbmake 2011-02-20T02:57:45.333

2 Immutable dictionaries in Haskell 2014-05-15T10:01:55.543

1 Building a Structured Outline 2019-05-11T20:20:43.573

0 Build a numerical library without using any primitive data type 2014-02-03T19:48:15.560

-4 Strings: Microsoft interview 2013-07-06T20:10:55.090