@@ -0,0 +1,445 @@
+package com.codeprep.camelcase;%0A%0Aimport java.util.Scanner;%0A%0Apublic class Solution %7B%0A%0A%09public static void main(String%5B%5D args) %7B%0A%09%09int capsCount = 0;%0A%09%09Scanner in = new Scanner(System.in);%0A%09%09String s = in.next();%0A%09%09char%5B%5D charArray = s.toCharArray();%0A%09%09for (char c : charArray) %7B%0A%09%09%09if (Character.isUpperCase(c)) %7B%0A%09%09%09%09capsCount++;%0A%09%09%09%7D%0A%09%09%7D%0A%09%09if (capsCount %3E 0) %7B%0A%09%09%09System.out.println(capsCount + 1);%0A%09%09%7Delse%7B%0A%09%09%09System.out.println(1);%0A%09%09%7D%0A%09%7D%0A%0A%7D%0A

solved camelCase