Initial commit.

Author: deepcloudlabs

.idea/$CACHE_FILE$

@@ -1,2 +1,17 @@
-# stream-api-exercises-part3
-Stream API Exercises : Part III
+### Stream API Exercises : Part III
+In the following exercises you will use a dictionary file: **dictionary.txt**.
+
+**Q.1)** Find the words starting with letters **a** to **m**.
+
+**Q.2)** Find the words starting with the letter **n** to the end of the dictionary
+
+**Q.3)** Group the dictionary words by their first three letters
+
+**Q.4)** Find the palindromes in the dictionary. A palindrome is a word, number, phrase, or other
+sequence of characters which reads the same backward as forward, such as madam or racecar
+
+**Q.5)** Count the vowels used in words.
+
+**Q.6)** Find the words starting with the letter **a**, and ends with the letter **z**.
+
+**Q.7)** Find the longest word in the dictionary

.idea/$PRODUCT_WORKSPACE_FILE$

@@ -0,0 +1,20 @@
+package com.example.dictionary.exercises;
+
+import java.nio.file.Files;
+import java.nio.file.Paths;
+import java.util.List;
+
+/**
+ * 
+ * @author Binnur Kurt <binnur.kurt@gmail.com>
+ *
+ */
+public class Exercise1 {
+
+	public static void main(String[] args) throws Exception {
+		final List<String> words = Files.readAllLines(Paths.get("src", "dictionary.txt"));
+		// Find the words starting with letters a to m
+		words.stream().takeWhile(line -> line.matches("^[a-m].*$")).forEach(System.out::println);
+	}
+
+}

.idea/.gitignore

@@ -0,0 +1,20 @@
+package com.example.dictionary.exercises;
+
+import java.nio.file.Files;
+import java.nio.file.Paths;
+import java.util.List;
+
+/**
+ * 
+ * @author Binnur Kurt <binnur.kurt@gmail.com>
+ *
+ */
+public class Exercise2 {
+
+	public static void main(String[] args) throws Exception {
+		final List<String> words = Files.readAllLines(Paths.get("src", "dictionary.txt"));
+		// Find the words starting with the letter n to the end of the dictionary
+		words.stream().dropWhile(line -> line.matches("[a-m].*$")).forEach(System.out::println);
+	}
+
+}

.idea/misc.xml

@@ -0,0 +1,32 @@
+package com.example.dictionary.exercises;
+
+import java.nio.file.Files;
+import java.nio.file.Paths;
+import java.util.List;
+import java.util.Map;
+import java.util.function.BiConsumer;
+import java.util.function.Function;
+import java.util.stream.Collector;
+import java.util.stream.Collectors;
+
+/**
+ * 
+ * @author Binnur Kurt <binnur.kurt@gmail.com>
+ *
+ */
+public class Exercise3 {
+	private static final Function<String, String> first3CharsMapper = word -> word.length() >= 3 ? word.substring(0, 3)
+			: word.substring(0, word.length());
+	private static final Collector<String, ?, Map<String, List<String>>> clusteredIndexCollector = Collectors
+			.groupingBy(first3CharsMapper);
+	private static final BiConsumer<String, List<String>> clusteredIndexPrinter = (index,list) -> {
+		System.out.println(index + ": " + list);
+	};
+
+	public static void main(String[] args) throws Exception {
+		final List<String> words = Files.readAllLines(Paths.get("src", "dictionary.txt"));
+		// Group the dictionary words by their first three letters
+		Map<String, List<String>> clusteredIndex = words.stream().collect(clusteredIndexCollector);
+		clusteredIndex.forEach( clusteredIndexPrinter);
+	}
+}

.idea/modules.xml

@@ -0,0 +1,22 @@
+package com.example.dictionary.exercises;
+
+import java.nio.file.Files;
+import java.nio.file.Paths;
+import java.util.List;
+import java.util.function.Predicate;
+
+/**
+ * 
+ * @author Binnur Kurt <binnur.kurt@gmail.com>
+ *
+ */
+public class Exercise4 {
+	private static final Predicate<String> isPalindrome = word -> word.contains(new StringBuilder(word).reverse());
+
+	public static void main(String[] args) throws Exception {
+		final List<String> words = Files.readAllLines(Paths.get("src", "dictionary.txt"));
+		// Find the palindromes in the dictionary
+		words.stream().filter(isPalindrome).forEach(System.err::println);
+	}
+
+}

.idea/stream-api-exercises-part3.iml

@@ -0,0 +1,33 @@
+package com.example.dictionary.exercises;
+
+import static java.util.stream.Collectors.groupingBy;
+import static java.util.stream.Collectors.mapping;
+import static java.util.stream.Collectors.toList;
+
+import java.nio.file.Files;
+import java.nio.file.Paths;
+import java.util.AbstractMap;
+import java.util.List;
+import java.util.Map.Entry;
+import java.util.function.BiConsumer;
+
+/**
+ * 
+ * @author Binnur Kurt <binnur.kurt@gmail.com>
+ *
+ */
+public class Exercise5 {
+	private static final BiConsumer<Integer, List<String>> printEntry = (key, value) -> System.out.format("%c : %d\n",
+			key, value.size());
+
+	public static void main(String[] args) throws Exception {
+		final List<String> words = Files.readAllLines(Paths.get("src", "dictionary.txt"));
+		// Count the vowels used in words
+		words.stream().flatMap(word -> word.chars().boxed().map(c -> pair(c, word)))
+				.collect(groupingBy(Entry::getKey, mapping(Entry::getValue, toList()))).forEach(printEntry);
+	}
+
+	private static <T, U> AbstractMap.SimpleEntry<T, U> pair(T t, U u) {
+		return new AbstractMap.SimpleEntry<T, U>(t, u);
+	}
+}

.idea/vcs.xml

@@ -0,0 +1,22 @@
+package com.example.dictionary.exercises;
+
+import java.nio.file.Files;
+import java.nio.file.Paths;
+import java.util.List;
+
+/**
+ * 
+ * @author Binnur Kurt <binnur.kurt@gmail.com>
+ *
+ */
+public class Exercise6 {
+
+	public static void main(String[] args) throws Exception {
+		final List<String> words = Files.readAllLines(Paths.get("src", "dictionary.txt"));
+		// Find the first word starting with the letter a, and ends with the letter z
+		System.out.println(words.stream().filter(word -> word.matches("^a.*z$")).findFirst().orElse("Not found!"));
+		// Find all the words starting with the letter a, and ends with the letter z
+		words.stream().filter(word -> word.matches("^a.*z$")).forEach(System.out::println);
+	}
+
+}

README.md

@@ -0,0 +1,22 @@
+package com.example.dictionary.exercises;
+
+import java.nio.file.Files;
+import java.nio.file.Paths;
+import java.util.Comparator;
+import java.util.List;
+
+/**
+ * 
+ * @author Binnur Kurt <binnur.kurt@gmail.com>
+ *
+ */
+public class Exercise7 {
+
+	public static void main(String[] args) throws Exception {
+		final List<String> words = Files.readAllLines(Paths.get("src", "dictionary.txt"));
+		// Find the longest word in the dictionary
+		words.stream().sorted(Comparator.comparing(String::length).reversed()).findFirst()
+				.ifPresent(System.out::println);
+	}
+
+}