GitHub/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges synced 2026-01-11 03:48:03 +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
linked_lists/add_reverse/add_reverse.ipynb
View File

@@ -13,7 +13,7 @@
"source": [
"## Problem: Add two numbers whose digits are stored in a linked list in reverse order.\n",
"\n",
"* [Constraints and Assumptions](#Constraints-and-Assumptions)\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",
"* [Algorithm](#Algorithm)\n",
"* [Code](#Code)\n",

2
linked_lists/delete_mid/delete_mid.ipynb
View File

@@ -13,7 +13,7 @@
"source": [
"## Problem: Delete a node in the middle, given only access to that node.\n",
"\n",
"* [Constraints and Assumptions](#Constraints-and-Assumptions)\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",
"* [Algorithm](#Algorithm)\n",
"* [Code](#Code)\n",

2
linked_lists/find_loop_start/find_loop_start.ipynb
View File

@@ -13,7 +13,7 @@
"source": [
"## Problem: Find the start of a linked list loop.\n",
"\n",
"* [Constraints and Assumptions](#Constraints-and-Assumptions)\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",
"* [Algorithm](#Algorithm)\n",
"* [Code](#Code)\n",

2
linked_lists/kth_to_last_elem/kth_to_last_elem.ipynb
View File

@@ -13,7 +13,7 @@
"source": [
"## Problem: Find the kth to last element of 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
linked_lists/linked_list/linked_list.ipynb
View File

@@ -13,7 +13,7 @@
"source": [
"## Problem: Implement a linked list with insert, append, find, delete, length, and print methods\n",
"\n",
"* [Constraints and Assumptions](#Constraints-and-Assumptions)\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",
"* [Algorithm](#Algorithm)\n",
"* [Code](#Code)\n",

2
linked_lists/palindrome/palindrome.ipynb
View File

@@ -13,7 +13,7 @@
"source": [
"## Problem: Determine if a linked list is a palindrome.\n",
"\n",
"* [Constraints and Assumptions](#Constraints-and-Assumptions)\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",
"* [Algorithm](#Algorithm)\n",
"* [Code](#Code)\n",

2
linked_lists/partition/partition.ipynb
View File

@@ -13,7 +13,7 @@
"source": [
"## Problem: Partition a linked list around a value x, such that all nodes less than x come before all nodes greater than or equal to x.\n",
"\n",
"* [Constraints and Assumptions](#Constraints-and-Assumptions)\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",
"* [Algorithm](#Algorithm)\n",
"* [Code](#Code)\n",

2
linked_lists/remove_duplicates/remove_duplicates.ipynb
View File

@@ -13,7 +13,7 @@
"source": [
"## Problem: Remove duplicates from a linked list\n",
"\n",
"* [Constraints and Assumptions](#Constraints-and-Assumptions)\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",
"* [Algorithm: Hash Map Lookup](#Algorithm:-Hash-Map-Lookup)\n",
"* [Code: Hash Map Lookup](#Code:-Hash-Map-Lookup)\n",