Fix typos (#59)

* Fixed typo in the word 'independant'

* Fixed typo in the word 'subsequnce'

* Fixed typo in the word 'icecream'

* Fixed typo in the word 'subsequnce' in shortestCommonSubsequence

* Fixed typo in the word 'depected'

* Fixed typo in the word 'paramaters'

src/algorithms/sets/combinations/README.md

@@ -30,7 +30,7 @@ It is often called "n choose r" (such as "16 choose 3"). And is also known as th
 
 Repetition is Allowed: such as coins in your pocket `(5,5,5,10,10)`
 
-Or let us say there are five flavours of icecream: 
+Or let us say there are five flavours of ice cream: 
 `banana`, `chocolate`, `lemon`, `strawberry` and `vanilla`.
 
 We can have three scoops. How many variations will there be?

src/algorithms/sets/longest-common-subsequence/__test__/longestCommonSubsequence.test.js

@@ -1,29 +1,29 @@
-import longestCommonSubsequnce from '../longestCommonSubsequnce';
+import longestCommonSubsequence from '../longestCommonSubsequence';
 
-describe('longestCommonSubsequnce', () => {
+describe('longestCommonSubsequence', () => {
   it('should find longest common subsequence for two strings', () => {
-    expect(longestCommonSubsequnce([''], [''])).toEqual(['']);
+    expect(longestCommonSubsequence([''], [''])).toEqual(['']);
 
-    expect(longestCommonSubsequnce([''], ['A', 'B', 'C'])).toEqual(['']);
+    expect(longestCommonSubsequence([''], ['A', 'B', 'C'])).toEqual(['']);
 
-    expect(longestCommonSubsequnce(['A', 'B', 'C'], [''])).toEqual(['']);
+    expect(longestCommonSubsequence(['A', 'B', 'C'], [''])).toEqual(['']);
 
-    expect(longestCommonSubsequnce(
+    expect(longestCommonSubsequence(
       ['A', 'B', 'C'],
       ['D', 'E', 'F', 'G'],
     )).toEqual(['']);
 
-    expect(longestCommonSubsequnce(
+    expect(longestCommonSubsequence(
       ['A', 'B', 'C', 'D', 'G', 'H'],
       ['A', 'E', 'D', 'F', 'H', 'R'],
     )).toEqual(['A', 'D', 'H']);
 
-    expect(longestCommonSubsequnce(
+    expect(longestCommonSubsequence(
       ['A', 'G', 'G', 'T', 'A', 'B'],
       ['G', 'X', 'T', 'X', 'A', 'Y', 'B'],
     )).toEqual(['G', 'T', 'A', 'B']);
 
-    expect(longestCommonSubsequnce(
+    expect(longestCommonSubsequence(
       ['A', 'B', 'C', 'D', 'A', 'F'],
       ['A', 'C', 'B', 'C', 'F'],
     )).toEqual(['A', 'B', 'C', 'F']);

src/algorithms/sets/longest-common-subsequence/longestCommonSubsequence.js

@@ -3,7 +3,7 @@
  * @param {string[]} set2
  * @return {string[]}
  */
-export default function longestCommonSubsequnce(set1, set2) {
+export default function longestCommonSubsequence(set1, set2) {
   // Init LCS matrix.
   const lcsMatrix = Array(set2.length + 1).fill(null).map(() => Array(set1.length + 1).fill(null));
 

src/algorithms/sets/shortest-common-supersequence/shortestCommonSupersequence.js

@@ -1,4 +1,4 @@
-import longestCommonSubsequnce from '../longest-common-subsequnce/longestCommonSubsequnce';
+import longestCommonSubsequence from '../longest-common-subsequence/longestCommonSubsequence';
 
 /**
  * @param {string[]} set1
@@ -8,9 +8,9 @@ import longestCommonSubsequnce from '../longest-common-subsequnce/longestCommonS
 
 export default function shortestCommonSupersequence(set1, set2) {
   // Let's first find the longest common subsequence of two sets.
-  const lcs = longestCommonSubsequnce(set1, set2);
+  const lcs = longestCommonSubsequence(set1, set2);
 
-  // If LCS is empty then the shortest common supersequnce would be just
+  // If LCS is empty then the shortest common supersequence would be just
   // concatenation of two sequences.
   if (lcs.length === 1 && lcs[0] === '') {
     return set1.concat(set2);