GitHub/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges synced 2026-01-03 16:08:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fixed Constraints section label and link anchor.

Browse Source
This commit is contained in:
Donne Martin
2015-06-30 05:55:58 -04:00
parent b0a42468f1
commit e5fde7ea8c
29 changed files with 29 additions and 29 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
stacks_queues/hanoi/hanoi.ipynb
View File

@@ -13,7 +13,7 @@
"source": [
"## Problem: Implement the [Towers of Hanoi](http://en.wikipedia.org/wiki/Tower_of_Hanoi) with 3 towers and N disks.\n",
"\n",
"* [Constraints and Assumptions](#Constraints-and-Assumptions)\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",
"* [Algorithm](#Algorithm)\n",
"* [Code](#Code)\n",

2
stacks_queues/n_stacks/n_stacks.ipynb
View File

@@ -13,7 +13,7 @@
"source": [
"## Problem: Implement n stacks using a single array.\n",
"\n",
"* [Constraints and Assumptions](#Constraints-and-Assumptions)\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",
"* [Algorithm](#Algorithm)\n",
"* [Code](#Code)\n",

2
stacks_queues/queue_from_stacks/queue_from_stacks.ipynb
View File

@@ -13,7 +13,7 @@
"source": [
"## Problem: Implement a queue using two stacks.\n",
"\n",
"* [Constraints and Assumptions](#Constraints-and-Assumptions)\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",
"* [Algorithm](#Algorithm)\n",
"* [Code](#Code)\n",

2
stacks_queues/queue_list/queue_list.ipynb
View File

@@ -13,7 +13,7 @@
"source": [
"## Problem: Implement a queue with enqueue and dequeue methods using a linked list.\n",
"\n",
"* [Constraints and Assumptions](#Constraints-and-Assumptions)\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",
"* [Algorithm](#Algorithm)\n",
"* [Code](#Code)\n",

2
stacks_queues/set_of_stacks/set_of_stacks.ipynb
View File

@@ -13,7 +13,7 @@
"source": [
"## Problem: Implement SetOfStacks that wraps a list of stacks, where each stack is bound by a capacity.\n",
"\n",
"* [Constraints and Assumptions](#Constraints-and-Assumptions)\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",
"* [Algorithm](#Algorithm)\n",
"* [Code](#Code)\n",

2
stacks_queues/sort_stack/sort_stack.ipynb
View File

@@ -13,7 +13,7 @@
"source": [
"## Problem: Sort a stack. You can use another stack as a buffer.\n",
"\n",
"* [Constraints and Assumptions](#Constraints-and-Assumptions)\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",
"* [Algorithm](#Algorithm)\n",
"* [Code](#Code)\n",

2
stacks_queues/stack/stack.ipynb
View File

@@ -13,7 +13,7 @@
"source": [
"## Problem: Implement a stack with push, pop, peek, and is_empty methods using a linked list.\n",
"\n",
"* [Constraints and Assumptions](#Constraints-and-Assumptions)\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",
"* [Algorithm](#Algorithm)\n",
"* [Code](#Code)\n",

2
stacks_queues/stack_min/stack_min.ipynb
View File

@@ -13,7 +13,7 @@
"source": [
"## Problem: Implement a stack with push, pop, and min methods running O(1) time.\n",
"\n",
"* [Constraints and Assumptions](#Constraints-and-Assumptions)\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",
"* [Algorithm](#Algorithm)\n",
"* [Code](#Code)\n",