M-ZubairAhmed

/*  When the given problem is to find number number of trailing zeros of the factorial, one is not required to 
find out the factorial.
Statement : factorial(5) = 120 	= 1*2*3*4*5
factorial(4) = 24	= 1*2*3*4
if it is observed the occurance of 5 or multiples of five is in direct proportion to number of trailing zeros
If however, expression contains powers of 5, then the trailing zeros increasing with power of 5.
factorial(25) = 1*...5*..10..*15*..20*..25
As expected number of trailing zero in above is expected to be 5, but since 25 is 5 power 2, it adds another zero 
hence final count is 6.
*/

M-ZubairAhmed

/*Number with dual Cube Sums
TwoCubeSums
which checks if a given number can be written as the sum of two cubes in two different ways: n = a³+b³ = c³+d³. All the numbers a, b, c and d should be different and greater than 0.
e.g. 1729 = 9³+10³ = 1³+12³.
*/

public class CubeSumsClass {
    public static boolean hasTwoCubeSums(int n){
        int checker = 0;
        for (int i = 0; i <=(int)Math.pow(n,1.0/3.0); i++) {

M-ZubairAhmed

/*
89 is a unique number and searching similar others
The number 89 is the first integer with more than one digit that fulfills the property partially introduced below:
example
    89 = 8^1 + 9^2
    135 = 1^1 + 3^2 + 5^3
The sum of each digit when raised to its position value equals the former number
A range is given and all those numbers with above property is collected.
*/

M-ZubairAhmed

/*
One of the easiest ways to check if a number after it comes back from some function is an Integer or not is to check its remainder with 1. eg.
if(Number % 1 == 0){
  print "this is a perfect integer"}
 else{
  print "this is a real number with decimal places"}

M-ZubairAhmed

# Built application files
/*/build/

# Crashlytics configuations
com_crashlytics_export_strings.xml

# Local configuration file (sdk path, etc)
local.properties

# Gradle generated files

M-ZubairAhmed

public class StringUtils {

    public static boolean isHexNumber(String s) {

        int cursor;

        if (s.length() == 0){
            return false;
        }

M-ZubairAhmed

public class Accumul {
    public static String accum(String s){
        StringBuilder stBuild = new StringBuilder();
        for(int i = 0; i < s.length(); i++){
            for(int j = 0; j <= i; j++) {
                if (j==0){
                    stBuild.append(s.toUpperCase().charAt(i));
                }
                else {
                    stBuild.append(s.toLowerCase().charAt(i));

M-ZubairAhmed

public class Keypad {
    public static int presses(String phrase){

        int noPresses = 0;
        for(int i = 0 ; i<phrase.length(); i++){
            char aToZ = phrase.toUpperCase().charAt(i);
            if (aToZ == 'A'||aToZ == 'D'||aToZ == 'G'||aToZ == 'J'||aToZ == 'M'||aToZ == 'P'||aToZ == 'T'||aToZ == 'W'||aToZ == '1'||aToZ == ' '||aToZ == '*'||aToZ == '#'){
                noPresses = noPresses + 1;
                System.out.println(noPresses+" 1 = "+aToZ);}
            else if (aToZ == 'B'||aToZ == 'E'||aToZ == 'H'||aToZ == 'K'||aToZ == 'N'||aToZ == 'Q'||aToZ == 'U'||aToZ == 'X'||aToZ == '0'){

M-ZubairAhmed

public class NotePassing {
    public static String decipher (String codedMessage, int key){
        char[] charArray = new char[codedMessage.length()];
        int[] intArray = new int[codedMessage.length()+1];
        for (int r = 0; r < codedMessage.length(); r++){

            boolean isUCase = (codedMessage.charAt(r)>=65) && (codedMessage.charAt(r)<=90);
            boolean isLCase = (codedMessage.charAt(r)>=97) && (codedMessage.charAt(r)<=122);
            int changedAsci = ((int)codedMessage.charAt(r)) + key;
            if (isUCase) {

M-ZubairAhmed

/**
   * This method is for encription of text.
   * @param   s             The input text which is to be encrypted
   * @param   shift         The initial key value to be executed at the first
   *                        letter of the text.
   * @param   incremental   The number by which the value of key is increased.
   * @return                The encrypted text is returned.
  **/
    public static String movingShift(String s, int shift, int incremental){