@@ -0,0 +1,800 @@
+//Problem: https://www.hackerrank.com/challenges/camelcase%0D%0A//Java 8%0D%0A/*%0D%0AIf we handle the edge cases all we need to do is count the capital letters%0D%0A*/%0D%0A%0D%0A%0D%0Aimport java.io.*;%0D%0Aimport java.util.*;%0D%0Aimport java.text.*;%0D%0Aimport java.math.*;%0D%0Aimport java.util.regex.*;%0D%0A%0D%0Apublic class Solution %7B%0D%0A%0D%0A    public static void main(String%5B%5D args) %7B%0D%0A        Scanner in = new Scanner(System.in);%0D%0A        String s = in.next();%0D%0A        %0D%0A        if(s.isEmpty())%0D%0A        %7B%0D%0A            System.out.println(%220%22);%0D%0A            System.exit(0);%0D%0A        %7D%0D%0A        %0D%0A        int words = 1;%0D%0A        %0D%0A        for(char letter : s.toCharArray())%0D%0A        %7B%0D%0A            if(letter %3C 91 && letter %3E 64 )%0D%0A            %7B%0D%0A                words++;%0D%0A            %7D%0D%0A        %7D%0D%0A        System.out.println(words);%0D%0A    %7D%0D%0A%7D%0D%0A

Completed a string algorithm called camelCase