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

Fix challenge titles punctuation (#132)

Browse Source
This commit is contained in:
Donne Martin 2016-12-18 07:20:35 -05:00 committed by GitHub
parent daa7fba255
commit f0ae87ed74
14 changed files with 24 additions and 24 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
arrays_strings/permutation/permutation_challenge.ipynb
View File

@ -18,7 +18,7 @@
"cell_type": "markdown",
"metadata": {},
"source": [
"## Problem: Determine if a string is a permutation of another string\n",
"## Problem: Determine if a string is a permutation of another string.\n",
"\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",

2
arrays_strings/permutation/permutation_solution.ipynb
View File

@ -18,7 +18,7 @@
"cell_type": "markdown",
"metadata": {},
"source": [
"## Problem: Determine if a string is a permutation of another string\n",
"## Problem: Determine if a string is a permutation of another string.\n",
"\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",

2
arrays_strings/rotation/rotation_challenge.ipynb
View File

@ -18,7 +18,7 @@
"cell_type": "markdown",
"metadata": {},
"source": [
"## Problem: Determine if a string s1 is a rotation of another string s2, by calling (only once) a function is_substring\n",
"## Problem: Determine if a string s1 is a rotation of another string s2, by calling (only once) a function is_substring.\n",
"\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",

2
arrays_strings/rotation/rotation_solution.ipynb
View File

@ -18,7 +18,7 @@
"cell_type": "markdown",
"metadata": {},
"source": [
"## Problem: Determine if a string s1 is a rotation of another string s2, by calling (only once) a function is_substring\n",
"## Problem: Determine if a string s1 is a rotation of another string s2, by calling (only once) a function is_substring.\n",
"\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",

2
arrays_strings/unique_chars/unique_chars_challenge.ipynb
View File

@ -18,7 +18,7 @@
"cell_type": "markdown",
"metadata": {},
"source": [
"## Problem: Implement an algorithm to determine if a string has all unique characters\n",
"## Problem: Implement an algorithm to determine if a string has all unique characters.\n",
"\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",

2
arrays_strings/unique_chars/unique_chars_solution.ipynb
View File

@ -18,7 +18,7 @@
"cell_type": "markdown",
"metadata": {},
"source": [
"## Problem: Implement an algorithm to determine if a string has all unique characters\n",
"## Problem: Implement an algorithm to determine if a string has all unique characters.\n",
"\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",

2
linked_lists/kth_to_last_elem/kth_to_last_elem_challenge.ipynb
View File

@ -18,7 +18,7 @@
"cell_type": "markdown",
"metadata": {},
"source": [
"## Problem: Find the kth to last element of a linked list\n",
"## Problem: Find the kth to last element of a linked list.\n",
"\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",

2
linked_lists/kth_to_last_elem/kth_to_last_elem_solution.ipynb
View File

@ -18,7 +18,7 @@
"cell_type": "markdown",
"metadata": {},
"source": [
"## Problem: Find the kth to last element of a linked list\n",
"## Problem: Find the kth to last element of a linked list.\n",
"\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",

2
linked_lists/linked_list/linked_list_challenge.ipynb
View File

@ -18,7 +18,7 @@
"cell_type": "markdown",
"metadata": {},
"source": [
"## Problem: Implement a linked list with insert, append, find, delete, length, and print methods\n",
"## Problem: Implement a linked list with insert, append, find, delete, length, and print methods.\n",
"\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",

2
linked_lists/linked_list/linked_list_solution.ipynb
View File

@ -18,7 +18,7 @@
"cell_type": "markdown",
"metadata": {},
"source": [
"## Problem: Implement a linked list with insert, append, find, delete, length, and print methods\n",
"## Problem: Implement a linked list with insert, append, find, delete, length, and print methods.\n",
"\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",

2
linked_lists/remove_duplicates/remove_duplicates_challenge.ipynb
View File

@ -18,7 +18,7 @@
"cell_type": "markdown",
"metadata": {},
"source": [
"## Problem: Remove duplicates from a linked list\n",
"## Problem: Remove duplicates from a linked list.\n",
"\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",

2
linked_lists/remove_duplicates/remove_duplicates_solution.ipynb
View File

@ -18,7 +18,7 @@
"cell_type": "markdown",
"metadata": {},
"source": [
"## Problem: Remove duplicates from a linked list\n",
"## Problem: Remove duplicates from a linked list.\n",
"\n",
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",

12
recursion_dynamic/coin_change_ways/coin_change_ways_challenge.ipynb
View File

@ -18,7 +18,7 @@
"cell_type": "markdown",
"metadata": {},
"source": [
"## Problem: Counting Ways of Making Change\n",
"## Problem: Counting Ways of Making Change.\n",
"\n",
"* [Explanation](#Explanation)\n",
"* [Test Cases](#Test-Cases)\n",
@ -137,21 +137,21 @@
],
"metadata": {
"kernelspec": {
"display_name": "Python 2",
"display_name": "Python 3",
"language": "python",
"name": "python2"
"name": "python3"
},
"language_info": {
"codemirror_mode": {
"name": "ipython",
"version": 2
"version": 3
},
"file_extension": ".py",
"mimetype": "text/x-python",
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython2",
"version": "2.7.10"
"pygments_lexer": "ipython3",
"version": "3.5.0"
}
},
"nbformat": 4,

12
recursion_dynamic/coin_change_ways/coin_change_ways_solution.ipynb
View File

@ -18,7 +18,7 @@
"cell_type": "markdown",
"metadata": {},
"source": [
"## Problem: Counting Ways of Making Change\n",
"## Problem: Counting Ways of Making Change.\n",
"\n",
"* [Hints](#Hints)\n",
"* [Algorithm](#Algorithm)\n",
@ -150,21 +150,21 @@
],
"metadata": {
"kernelspec": {
"display_name": "Python 2",
"display_name": "Python 3",
"language": "python",
"name": "python2"
"name": "python3"
},
"language_info": {
"codemirror_mode": {
"name": "ipython",
"version": 2
"version": 3
},
"file_extension": ".py",
"mimetype": "text/x-python",
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython2",
"version": "2.7.10"
"pygments_lexer": "ipython3",
"version": "3.5.0"
}
},
"nbformat": 4,