StarMirror/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges.git synced 2024-03-22 13:11:13 +08:00
Code Issues 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
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
arrays_strings/compress/compress.ipynb
View File

@ -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",

2
arrays_strings/hash_map/hash_map.ipynb
View File

@ -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",

2
arrays_strings/permutation/permutation.ipynb
View File

@ -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",

2
arrays_strings/replace_char/replace_char.ipynb
View File

@ -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",

2
arrays_strings/reverse_string/reverse_string.ipynb
View File

@ -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",

2
arrays_strings/rotation/rotation_challenge.ipynb
View File

@ -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",

2
arrays_strings/rotation/rotation_solution.ipynb
View File

@ -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",

2
arrays_strings/unique_chars/unique_chars.ipynb
View File

@ -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",

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",

2
recursion_dynamic/fibonacci.ipynb
View File

@ -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",

2
sorting_searching/insertion_sort/insertion_sort.ipynb
View File

@ -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",

2
sorting_searching/merge_sort/merge_sort.ipynb
View File

@ -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",

2
sorting_searching/quick_sort/quick_sort.ipynb
View File

@ -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",

2
sorting_searching/selection_sort/selection_sort.ipynb
View File

@ -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",

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",