GitHub/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges synced 2026-01-05 00: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
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",