37 Commits

Author	SHA1	Message	Date
Donne Martin	b109b6f8cc	Simplified challenge coding and unit tests by working with the node directly as opposed to node.id or node.data, which is more natural when writing coding challenges.	2015-08-05 06:14:44 -04:00
Donne Martin	1c5f34eb3e	Added graph path exists challenge.	2015-08-05 05:49:41 -04:00
Donne Martin	74d25491ca	Tweaked ordering of graph and bst challenges.	2015-08-05 05:47:02 -04:00
Donne Martin	25eaf0224a	Simplified check to determine if there are items in the queue.	2015-08-05 05:45:30 -04:00
Donne Martin	370ceaf414	Simplified check to determine if there are items in the queue.	2015-08-05 05:45:02 -04:00
Donne Martin	bad87c9f87	Added graph bfs challenge.	2015-08-04 20:02:28 -04:00
Donne Martin	43eb3f84fa	Added graph dfs challenge.	2015-08-04 20:01:59 -04:00
Donne Martin	1e5ff4f465	Added results.py, which helps with testing graph and tree problems.	2015-08-04 19:46:22 -04:00
Donne Martin	acc72a8b8a	Added utils/__init__.py	2015-08-04 19:45:38 -04:00
Donne Martin	ab69f7d066	Reworked graph challenge.	2015-08-04 19:37:05 -04:00
Donne Martin	77438319a5	Removed unused import statements, fixed compile error on skeleton challenge code.	2015-08-04 19:36:05 -04:00
Donne Martin	706ccd3256	Reworked tree dfs unit tests.	2015-08-04 19:35:19 -04:00
Donne Martin	db798ed6a7	Reworked tree bfs unit tests.	2015-08-04 19:34:54 -04:00
Donne Martin	72e133a96c	Reworked bst unit tests.	2015-08-04 19:33:42 -04:00
Donne Martin	9dc4116256	Revised constraints and algorithm. Added comment denoting key/value for each dictionary in the code section.	2015-08-04 08:09:16 -04:00
Donne Martin	92e0318952	Added basic graph implementation challenge.	2015-08-03 06:24:38 -04:00
Donne Martin	0f55ccf38d	Added tree height challenge.	2015-08-02 10:53:35 -04:00
Donne Martin	13d08b80fd	Simpilfied depth first search challenge.	2015-08-01 17:48:52 -04:00
Donne Martin	332230c3a1	Simpilfied breadth first search challenge.	2015-08-01 17:48:12 -04:00
Donne Martin	31058abf3a	Simpilfied bst challenge.	2015-08-01 17:44:14 -04:00
Donne Martin	e55c7ee1c6	Revised dfs challenge to be more self contained for simplicity.	2015-08-01 16:47:41 -04:00
Donne Martin	69f68287e3	Revised bfs challenge to be more self contained for simplicity.	2015-08-01 16:47:29 -04:00
Donne Martin	a0b6421f79	Removing bst implementation, tree challenges will be more independent for simplicity.	2015-08-01 16:46:40 -04:00
Donne Martin	4fc25a0a98	Updated solution notebook nbviewer link.	2015-08-01 09:41:28 -04:00
Donne Martin	bf5f54dc7b	Updated solution notebook nbviewer link.	2015-08-01 09:41:01 -04:00
Donne Martin	f672839f7d	Updated solution notebook nbviewer link.	2015-08-01 09:40:35 -04:00
Donne Martin	11f94f9ba8	Removed mention of queue as those are potential hints in solving the problem.	2015-08-01 09:31:52 -04:00
Donne Martin	a6cc0f266c	Added tree depth first search challenge.	2015-08-01 09:26:28 -04:00
Donne Martin	884d8aca80	Added tree breadth first search challenge.	2015-08-01 09:26:03 -04:00
Donne Martin	a6c7f71379	Added binary search tree challenge.	2015-08-01 09:25:14 -04:00
Donne Martin	757eca26f1	Added unit testing utility to redirect print output to help validate some functions.	2015-08-01 09:24:19 -04:00
Donne Martin	de88fd3508	Moved binary tree challenge to staging area for further development.	2015-07-22 04:32:06 -04:00
mag6367	5aed5ee41f	Merge branch 'master' of https://github.com/mag6367/interactive-coding-challenges	2015-07-18 00:57:12 -05:00
mag6367	980eabae68	binary tree implementation	2015-07-18 00:55:33 -05:00
Marco	2576e5cdba	Delete .DS_Store	2015-07-18 00:41:25 -05:00
Marco	f8bccf47aa	Delete .DS_Store	2015-07-18 00:40:46 -05:00
mag6367	5043e791b5	binary search tree implementation	2015-07-18 00:40:13 -05:00