subh kumar

subh kumar wrote:

subh kumar wrote:

subh kumar wrote:

subh kumar wrote://soln by subh71@gmail.com
/////////////////////////////////////////////ANOTHER SOLUTION /////////////////////////////////////////////////////// public static Map<String, Integer> wordOccurrence(String sentence) { final Map<String, Integer> hshmap = new HashMap<String, Integer>(); Arrays.asList(sentence.toLowerCase().split(" ")).forEach(new Consumer<String>() { public void accept(String value) { hshmap.put(value, hshmap.containsKey(value)? hshmap.get(value) + 1: 1); } }); return hshmap; } ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////

subh kumar wrote:

subh kumar wrote:

subh kumar wrote:

subh kumar wrote://soln by subh71@gmail.com
/////////////////////////////////////////////FINAL SOLUTION /////////////////////////////////////////////////////// import java.util.Arrays; import java.util.HashMap; import java.util.Map; import java.util.function.Consumer; public static Map<String, Integer> wordOccurrence(String sentence) { final Map<String, Integer> hshmap = new HashMap<String, Integer>(); Arrays.asList(sentence.toLowerCase().split("\\s+")).forEach(new Consumer<String>() { public void accept(String value) { hshmap.put(value, hshmap.containsKey(value)? hshmap.get(value) + 1: 1); } }); return hshmap; }

subh kumar wrote:

subh kumar wrote:

subh kumar wrote://soln by subh71@gmail.com
/////////////////////////////////////////////FINAL SOLUTION /////////////////////////////////////////////////////// public static Map<String, Integer> wordOccurrence(String sentence) { final Map<String, Integer> hshmap = new HashMap<String, Integer>(); Arrays.asList(sentence.toLowerCase().split(" ")).forEach(new Consumer<String>() { public void accept(String value) { hshmap.put(value, hshmap.containsKey(value)? hshmap.get(value) + 1: 1); } }); return hshmap; } ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////

subh kumar wrote:

subh kumar wrote://soln by subh71@gmail.com
/////////////////////////////////////////////////////[color=darkred]solution 1[/color]/////////////////////////////////////////////////////////// public static Map<String, Integer> wordOccurrence(String sentence) { final Map<String, Integer> hshmap = new HashMap<String, Integer>(); Arrays.asList(sentence.toLowerCase().split(" ")).forEach(new Consumer<String>() { public void accept(String value) { hshmap.put(value, hshmap.containsKey(value)? hshmap.get(value) + 1: 1); } }); return hshmap; } ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// ///////////////////////////////////////////[color=darkblue]solution 2[/color] ////////////////////////////////////////////////////////////// import java.util.HashMap; import java.util.Map;[code=java] public class GeeConComp { public static Map<String, Integer> wordOccurrence(String sentence) { // Your solution goes here Map<String, Integer> MyWordOccurrence1 = new HashMap<>(); String parts[]=sentence.split(" "); // stores sentence word in string array(parts) int count=0; for(String s:parts) //picks one by one words from string array(parts) { count=0; for(int i=0;i<parts.length;i++) //moves from each word to next word of sentence { if(s.equalsIgnoreCase(parts[i]))//if match found { count++; } } MyWordOccurrence1.put(s.toLowerCase(), count); //puts string lower case in Map which puts unique name and no duplication } return MyWordOccurrence1; } public static void main(String[] args) { System.out.println("CodeRanch GeeCON Prague 2014 competition"); System.out.println("========================================"); String sentence1 = "I really REALLY love CodeRanch"; Map><String, Integer> expectedWordOccurrence1 = new HashMap<>(); expectedWordOccurrence1.put("i", 1); expectedWordOccurrence1.put("really", 2); expectedWordOccurrence1.put("love", 1); expectedWordOccurrence1.put("coderanch", 1); assertOccurrences(expectedWordOccurrence1, wordOccurrence(sentence1)); String sentence2 = "Good better best may I never rest until my good is better and my better best"; Map<String, Integer> expectedWordOccurrence2 = new HashMap<>(); expectedWordOccurrence2.put("good", 2); expectedWordOccurrence2.put("better", 3); expectedWordOccurrence2.put("best", 2); expectedWordOccurrence2.put("may", 1); expectedWordOccurrence2.put("i", 1); expectedWordOccurrence2.put("never", 1); expectedWordOccurrence2.put("rest", 1); expectedWordOccurrence2.put("until", 1); expectedWordOccurrence2.put("my", 2); expectedWordOccurrence2.put("is", 1); expectedWordOccurrence2.put("and", 1); assertOccurrences(expectedWordOccurrence2, wordOccurrence(sentence2)); } private static void assertOccurrences(Map<String, Integer> expected, Map<String, Integer> actual) { if (expected.equals(actual)) { System.out.println("Test PASS :)"); } else { System.out.println("Test FAIL :("); System.out.println("Expected: " + expected); System.out.println("Actual : " + actual); } } }

subh kumar wrote://soln by subh71@gmail.com
/////////////////////////////////////////////////////[color=darkred]solution 1[/color]/////////////////////////////////////////////////////////// public static Map<String, Integer> wordOccurrence(String sentence) { final Map<String, Integer> hshmap = new HashMap<String, Integer>(); Arrays.asList(sentence.toLowerCase().split(" ")).forEach(new Consumer<String>() { public void accept(String value) { hshmap.put(value, hshmap.containsKey(value)? hshmap.get(value) + 1: 1); } }); return hshmap; } ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// ///////////////////////////////////////////[color=darkblue]solution 2[/color] ////////////////////////////////////////////////////////////// import java.util.HashMap; import java.util.Map;[code=java] public class GeeConComp { public static Map<String, Integer> wordOccurrence(String sentence) { // Your solution goes here Map<String, Integer> MyWordOccurrence1 = new HashMap<>(); String parts[]=sentence.split(" "); // stores sentence word in string array(parts) int count=0; for(String s:parts) //picks one by one words from string array(parts) { count=0; for(int i=0;i<parts.length;i++) //moves from each word to next word of sentence { if(s.equalsIgnoreCase(parts[i]))//if match found { count++; } } MyWordOccurrence1.put(s.toLowerCase(), count); //puts string lower case in Map which puts unique name and no duplication } return MyWordOccurrence1; } public static void main(String[] args) { System.out.println("CodeRanch GeeCON Prague 2014 competition"); System.out.println("========================================"); String sentence1 = "I really REALLY love CodeRanch"; Map><String, Integer> expectedWordOccurrence1 = new HashMap<>(); expectedWordOccurrence1.put("i", 1); expectedWordOccurrence1.put("really", 2); expectedWordOccurrence1.put("love", 1); expectedWordOccurrence1.put("coderanch", 1); assertOccurrences(expectedWordOccurrence1, wordOccurrence(sentence1)); String sentence2 = "Good better best may I never rest until my good is better and my better best"; Map<String, Integer> expectedWordOccurrence2 = new HashMap<>(); expectedWordOccurrence2.put("good", 2); expectedWordOccurrence2.put("better", 3); expectedWordOccurrence2.put("best", 2); expectedWordOccurrence2.put("may", 1); expectedWordOccurrence2.put("i", 1); expectedWordOccurrence2.put("never", 1); expectedWordOccurrence2.put("rest", 1); expectedWordOccurrence2.put("until", 1); expectedWordOccurrence2.put("my", 2); expectedWordOccurrence2.put("is", 1); expectedWordOccurrence2.put("and", 1); assertOccurrences(expectedWordOccurrence2, wordOccurrence(sentence2)); } private static void assertOccurrences(Map<String, Integer> expected, Map<String, Integer> actual) { if (expected.equals(actual)) { System.out.println("Test PASS :)"); } else { System.out.println("Test FAIL :("); System.out.println("Expected: " + expected); System.out.println("Actual : " + actual); } } }