Skip to content

bparmar95/pair-programming-word-search

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Pair Programming: Word Search

This challenge comes with some initial (buggy!) code. We suggest approaching this problem with a TDD mindset, meaning "write tests, make the tests pass, repeat!".

Start by forking this repository, and cloning your fork. Then, run npm install in the directory to install all the dependencies. This project has Mocha for running tests, and you'll find that there are already some tests present.

Run tests with npm test. You'll find that one of the tests doesn't pass yet, so you'll want to start by editing the code in wordsearch.js to allow the tests to pass.

When the present tests are successful, ask yourself, "Do the current tests cover all the possible cases?" What about the case where the word matrix is an empty array? What if the word is written vertically, not horizontally? You'll have to write tests for these cases (and any others that you think of), and you might also have modify the wordSearch function to make those new tests pass.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • JavaScript 100.0%