test: add small palindrome case

Author: JCPedroza

src/interview-classics/is-palindrome/README.md

@@ -17,7 +17,7 @@ consider the followihg whitespace characters for this exercise
  * `tab`
  * `new line`
 
-## Function Signagure
+## Function Signature
 
 ```typescript
 function isPalindrome(str: string): boolean
@@ -46,3 +46,8 @@ Out: true
 ```
 
 ## Optimizations
+
+Instead of creating a reversed and normalized string, you can use a loop to
+compare the first character to the last character, then the second character to
+the next-to-last character, and so on. This lowers the space complexity from
+linear to constant.

src/interview-classics/is-palindrome/is-pal-while-regex.js

@@ -41,5 +41,5 @@ const isPalindrome = (str) => {
 
 module.exports = {
   fun: isPalindrome,
-  id: 'while-loop regex'
+  id: 'while-loop inclusive-regex'
 }

src/interview-classics/is-palindrome/is-pal.test.js

@@ -5,11 +5,11 @@ const { readFileSync } = require('fs')
 
 const solutions = require('./is-pal.repo')
 
-const bigPalPath = join(__dirname, '/big-palindrome.txt')
-const bigPalindrome = readFileSync(bigPalPath, 'utf-8')
+const smallPalPath = join(__dirname, '/palindrome-small.txt')
+const bigPalPath = join(__dirname, '/palindrome-big.txt')
 
-const smallPalindrome = `Anita! LAva :
-    la?; tina.`
+const smallPalindrome = readFileSync(smallPalPath, 'utf-8')
+const bigPalindrome = readFileSync(bigPalPath, 'utf-8')
 
 solutions.forEach(({ fun, id }) => {
   describe(`Palindrome test algorithm "${id}"`, () => {

src/interview-classics/is-palindrome/is-pal.time.js

@@ -4,10 +4,22 @@ const { readFileSync } = require('fs')
 const { timeAndReport } = require('../../../lib/time')
 const solutions = require('./is-pal.repo')
 
-const bigPalPath = join(__dirname, '/big-palindrome.txt')
+const smallPalPath = join(__dirname, 'palindrome-small.txt')
+const bigPalPath = join(__dirname, '/palindrome-big.txt')
+
+const emptyPalindrome = ''
+const smallPalindrome = readFileSync(smallPalPath, 'utf-8')
 const bigPalindrome = readFileSync(bigPalPath, 'utf-8')
 
-const args = [bigPalindrome]
-const runs = 10_000
+const emptyArgs = [emptyPalindrome]
+const emptyRuns = 1_000_000
+
+const smallArgs = [smallPalindrome]
+const smallRuns = 100_000
+
+const bigArgs = [bigPalindrome]
+const bigRuns = 10_000
 
-timeAndReport(solutions, args, runs, 'Is palindrome?')
+timeAndReport(solutions, emptyArgs, emptyRuns, 'is-palindrome (empty)')
+timeAndReport(solutions, smallArgs, smallRuns, 'is-palindrome (small)')
+timeAndReport(solutions, bigArgs, bigRuns, 'is-palindrome (big)')

src/interview-classics/is-palindrome/big-palindrome.txt renamed to src/interview-classics/is-palindrome/palindrome-big.txt

@@ -0,0 +1,7 @@
+Doc, note:
+
+I dissent!
+
+A fast never prevents a fatness;
+
+I diet on cod?