Moving problems into sub-folders by source.

womcauliff · Apr 15, 2019 · d401653 · d401653
1 parent 9b3e14c
commit d401653
Show file tree

Hide file tree

Showing 95 changed files with 70 additions and 70 deletions.
diff --git a/Assign-Numbers-In-Minesweeper/README.md → ...s/Assign-Numbers-In-Minesweeper/README.md b/Assign-Numbers-In-Minesweeper/README.md → ...s/Assign-Numbers-In-Minesweeper/README.md
diff --git a/...n-Numbers-In-Minesweeper/checkSolution.py → ...n-Numbers-In-Minesweeper/checkSolution.py b/...n-Numbers-In-Minesweeper/checkSolution.py → ...n-Numbers-In-Minesweeper/checkSolution.py
diff --git a/...bers-In-Minesweeper/checkSolution.test.js → ...bers-In-Minesweeper/checkSolution.test.js b/...bers-In-Minesweeper/checkSolution.test.js → ...bers-In-Minesweeper/checkSolution.test.js
diff --git a/Assign-Numbers-In-Minesweeper/solution.js → ...Assign-Numbers-In-Minesweeper/solution.js b/Assign-Numbers-In-Minesweeper/solution.js → ...Assign-Numbers-In-Minesweeper/solution.js
diff --git a/Assign-Numbers-In-Minesweeper/solution.py → ...Assign-Numbers-In-Minesweeper/solution.py b/Assign-Numbers-In-Minesweeper/solution.py → ...Assign-Numbers-In-Minesweeper/solution.py
diff --git a/...n-Elements-In-Two-Sorted-Arrays/README.md → ...n-Elements-In-Two-Sorted-Arrays/README.md b/...n-Elements-In-Two-Sorted-Arrays/README.md → ...n-Elements-In-Two-Sorted-Arrays/README.md
diff --git a/...n-Two-Sorted-Arrays/checkSolution.test.js → ...n-Two-Sorted-Arrays/checkSolution.test.js b/...n-Two-Sorted-Arrays/checkSolution.test.js → ...n-Two-Sorted-Arrays/checkSolution.test.js
diff --git a/...ements-In-Two-Sorted-Arrays/solution.java → ...ements-In-Two-Sorted-Arrays/solution.java b/...ements-In-Two-Sorted-Arrays/solution.java → ...ements-In-Two-Sorted-Arrays/solution.java
diff --git a/...Elements-In-Two-Sorted-Arrays/solution.js → ...Elements-In-Two-Sorted-Arrays/solution.js b/...Elements-In-Two-Sorted-Arrays/solution.js → ...Elements-In-Two-Sorted-Arrays/solution.js
diff --git a/...Elements-In-Two-Sorted-Arrays/solution.py → ...Elements-In-Two-Sorted-Arrays/solution.py b/...Elements-In-Two-Sorted-Arrays/solution.py → ...Elements-In-Two-Sorted-Arrays/solution.py
diff --git a/...-Most-Frequent-Element-In-Array/README.md → ...-Most-Frequent-Element-In-Array/README.md b/...-Most-Frequent-Element-In-Array/README.md → ...-Most-Frequent-Element-In-Array/README.md
diff --git a/...nt-Element-In-Array/checkSolution.test.js → ...nt-Element-In-Array/checkSolution.test.js b/...nt-Element-In-Array/checkSolution.test.js → ...nt-Element-In-Array/checkSolution.test.js
diff --git a/...t-Frequent-Element-In-Array/solution.java → ...t-Frequent-Element-In-Array/solution.java b/...t-Frequent-Element-In-Array/solution.java → ...t-Frequent-Element-In-Array/solution.java
diff --git a/...ost-Frequent-Element-In-Array/solution.js → ...ost-Frequent-Element-In-Array/solution.js b/...ost-Frequent-Element-In-Array/solution.js → ...ost-Frequent-Element-In-Array/solution.js
diff --git a/...ost-Frequent-Element-In-Array/solution.py → ...ost-Frequent-Element-In-Array/solution.py b/...ost-Frequent-Element-In-Array/solution.py → ...ost-Frequent-Element-In-Array/solution.py
diff --git a/...-Where-To-Expand-In-Minesweeper/README.md → ...-Where-To-Expand-In-Minesweeper/README.md b/...-Where-To-Expand-In-Minesweeper/README.md → ...-Where-To-Expand-In-Minesweeper/README.md
diff --git a/...-Expand-In-Minesweeper/minefield1.test.js → ...-Expand-In-Minesweeper/minefield1.test.js b/...-Expand-In-Minesweeper/minefield1.test.js → ...-Expand-In-Minesweeper/minefield1.test.js
diff --git a/...-Expand-In-Minesweeper/minefield2.test.js → ...-Expand-In-Minesweeper/minefield2.test.js b/...-Expand-In-Minesweeper/minefield2.test.js → ...-Expand-In-Minesweeper/minefield2.test.js
diff --git a/...here-To-Expand-In-Minesweeper/solution.js → ...here-To-Expand-In-Minesweeper/solution.js b/...here-To-Expand-In-Minesweeper/solution.js → ...here-To-Expand-In-Minesweeper/solution.js
diff --git a/Is-One-Array-a-Rotation-of-Another/README.md → ...One-Array-a-Rotation-of-Another/README.md b/Is-One-Array-a-Rotation-of-Another/README.md → ...One-Array-a-Rotation-of-Another/README.md
diff --git a/...Rotation-of-Another/checkSolution.test.js → ...Rotation-of-Another/checkSolution.test.js b/...Rotation-of-Another/checkSolution.test.js → ...Rotation-of-Another/checkSolution.test.js
diff --git a/...e-Array-a-Rotation-of-Another/solution.js → ...e-Array-a-Rotation-of-Another/solution.js b/...e-Array-a-Rotation-of-Another/solution.js → ...e-Array-a-Rotation-of-Another/solution.js
diff --git a/...e-Array-a-Rotation-of-Another/solution.py → ...e-Array-a-Rotation-of-Another/solution.py b/...e-Array-a-Rotation-of-Another/solution.py → ...e-Array-a-Rotation-of-Another/solution.py
diff --git a/Is-This-a-Binary-Search-Tree/README.md → ...ns/Is-This-a-Binary-Search-Tree/README.md b/Is-This-a-Binary-Search-Tree/README.md → ...ns/Is-This-a-Binary-Search-Tree/README.md
diff --git a/Is-This-a-Binary-Search-Tree/TreeNode.js → .../Is-This-a-Binary-Search-Tree/TreeNode.js b/Is-This-a-Binary-Search-Tree/TreeNode.js → .../Is-This-a-Binary-Search-Tree/TreeNode.js
diff --git a/...-Binary-Search-Tree/checkSolution.test.js → ...-Binary-Search-Tree/checkSolution.test.js b/...-Binary-Search-Tree/checkSolution.test.js → ...-Binary-Search-Tree/checkSolution.test.js
diff --git a/Is-This-a-Binary-Search-Tree/createTree.js → ...s-This-a-Binary-Search-Tree/createTree.js b/Is-This-a-Binary-Search-Tree/createTree.js → ...s-This-a-Binary-Search-Tree/createTree.js
diff --git a/Is-This-a-Binary-Search-Tree/solution.js → .../Is-This-a-Binary-Search-Tree/solution.js b/Is-This-a-Binary-Search-Tree/solution.js → .../Is-This-a-Binary-Search-Tree/solution.js
diff --git a/Lowest-Common-Ancestor/README.md → ...uestions/Lowest-Common-Ancestor/README.md b/Lowest-Common-Ancestor/README.md → ...uestions/Lowest-Common-Ancestor/README.md
diff --git a/Lowest-Common-Ancestor/TreeNode.js → ...stions/Lowest-Common-Ancestor/TreeNode.js b/Lowest-Common-Ancestor/TreeNode.js → ...stions/Lowest-Common-Ancestor/TreeNode.js
diff --git a/Lowest-Common-Ancestor/checkSolution.test.js → ...est-Common-Ancestor/checkSolution.test.js b/Lowest-Common-Ancestor/checkSolution.test.js → ...est-Common-Ancestor/checkSolution.test.js
diff --git a/Lowest-Common-Ancestor/createTree.js → ...ions/Lowest-Common-Ancestor/createTree.js b/Lowest-Common-Ancestor/createTree.js → ...ions/Lowest-Common-Ancestor/createTree.js
diff --git a/Lowest-Common-Ancestor/solution.js → ...stions/Lowest-Common-Ancestor/solution.js b/Lowest-Common-Ancestor/solution.js → ...stions/Lowest-Common-Ancestor/solution.js
diff --git a/N-th-Element-of-a-Linked-List/Node.js → ...ons/N-th-Element-of-a-Linked-List/Node.js b/N-th-Element-of-a-Linked-List/Node.js → ...ons/N-th-Element-of-a-Linked-List/Node.js
diff --git a/N-th-Element-of-a-Linked-List/README.md → ...s/N-th-Element-of-a-Linked-List/README.md b/N-th-Element-of-a-Linked-List/README.md → ...s/N-th-Element-of-a-Linked-List/README.md
diff --git a/...nt-of-a-Linked-List/checkSolution.test.js → ...nt-of-a-Linked-List/checkSolution.test.js b/...nt-of-a-Linked-List/checkSolution.test.js → ...nt-of-a-Linked-List/checkSolution.test.js
diff --git a/N-th-Element-of-a-Linked-List/solution.js → ...N-th-Element-of-a-Linked-List/solution.js b/N-th-Element-of-a-Linked-List/solution.js → ...N-th-Element-of-a-Linked-List/solution.js
diff --git a/Non-Repeating-Character/README.md → ...estions/Non-Repeating-Character/README.md b/Non-Repeating-Character/README.md → ...estions/Non-Repeating-Character/README.md
diff --git a/...Repeating-Character/checkSolution.test.js → ...Repeating-Character/checkSolution.test.js b/...Repeating-Character/checkSolution.test.js → ...Repeating-Character/checkSolution.test.js
diff --git a/Non-Repeating-Character/solution.js → ...tions/Non-Repeating-Character/solution.js b/Non-Repeating-Character/solution.js → ...tions/Non-Repeating-Character/solution.js
diff --git a/Non-Repeating-Character/solution.py → ...tions/Non-Repeating-Character/solution.py b/Non-Repeating-Character/solution.py → ...tions/Non-Repeating-Character/solution.py
diff --git a/One-Away-Strings/README.md → ...view-Questions/One-Away-Strings/README.md b/One-Away-Strings/README.md → ...view-Questions/One-Away-Strings/README.md
diff --git a/One-Away-Strings/isOneAway.test.js → ...stions/One-Away-Strings/isOneAway.test.js b/One-Away-Strings/isOneAway.test.js → ...stions/One-Away-Strings/isOneAway.test.js
diff --git a/One-Away-Strings/solution.js → ...ew-Questions/One-Away-Strings/solution.js b/One-Away-Strings/solution.js → ...ew-Questions/One-Away-Strings/solution.js
diff --git a/One-Away-Strings/solution.py → ...ew-Questions/One-Away-Strings/solution.py b/One-Away-Strings/solution.py → ...ew-Questions/One-Away-Strings/solution.py
diff --git a/11-Essential-Coding-Interview-Questions/README.md b/11-Essential-Coding-Interview-Questions/README.md
@@ -0,0 +1,33 @@
+# 11 Essential Coding Interview Questions
+
+The following problems are introduced in the Udemy course by CS Dojo, ["11 Essential Coding Interview Questions."](https://www.udemy.com/11-essential-coding-interview-questions/)
+
+## Arrays
+
+1. [Find the most frequent element in an array](./Find-Most-Frequent-Element-In-Array/README.md)
+
+2. [Find the common elements in two sorted arrays](./Common-Elements-In-Two-Sorted-Arrays/README.md)
+
+3. [Is one array a rotation of another?](./Is-One-Array-a-Rotation-of-Another/README.md)
+
+## Strings
+
+4. [Non-Repeating Character](./Non-Repeating-Character/README.md)
+
+5. [One Away Strings](./One-Away-Strings/README.md)
+
+## Two-Dimensional Arrays
+
+6. [Assign Numbers in Minesweeper](./Assign-Numbers-In-Minesweeper/README.md)
+
+7. [Find Where to Expand in Minesweeper](./Find-Where-to-Expand-in-Minesweeper/README.md)
+
+8. [Rotating a 2D Array by 90 Degrees (In Place)](./Rotating-2D-Array-In-Place/README.md)
+
+## Linked Lists and Trees
+
+9. [N-th Element of a Linked List](./N-th-Element-of-a-Linked-List/README.md)
+
+10. [Is This a Binary Search Tree?](./Is-This-a-Binary-Search-Tree/README.md)
+
+11. [Lowest Common Ancestor](./Lowest-Common-Ancestor/README.md)
diff --git a/Rotating-2D-Array-In-Place/README.md → ...ions/Rotating-2D-Array-In-Place/README.md b/Rotating-2D-Array-In-Place/README.md → ...ions/Rotating-2D-Array-In-Place/README.md
diff --git a/...g-2D-Array-In-Place/checkSolution.test.js → ...g-2D-Array-In-Place/checkSolution.test.js b/...g-2D-Array-In-Place/checkSolution.test.js → ...g-2D-Array-In-Place/checkSolution.test.js
diff --git a/Rotating-2D-Array-In-Place/solution.js → ...ns/Rotating-2D-Array-In-Place/solution.js b/Rotating-2D-Array-In-Place/solution.js → ...ns/Rotating-2D-Array-In-Place/solution.js
diff --git a/1-Apple-Stocks/README.md → Interview-Cake/1-Apple-Stocks/README.md b/1-Apple-Stocks/README.md → Interview-Cake/1-Apple-Stocks/README.md
diff --git a/1-Apple-Stocks/findMaxProfit.js → ...view-Cake/1-Apple-Stocks/findMaxProfit.js b/1-Apple-Stocks/findMaxProfit.js → ...view-Cake/1-Apple-Stocks/findMaxProfit.js
diff --git a/1-Apple-Stocks/findMaxProfit.test.js → ...Cake/1-Apple-Stocks/findMaxProfit.test.js b/1-Apple-Stocks/findMaxProfit.test.js → ...Cake/1-Apple-Stocks/findMaxProfit.test.js
diff --git a/14-Inflight-Entertainment/README.md → ...-Cake/14-Inflight-Entertainment/README.md b/14-Inflight-Entertainment/README.md → ...-Cake/14-Inflight-Entertainment/README.md
diff --git a/...light-Entertainment/checkSolution.test.js → ...light-Entertainment/checkSolution.test.js b/...light-Entertainment/checkSolution.test.js → ...light-Entertainment/checkSolution.test.js
diff --git a/14-Inflight-Entertainment/solution.js → ...ake/14-Inflight-Entertainment/solution.js b/14-Inflight-Entertainment/solution.js → ...ake/14-Inflight-Entertainment/solution.js
diff --git a/16-The-Cake-Thief/README.md → Interview-Cake/16-The-Cake-Thief/README.md b/16-The-Cake-Thief/README.md → Interview-Cake/16-The-Cake-Thief/README.md
diff --git a/16-The-Cake-Thief/solution.js → Interview-Cake/16-The-Cake-Thief/solution.js b/16-The-Cake-Thief/solution.js → Interview-Cake/16-The-Cake-Thief/solution.js
diff --git a/26-Reverse-String-in-Place/README.md → ...Cake/26-Reverse-String-in-Place/README.md b/26-Reverse-String-in-Place/README.md → ...Cake/26-Reverse-String-in-Place/README.md
diff --git a/...rse-String-in-Place/checkSolution.test.js → ...rse-String-in-Place/checkSolution.test.js b/...rse-String-in-Place/checkSolution.test.js → ...rse-String-in-Place/checkSolution.test.js
diff --git a/26-Reverse-String-in-Place/solution.js → ...ke/26-Reverse-String-in-Place/solution.js b/26-Reverse-String-in-Place/solution.js → ...ke/26-Reverse-String-in-Place/solution.js
diff --git a/27-Reverse-Words/README.md → Interview-Cake/27-Reverse-Words/README.md b/27-Reverse-Words/README.md → Interview-Cake/27-Reverse-Words/README.md
diff --git a/27-Reverse-Words/checkSolution.test.js → ...ke/27-Reverse-Words/checkSolution.test.js b/27-Reverse-Words/checkSolution.test.js → ...ke/27-Reverse-Words/checkSolution.test.js
diff --git a/27-Reverse-Words/solution.js → Interview-Cake/27-Reverse-Words/solution.js b/27-Reverse-Words/solution.js → Interview-Cake/27-Reverse-Words/solution.js
diff --git a/3-Highest-Product-of-Three/README.md → ...Cake/3-Highest-Product-of-Three/README.md b/3-Highest-Product-of-Three/README.md → ...Cake/3-Highest-Product-of-Three/README.md
diff --git a/...est-Product-of-Three/highestProductOf3.js → ...est-Product-of-Three/highestProductOf3.js b/...est-Product-of-Three/highestProductOf3.js → ...est-Product-of-Three/highestProductOf3.js
diff --git a/...roduct-of-Three/highestProductOf3.test.js → ...roduct-of-Three/highestProductOf3.test.js b/...roduct-of-Three/highestProductOf3.test.js → ...roduct-of-Three/highestProductOf3.test.js
diff --git a/30-Permutation-Palindrome/README.md → ...-Cake/30-Permutation-Palindrome/README.md b/30-Permutation-Palindrome/README.md → ...-Cake/30-Permutation-Palindrome/README.md
diff --git a/...mutation-Palindrome/checkSolution.test.js → ...mutation-Palindrome/checkSolution.test.js b/...mutation-Palindrome/checkSolution.test.js → ...mutation-Palindrome/checkSolution.test.js
diff --git a/30-Permutation-Palindrome/solution.js → ...ake/30-Permutation-Palindrome/solution.js b/30-Permutation-Palindrome/solution.js → ...ake/30-Permutation-Palindrome/solution.js
diff --git a/32-Top-Scores/README.md → Interview-Cake/32-Top-Scores/README.md b/32-Top-Scores/README.md → Interview-Cake/32-Top-Scores/README.md
diff --git a/32-Top-Scores/sortScores.js → Interview-Cake/32-Top-Scores/sortScores.js b/32-Top-Scores/sortScores.js → Interview-Cake/32-Top-Scores/sortScores.js
diff --git a/32-Top-Scores/sortScores.test.js → ...iew-Cake/32-Top-Scores/sortScores.test.js b/32-Top-Scores/sortScores.test.js → ...iew-Cake/32-Top-Scores/sortScores.test.js
diff --git a/34-Word-Cloud-Data/README.md → Interview-Cake/34-Word-Cloud-Data/README.md b/34-Word-Cloud-Data/README.md → Interview-Cake/34-Word-Cloud-Data/README.md
diff --git a/34-Word-Cloud-Data/WordCloudData.js → ...-Cake/34-Word-Cloud-Data/WordCloudData.js b/34-Word-Cloud-Data/WordCloudData.js → ...-Cake/34-Word-Cloud-Data/WordCloudData.js
diff --git a/34-Word-Cloud-Data/checkSolution.test.js → .../34-Word-Cloud-Data/checkSolution.test.js b/34-Word-Cloud-Data/checkSolution.test.js → .../34-Word-Cloud-Data/checkSolution.test.js
diff --git a/36-Single-Riffle-Shuffle/README.md → ...w-Cake/36-Single-Riffle-Shuffle/README.md b/36-Single-Riffle-Shuffle/README.md → ...w-Cake/36-Single-Riffle-Shuffle/README.md
diff --git a/...ngle-Riffle-Shuffle/checkSolution.test.js → ...ngle-Riffle-Shuffle/checkSolution.test.js b/...ngle-Riffle-Shuffle/checkSolution.test.js → ...ngle-Riffle-Shuffle/checkSolution.test.js
diff --git a/36-Single-Riffle-Shuffle/solution.js → ...Cake/36-Single-Riffle-Shuffle/solution.js b/36-Single-Riffle-Shuffle/solution.js → ...Cake/36-Single-Riffle-Shuffle/solution.js
diff --git a/4-Merging-Meeting-Times/README.md → ...ew-Cake/4-Merging-Meeting-Times/README.md b/4-Merging-Meeting-Times/README.md → ...ew-Cake/4-Merging-Meeting-Times/README.md
diff --git a/...rging-Meeting-Times/checkSolution.test.js → ...rging-Meeting-Times/checkSolution.test.js b/...rging-Meeting-Times/checkSolution.test.js → ...rging-Meeting-Times/checkSolution.test.js
diff --git a/4-Merging-Meeting-Times/solution.js → ...-Cake/4-Merging-Meeting-Times/solution.js b/4-Merging-Meeting-Times/solution.js → ...-Cake/4-Merging-Meeting-Times/solution.js
diff --git a/42-Find-Duplicate-Files/README.md → ...ew-Cake/42-Find-Duplicate-Files/README.md b/42-Find-Duplicate-Files/README.md → ...ew-Cake/42-Find-Duplicate-Files/README.md
diff --git a/...ind-Duplicate-Files/findDuplicateFiles.js → ...ind-Duplicate-Files/findDuplicateFiles.js b/...ind-Duplicate-Files/findDuplicateFiles.js → ...ind-Duplicate-Files/findDuplicateFiles.js
diff --git a/...uplicate-Files/findDuplicateFiles.test.js → ...uplicate-Files/findDuplicateFiles.test.js b/...uplicate-Files/findDuplicateFiles.test.js → ...uplicate-Files/findDuplicateFiles.test.js
diff --git a/42-Find-Duplicate-Files/package-lock.json → ...42-Find-Duplicate-Files/package-lock.json b/42-Find-Duplicate-Files/package-lock.json → ...42-Find-Duplicate-Files/package-lock.json
diff --git a/42-Find-Duplicate-Files/package.json → ...Cake/42-Find-Duplicate-Files/package.json b/42-Find-Duplicate-Files/package.json → ...Cake/42-Find-Duplicate-Files/package.json
diff --git a/43-Merge-Sorted-Arrays/README.md → ...iew-Cake/43-Merge-Sorted-Arrays/README.md b/43-Merge-Sorted-Arrays/README.md → ...iew-Cake/43-Merge-Sorted-Arrays/README.md
diff --git a/43-Merge-Sorted-Arrays/checkSolution.test.js → ...Merge-Sorted-Arrays/checkSolution.test.js b/43-Merge-Sorted-Arrays/checkSolution.test.js → ...Merge-Sorted-Arrays/checkSolution.test.js
diff --git a/43-Merge-Sorted-Arrays/solution.js → ...w-Cake/43-Merge-Sorted-Arrays/solution.js b/43-Merge-Sorted-Arrays/solution.js → ...w-Cake/43-Merge-Sorted-Arrays/solution.js
diff --git a/8-Balanced-Binary-Tree/BinaryTreeNode.js → .../8-Balanced-Binary-Tree/BinaryTreeNode.js b/8-Balanced-Binary-Tree/BinaryTreeNode.js → .../8-Balanced-Binary-Tree/BinaryTreeNode.js
diff --git a/8-Balanced-Binary-Tree/README.md → ...iew-Cake/8-Balanced-Binary-Tree/README.md b/8-Balanced-Binary-Tree/README.md → ...iew-Cake/8-Balanced-Binary-Tree/README.md
diff --git a/8-Balanced-Binary-Tree/checkSolution.test.js → ...alanced-Binary-Tree/checkSolution.test.js b/8-Balanced-Binary-Tree/checkSolution.test.js → ...alanced-Binary-Tree/checkSolution.test.js
diff --git a/8-Balanced-Binary-Tree/solution.js → ...w-Cake/8-Balanced-Binary-Tree/solution.js b/8-Balanced-Binary-Tree/solution.js → ...w-Cake/8-Balanced-Binary-Tree/solution.js
diff --git a/Interview-Cake/README.md b/Interview-Cake/README.md
@@ -0,0 +1,33 @@
+# Interview Cake
+
+The following problems are introduced in the [Interview Cake full course](https://www.interviewcake.com/) by Cake Labs.
+
+- [1. Apple Stocks](./1-Apple-Stocks/README.md)
+
+- [3. Highest Product of Three](./3-Highest-Product-of-Three/README.md)
+
+- [4. Merging Meeting Times](./4-Merging-Meeting-Times/README.md)
+
+- [8. Balanced Binary Tree](./8-Balanced-Binary-Tree/README.md)
+
+- [14. Inflight Entertainment](./14-Inflight-Entertainment/README.md)
+
+- [16. The Cake Thief](./16-The-Cake-Thief/README.md)
+
+  A variation of the "Unbounded Knapsack Problem."
+
+- [26. Reverse String in Place](./26-Reverse-String-in-Place/README.md)
+
+- [27. Reverse Words](./27-Reverse-Words/README.md)
+
+- [30. Permutation Palindrome](./30-Permutation-Palindrome/README.md)
+
+- [32. Top Scores](./32-Top-Scores/README.md)
+
+- [34. Word Cloud Data](./34-Word-Cloud-Data/README.md)
+
+- [36. Single Riffle Shuffle](./36-Single-Riffle-Shuffle/README.md)
+
+- [42. Find Duplicate Files](./42-Find-Duplicate-Files/README.md)
+
+- [43. Merge Sorted Arrays](./43-Merge-Sorted-Arrays/README.md)
diff --git a/README.md b/README.md
@@ -2,74 +2,8 @@
 
 Practice problems that challenge me to think carefully about algorithms and data structures.
 
-## 11 Essential Coding Interview Questions
+## Practice Problems by Source
 
-The following problems are introduced in the Udemy course by CS Dojo, ["11 Essential Coding Interview Questions."](https://www.udemy.com/11-essential-coding-interview-questions/)
-
-### Arrays
-
-1. [Find the most frequent element in an array](./Find-Most-Frequent-Element-In-Array/README.md)
-
-2. [Find the common elements in two sorted arrays](./Common-Elements-In-Two-Sorted-Arrays/README.md)
-
-3. [Is one array a rotation of another?](./Is-One-Array-a-Rotation-of-Another/README.md)
-
-### Strings
-
-4. [Non-Repeating Character](./Non-Repeating-Character/README.md)
-
-5. [One Away Strings](./One-Away-Strings/README.md)
-
-### Two-Dimensional Arrays
-
-6. [Assign Numbers in Minesweeper](./Assign-Numbers-In-Minesweeper/README.md)
-
-7. [Find Where to Expand in Minesweeper](./Find-Where-to-Expand-in-Minesweeper/README.md)
-
-8. [Rotating a 2D Array by 90 Degrees (In Place)](./Rotating-2D-Array-In-Place/README.md)
-
-### Linked Lists and Trees
-
-9. [N-th Element of a Linked List](./N-th-Element-of-a-Linked-List/README.md)
-
-10. [Is This a Binary Search Tree?](./Is-This-a-Binary-Search-Tree/README.md)
-
-11. [Lowest Common Ancestor](./Lowest-Common-Ancestor/README.md)
-
-## Interview Cake
-
-The following problems are introduced in the [Interview Cake full course](https://www.interviewcake.com/) by Cake Labs.
-
-- [1. Apple Stocks](./1-Apple-Stocks/README.md)
-
-- [3. Highest Product of Three](./3-Highest-Product-of-Three/README.md)
-
-- [4. Merging Meeting Times](./4-Merging-Meeting-Times/README.md)
-
-- [8. Balanced Binary Tree](./8-Balanced-Binary-Tree/README.md)
-
-- [14. Inflight Entertainment](./14-Inflight-Entertainment/README.md)
-
-- [16. The Cake Thief](./16-The-Cake-Thief/README.md)
-
-  A variation of the "Unbounded Knapsack Problem."
-
-- [26. Reverse String in Place](./26-Reverse-String-in-Place/README.md)
-
-- [27. Reverse Words](./27-Reverse-Words/README.md)
-
-- [30. Permutation Palindrome](./30-Permutation-Palindrome/README.md)
-
-- [32. Top Scores](./32-Top-Scores/README.md)
-
-- [34. Word Cloud Data](./34-Word-Cloud-Data/README.md)
-
-- [36. Single Riffle Shuffle](./36-Single-Riffle-Shuffle/README.md)
-
-- [42. Find Duplicate Files](./42-Find-Duplicate-Files/README.md)
-
-- [43. Merge Sorted Arrays](./43-Merge-Sorted-Arrays/README.md)
-
-## Daily Coding Problem
-
-- [2. Product of All Others](./Daily-Coding-Problem/2-Product-of-All-Others/README.md)
+- [11 Essential Coding Interview Questions](./11-Essential-Coding-Interview-Questions/README.md)
+- [Interview Cake](./Interview-Cake/README.md)
+- [Daily Coding Problem](./Daily-Coding-Problem/README.md)