From e5fde7ea8c661f104a058af4fdad0e0df2d1de54 Mon Sep 17 00:00:00 2001 From: Donne Martin Date: Tue, 30 Jun 2015 05:55:58 -0400 Subject: [PATCH] Fixed Constraints section label and link anchor. --- arrays_strings/compress/compress.ipynb | 2 +- arrays_strings/hash_map/hash_map.ipynb | 2 +- arrays_strings/permutation/permutation.ipynb | 2 +- arrays_strings/replace_char/replace_char.ipynb | 2 +- arrays_strings/reverse_string/reverse_string.ipynb | 2 +- arrays_strings/rotation/rotation_challenge.ipynb | 2 +- arrays_strings/rotation/rotation_solution.ipynb | 2 +- arrays_strings/unique_chars/unique_chars.ipynb | 2 +- linked_lists/add_reverse/add_reverse.ipynb | 2 +- linked_lists/delete_mid/delete_mid.ipynb | 2 +- linked_lists/find_loop_start/find_loop_start.ipynb | 2 +- linked_lists/kth_to_last_elem/kth_to_last_elem.ipynb | 2 +- linked_lists/linked_list/linked_list.ipynb | 2 +- linked_lists/palindrome/palindrome.ipynb | 2 +- linked_lists/partition/partition.ipynb | 2 +- linked_lists/remove_duplicates/remove_duplicates.ipynb | 2 +- recursion_dynamic/fibonacci.ipynb | 2 +- sorting_searching/insertion_sort/insertion_sort.ipynb | 2 +- sorting_searching/merge_sort/merge_sort.ipynb | 2 +- sorting_searching/quick_sort/quick_sort.ipynb | 2 +- sorting_searching/selection_sort/selection_sort.ipynb | 2 +- stacks_queues/hanoi/hanoi.ipynb | 2 +- stacks_queues/n_stacks/n_stacks.ipynb | 2 +- stacks_queues/queue_from_stacks/queue_from_stacks.ipynb | 2 +- stacks_queues/queue_list/queue_list.ipynb | 2 +- stacks_queues/set_of_stacks/set_of_stacks.ipynb | 2 +- stacks_queues/sort_stack/sort_stack.ipynb | 2 +- stacks_queues/stack/stack.ipynb | 2 +- stacks_queues/stack_min/stack_min.ipynb | 2 +- 29 files changed, 29 insertions(+), 29 deletions(-) diff --git a/arrays_strings/compress/compress.ipynb b/arrays_strings/compress/compress.ipynb index c5919c9..4da5513 100644 --- a/arrays_strings/compress/compress.ipynb +++ b/arrays_strings/compress/compress.ipynb @@ -13,7 +13,7 @@ "source": [ "## Problem: Compress a string such that 'AAABCCDDDD' becomes 'A3B1C2D4'\n", "\n", - "* [Constraints and Assumptions](#Constraints-and-Assumptions)\n", + "* [Constraints](#Constraints)\n", "* [Test Cases](#Test-Cases)\n", "* [Algorithm: List](#Algorithm:-List)\n", "* [Code: List](#Code:-List)\n", diff --git a/arrays_strings/hash_map/hash_map.ipynb b/arrays_strings/hash_map/hash_map.ipynb index 8bf9a16..68b6b39 100644 --- a/arrays_strings/hash_map/hash_map.ipynb +++ b/arrays_strings/hash_map/hash_map.ipynb @@ -13,7 +13,7 @@ "source": [ "## Problem: Implement a hash table with set, get, and remove methods.\n", "\n", - "* [Constraints and Assumptions](#Constraints-and-Assumptions)\n", + "* [Constraints](#Constraints)\n", "* [Test Cases](#Test-Cases)\n", "* [Algorithm](#Algorithm)\n", "* [Code](#Code)\n", diff --git a/arrays_strings/permutation/permutation.ipynb b/arrays_strings/permutation/permutation.ipynb index 54d026f..57a25f3 100644 --- a/arrays_strings/permutation/permutation.ipynb +++ b/arrays_strings/permutation/permutation.ipynb @@ -13,7 +13,7 @@ "source": [ "## Problem: Determine if a string is a permutation of another string\n", "\n", - "* [Constraints and Assumptions](#Constraints-and-Assumptions)\n", + "* [Constraints](#Constraints)\n", "* [Test Cases](#Test-Cases)\n", "* [Algorithm: Compare Sorted Strings](#Algorithm:-Compare-Sorted-Strings)\n", "* [Code: Compare Sorted Strings](#Code:-Compare-Sorted-Strings)\n", diff --git a/arrays_strings/replace_char/replace_char.ipynb b/arrays_strings/replace_char/replace_char.ipynb index 8a6fe7a..cd12f74 100644 --- a/arrays_strings/replace_char/replace_char.ipynb +++ b/arrays_strings/replace_char/replace_char.ipynb @@ -13,7 +13,7 @@ "source": [ "## Problem: Given a string, replace in-place all spaces with '%20'\n", "\n", - "* [Constraints and Assumptions](#Constraints-and-Assumptions)\n", + "* [Constraints](#Constraints)\n", "* [Test Cases](#Test-Cases)\n", "* [Algorithm](#Algorithm)\n", "* [Code](#Code)\n", diff --git a/arrays_strings/reverse_string/reverse_string.ipynb b/arrays_strings/reverse_string/reverse_string.ipynb index f6c2edd..af70efc 100644 --- a/arrays_strings/reverse_string/reverse_string.ipynb +++ b/arrays_strings/reverse_string/reverse_string.ipynb @@ -13,7 +13,7 @@ "source": [ "## Problem: Implement a function to reverse a string.\n", "\n", - "* [Constraints and Assumptions](#Constraints-and-Assumptions)\n", + "* [Constraints](#Constraints)\n", "* [Test Cases](#Test-Cases)\n", "* [Algorithm](#Algorithm)\n", "* [Code](#Code)\n", diff --git a/arrays_strings/rotation/rotation_challenge.ipynb b/arrays_strings/rotation/rotation_challenge.ipynb index cd9661c..88e1d49 100644 --- a/arrays_strings/rotation/rotation_challenge.ipynb +++ b/arrays_strings/rotation/rotation_challenge.ipynb @@ -13,7 +13,7 @@ "source": [ "## Problem: Determine if a string s1 is a rotation of another string s2, by calling (only once) a function is_substring\n", "\n", - "* [Constraints and Assumptions](#Constraints-and-Assumptions)\n", + "* [Constraints](#Constraints)\n", "* [Test Cases](#Test-Cases)\n", "* [Algorithm](#Algorithm)\n", "* [Code](#Code)\n", diff --git a/arrays_strings/rotation/rotation_solution.ipynb b/arrays_strings/rotation/rotation_solution.ipynb index 8d0ca9b..1dcb66e 100644 --- a/arrays_strings/rotation/rotation_solution.ipynb +++ b/arrays_strings/rotation/rotation_solution.ipynb @@ -13,7 +13,7 @@ "source": [ "## Problem: Determine if a string s1 is a rotation of another string s2, by calling (only once) a function is_substring\n", "\n", - "* [Constraints and Assumptions](#Constraints-and-Assumptions)\n", + "* [Constraints](#Constraints)\n", "* [Test Cases](#Test-Cases)\n", "* [Algorithm](#Algorithm)\n", "* [Code](#Code)\n", diff --git a/arrays_strings/unique_chars/unique_chars.ipynb b/arrays_strings/unique_chars/unique_chars.ipynb index 190aa14..5ec3108 100644 --- a/arrays_strings/unique_chars/unique_chars.ipynb +++ b/arrays_strings/unique_chars/unique_chars.ipynb @@ -13,7 +13,7 @@ "source": [ "## Problem: Implement an algorithm to determine if a string has all unique characters\n", "\n", - "* [Constraints and Assumptions](#Constraints-and-Assumptions)\n", + "* [Constraints](#Constraints)\n", "* [Test Cases](#Test-Cases)\n", "* [Algorithm 1: Sets and Length Comparison](#Algorithm-1:-Sets-and-Length-Comparison)\n", "* [Code: Sets and Length Comparison](#Code:-Sets-and-Length-Comparison)\n", diff --git a/linked_lists/add_reverse/add_reverse.ipynb b/linked_lists/add_reverse/add_reverse.ipynb index b76ff02..8690051 100644 --- a/linked_lists/add_reverse/add_reverse.ipynb +++ b/linked_lists/add_reverse/add_reverse.ipynb @@ -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", diff --git a/linked_lists/delete_mid/delete_mid.ipynb b/linked_lists/delete_mid/delete_mid.ipynb index 3633813..79d86dc 100644 --- a/linked_lists/delete_mid/delete_mid.ipynb +++ b/linked_lists/delete_mid/delete_mid.ipynb @@ -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", diff --git a/linked_lists/find_loop_start/find_loop_start.ipynb b/linked_lists/find_loop_start/find_loop_start.ipynb index ada4305..b8bfa55 100644 --- a/linked_lists/find_loop_start/find_loop_start.ipynb +++ b/linked_lists/find_loop_start/find_loop_start.ipynb @@ -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", diff --git a/linked_lists/kth_to_last_elem/kth_to_last_elem.ipynb b/linked_lists/kth_to_last_elem/kth_to_last_elem.ipynb index b5cbfe5..1975b45 100644 --- a/linked_lists/kth_to_last_elem/kth_to_last_elem.ipynb +++ b/linked_lists/kth_to_last_elem/kth_to_last_elem.ipynb @@ -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", diff --git a/linked_lists/linked_list/linked_list.ipynb b/linked_lists/linked_list/linked_list.ipynb index 346310c..2255f0e 100644 --- a/linked_lists/linked_list/linked_list.ipynb +++ b/linked_lists/linked_list/linked_list.ipynb @@ -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", diff --git a/linked_lists/palindrome/palindrome.ipynb b/linked_lists/palindrome/palindrome.ipynb index 592a22a..430f9e5 100644 --- a/linked_lists/palindrome/palindrome.ipynb +++ b/linked_lists/palindrome/palindrome.ipynb @@ -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", diff --git a/linked_lists/partition/partition.ipynb b/linked_lists/partition/partition.ipynb index cdf67ee..ba82f75 100644 --- a/linked_lists/partition/partition.ipynb +++ b/linked_lists/partition/partition.ipynb @@ -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", diff --git a/linked_lists/remove_duplicates/remove_duplicates.ipynb b/linked_lists/remove_duplicates/remove_duplicates.ipynb index c04647f..84764c0 100644 --- a/linked_lists/remove_duplicates/remove_duplicates.ipynb +++ b/linked_lists/remove_duplicates/remove_duplicates.ipynb @@ -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", diff --git a/recursion_dynamic/fibonacci.ipynb b/recursion_dynamic/fibonacci.ipynb index bb2bef6..98d8e02 100644 --- a/recursion_dynamic/fibonacci.ipynb +++ b/recursion_dynamic/fibonacci.ipynb @@ -13,7 +13,7 @@ "source": [ "## Problem: Implement fibonacci recursively, dynamically, and iteratively.\n", "\n", - "* [Constraints and Assumptions](#Constraints-and-Assumptions)\n", + "* [Constraints](#Constraints)\n", "* [Test Cases](#Test-Cases)\n", "* [Algorithm](#Algorithm)\n", "* [Code: Recursive](#Code:-Recursive)\n", diff --git a/sorting_searching/insertion_sort/insertion_sort.ipynb b/sorting_searching/insertion_sort/insertion_sort.ipynb index 69d264f..7d38833 100644 --- a/sorting_searching/insertion_sort/insertion_sort.ipynb +++ b/sorting_searching/insertion_sort/insertion_sort.ipynb @@ -13,7 +13,7 @@ "source": [ "## Problem: Implement insertion sort.\n", "\n", - "* [Constraints and Assumptions](#Constraints-and-Assumptions)\n", + "* [Constraints](#Constraints)\n", "* [Test Cases](#Test-Cases)\n", "* [Algorithm](#Algorithm)\n", "* [Code](#Code)\n", diff --git a/sorting_searching/merge_sort/merge_sort.ipynb b/sorting_searching/merge_sort/merge_sort.ipynb index ba1521b..6672786 100644 --- a/sorting_searching/merge_sort/merge_sort.ipynb +++ b/sorting_searching/merge_sort/merge_sort.ipynb @@ -13,7 +13,7 @@ "source": [ "## Problem: Implement merge sort.\n", "\n", - "* [Constraints and Assumptions](#Constraints-and-Assumptions)\n", + "* [Constraints](#Constraints)\n", "* [Test Cases](#Test-Cases)\n", "* [Algorithm](#Algorithm)\n", "* [Code](#Code)\n", diff --git a/sorting_searching/quick_sort/quick_sort.ipynb b/sorting_searching/quick_sort/quick_sort.ipynb index 2458ee3..2b598b4 100644 --- a/sorting_searching/quick_sort/quick_sort.ipynb +++ b/sorting_searching/quick_sort/quick_sort.ipynb @@ -13,7 +13,7 @@ "source": [ "## Problem: Implement quick sort.\n", "\n", - "* [Constraints and Assumptions](#Constraints-and-Assumptions)\n", + "* [Constraints](#Constraints)\n", "* [Test Cases](#Test-Cases)\n", "* [Algorithm](#Algorithm)\n", "* [Code](#Code)\n", diff --git a/sorting_searching/selection_sort/selection_sort.ipynb b/sorting_searching/selection_sort/selection_sort.ipynb index c6c0896..d269c9f 100644 --- a/sorting_searching/selection_sort/selection_sort.ipynb +++ b/sorting_searching/selection_sort/selection_sort.ipynb @@ -13,7 +13,7 @@ "source": [ "## Problem: Implement selection sort.\n", "\n", - "* [Constraints and Assumptions](#Constraints-and-Assumptions)\n", + "* [Constraints](#Constraints)\n", "* [Test Cases](#Test-Cases)\n", "* [Algorithm](#Algorithm)\n", "* [Code](#Code)\n", diff --git a/stacks_queues/hanoi/hanoi.ipynb b/stacks_queues/hanoi/hanoi.ipynb index a9c61c1..68ada38 100644 --- a/stacks_queues/hanoi/hanoi.ipynb +++ b/stacks_queues/hanoi/hanoi.ipynb @@ -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", diff --git a/stacks_queues/n_stacks/n_stacks.ipynb b/stacks_queues/n_stacks/n_stacks.ipynb index 9a93c7d..b54e618 100644 --- a/stacks_queues/n_stacks/n_stacks.ipynb +++ b/stacks_queues/n_stacks/n_stacks.ipynb @@ -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", diff --git a/stacks_queues/queue_from_stacks/queue_from_stacks.ipynb b/stacks_queues/queue_from_stacks/queue_from_stacks.ipynb index 9fdd363..bdfff28 100644 --- a/stacks_queues/queue_from_stacks/queue_from_stacks.ipynb +++ b/stacks_queues/queue_from_stacks/queue_from_stacks.ipynb @@ -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", diff --git a/stacks_queues/queue_list/queue_list.ipynb b/stacks_queues/queue_list/queue_list.ipynb index 1899c88..042fdfb 100644 --- a/stacks_queues/queue_list/queue_list.ipynb +++ b/stacks_queues/queue_list/queue_list.ipynb @@ -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", diff --git a/stacks_queues/set_of_stacks/set_of_stacks.ipynb b/stacks_queues/set_of_stacks/set_of_stacks.ipynb index 729641c..2466f53 100644 --- a/stacks_queues/set_of_stacks/set_of_stacks.ipynb +++ b/stacks_queues/set_of_stacks/set_of_stacks.ipynb @@ -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", diff --git a/stacks_queues/sort_stack/sort_stack.ipynb b/stacks_queues/sort_stack/sort_stack.ipynb index adddecd..3332870 100644 --- a/stacks_queues/sort_stack/sort_stack.ipynb +++ b/stacks_queues/sort_stack/sort_stack.ipynb @@ -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", diff --git a/stacks_queues/stack/stack.ipynb b/stacks_queues/stack/stack.ipynb index 86b28c9..fb147cf 100644 --- a/stacks_queues/stack/stack.ipynb +++ b/stacks_queues/stack/stack.ipynb @@ -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", diff --git a/stacks_queues/stack_min/stack_min.ipynb b/stacks_queues/stack_min/stack_min.ipynb index 8aec537..cca00f5 100644 --- a/stacks_queues/stack_min/stack_min.ipynb +++ b/stacks_queues/stack_min/stack_min.ipynb @@ -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",