From dd14976a3e13053b554e164c582084ddf8e0e833 Mon Sep 17 00:00:00 2001 From: Joe Robinson Date: Mon, 26 Jan 2015 22:32:55 +0000 Subject: Initial commit --- specification.txt | 38 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) create mode 100644 specification.txt (limited to 'specification.txt') diff --git a/specification.txt b/specification.txt new file mode 100644 index 0000000..7734850 --- /dev/null +++ b/specification.txt @@ -0,0 +1,38 @@ +Code Test + +A customer wishes to create a word count program. However unlike a +traditional word count they + +wish to ignore words which are partial matches of longer words For +example using the following + +text: + +A mate material may maybe right maybe + +A is discarded as it is contained in mate, material, may and maybe. + +A mate material may maybe right maybe + +Mate is discarded as it is contained in material. + +A mate material may maybe right maybe + +May is discarded as it is contained in maybe + +A mate material may maybe right maybe + +Write a Java program which takes an input file and outputs the word +count, for example based on + +the previous example text the output would be: + +Material: 1 + +Maybe: 2 + +Right: 1 + +The output should be sorted by longest word in descending order. + +Ensure that your code is written to commercial standards. -- cgit v1.2.3