docs: fix typos (TheAlgorithms#1283)

* docs: fix typos * fix

Author: Lioness100

Cache/Memoize.js

@@ -30,7 +30,7 @@ const memoize = (func, cache = new Map()) => {
  /**
  * Arguments converted to JSON string for use as a key of Map - it's easy to detect collections like -> Object and Array
  * If the args input is -> [new Set([1, 2, 3, 4]), {name: 'myName', age: 23}]
- * Then the agrsKey generate to -> '[[1,2,3,4],{"name":"myName","age":23}]' which is JSON mean string
+ * Then the argsKey generate to -> '[[1,2,3,4],{"name":"myName","age":23}]' which is JSON mean string
  * Now it's ready to be a perfect key for Map
  */
  const argsKey = JSON.stringify(args, jsonReplacer)

Ciphers/test/AffineCipher.test.js

@@ -19,7 +19,7 @@ describe('Test Affine Cipher', () => {
  expect(() => encrypt('null', 4, 1)).toThrow()
  })
 
- it('Test - 3 Pass string value to encrypt and ecrypt function', () => {
+ it('Test - 3 Pass string value to encrypt and decrypt function', () => {
  expect(decrypt(encrypt('HELLO WORLD', 5, 8), 5, 8)).toBe('HELLO WORLD')
  expect(decrypt(encrypt('ABC DEF', 3, 5), 3, 5)).toBe('ABC DEF')
  expect(decrypt(encrypt('Brown fox jump over the fence', 7, 3), 7, 3)).toBe(

Ciphers/test/KeywordShiftedAlphabet.test.js

@@ -1,12 +1,12 @@
 import { encrypt, decrypt } from '../KeywordShiftedAlphabet'
 
-test('Hello world! === dcrypt(encrypt(Hello world!))', () => {
+test('Hello world! === decrypt(encrypt(Hello world!))', () => {
  const word = 'Hello world!'
  const result = decrypt('keyword', encrypt('keyword', word))
  expect(result).toMatch(word)
 })
 
-test('The Algorithms === dcrypt(encrypt(The Algorithms))', () => {
+test('The Algorithms === decrypt(encrypt(The Algorithms))', () => {
  const word = 'The Algorithms'
  const result = decrypt('keyword', encrypt('keyword', word))
  expect(result).toMatch(word)

Ciphers/test/VigenereCipher.test.js

@@ -1,12 +1,12 @@
 import { encrypt, decrypt } from '../VigenereCipher'
 
-test('Hello world! === dcrypt(encrypt(Hello world!))', () => {
+test('Hello world! === decrypt(encrypt(Hello world!))', () => {
  const word = 'Hello world!'
  const result = decrypt(encrypt(word, 'code'), 'code')
  expect(result).toMatch(word)
 })
 
-test('The Algorithms === dcrypt(encrypt(The Algorithms))', () => {
+test('The Algorithms === decrypt(encrypt(The Algorithms))', () => {
  const word = 'The Algorithms'
  const result = decrypt(encrypt(word, 'code'), 'code')
  expect(result).toMatch(word)

Conversions/BinaryToHex.js

@@ -29,7 +29,7 @@ const hexLookup = (bin) => {
 }
 const binaryToHex = (binaryString) => {
  /*
- Function for convertung Binary to Hex
+ Function for converting Binary to Hex
 
  1. The conversion will start from Least Significant Digit (LSB) to the Most Significant Bit (MSB).
  2. We divide the bits into sections of 4-bits starting from LSB to MSB.

Conversions/RailwayTimeConversion.js

@@ -21,9 +21,9 @@ const RailwayTimeConversion = (timeString) => {
  return new TypeError('Argument is not a string.')
  }
  // split the string by ':' character.
- const [hour, minute, scondWithShift] = timeString.split(':')
+ const [hour, minute, secondWithShift] = timeString.split(':')
  // split second and shift value.
- const [second, shift] = [scondWithShift.substr(0, 2), scondWithShift.substr(2)]
+ const [second, shift] = [secondWithShift.substr(0, 2), secondWithShift.substr(2)]
  // convert shifted time to not-shift time(Railway time) by using the above explanation.
  if (shift === 'PM') {
  if (parseInt(hour) === 12) { return `${hour}:${minute}:${second}` } else { return `${parseInt(hour) + 12}:${minute}:${second}` }

Conversions/test/TemperatureConversion.test.js

@@ -80,19 +80,19 @@ describe('Testing Conversion of Rankine to Kelvin', () => {
  expect(test1).toBe(6)
  })
 })
-describe('Testing Conversion of Reamur to Celsius', () => {
- it('with Reamur value', () => {
+describe('Testing Conversion of Reaumur to Celsius', () => {
+ it('with Reaumur value', () => {
  const test1 = tc.reaumurToCelsius(100)
  expect(test1).toBe(125)
  })
 })
-describe('Testing Conversion of Reamur to Fahrenheit', () => {
- it('with Reamur value', () => {
+describe('Testing Conversion of Reaumur to Fahrenheit', () => {
+ it('with Reaumur value', () => {
  const test1 = tc.reaumurToFahrenheit(100)
  expect(test1).toBe(257)
  })
 })
-describe('Testing Conversion of Reamur to Kelvin', () => {
+describe('Testing Conversion of Reaumur to Kelvin', () => {
  it('with Reamur value', () => {
  const test1 = tc.reaumurToKelvin(100)
  expect(test1).toBe(398)

Data-Structures/Array/LocalMaximomPoint.js

@@ -3,7 +3,7 @@
  *
  * Notes:
  * - works by using divide and conquer
- * - the function gets the array A with n Real numbersand returns the local max point index (if more than one exists return the first one)
+ * - the function gets the array A with n Real numbers and returns the local max point index (if more than one exists return the first one)
  *
  * @complexity: O(log(n)) (on average )
  * @complexity: O(log(n)) (worst case)

Data-Structures/Tree/Trie.js

@@ -83,8 +83,8 @@ Trie.prototype.remove = function (word, count) {
  if (child.count >= count) child.count -= count
  else child.count = 0
 
- // If some occurrences are left we dont delete it or else
- // if the object forms some other objects prefix we dont delete it
+ // If some occurrences are left we don't delete it or else
+ // if the object forms some other objects prefix we don't delete it
  // For checking an empty object
  // https://stackoverflow.com/questions/679915/how-do-i-test-for-an-empty-javascript-object
  if (child.count <= 0 && (Object.keys(child.children).length && child.children.constructor === Object)) {
@@ -110,7 +110,7 @@ Trie.prototype.contains = function (word) {
  return true
 }
 
-Trie.prototype.findOccurences = function (word) {
+Trie.prototype.findOccurrences = function (word) {
  // find the node with given prefix
  const node = this.findPrefix(word)
  // No such word exists

Dynamic-Programming/KadaneAlgo.js

@@ -1,6 +1,6 @@
 /* Kadane's algorithm is one of the most efficient ways to
  * calculate the maximum contiguous subarray sum for a given array.
- * Below is the implementation of kadanes's algorithm along with
+ * Below is the implementation of Kadane's algorithm along with
  * some sample test cases.
  * There might be a special case in this problem if al the elements
  * of the given array are negative. In such a case, the maximum negative
@@ -10,14 +10,14 @@
  */
 
 export function kadaneAlgo (array) {
- let cummulativeSum = 0
+ let cumulativeSum = 0
  let maxSum = Number.NEGATIVE_INFINITY // maxSum has the least possible value
  for (let i = 0; i < array.length; i++) {
- cummulativeSum = cummulativeSum + array[i]
- if (maxSum < cummulativeSum) {
- maxSum = cummulativeSum
- } else if (cummulativeSum < 0) {
- cummulativeSum = 0
+ cumulativeSum = cumulativeSum + array[i]
+ if (maxSum < cumulativeSum) {
+ maxSum = cumulativeSum
+ } else if (cumulativeSum < 0) {
+ cumulativeSum = 0
  }
  }
  return maxSum