• HackerRank - Java If-Else, Java Loops I, Java Loops II, Java Std In and Out

  • Given a number, print the digits from right to left (Input: 123, print: 1 [line break] 2 [line break] 3)

  • Take a number as input. This will be the number of rows and columns of your matrix (square matrix). Now do the following

    • Print the matrix. The right diagonal should have only 1s, and the rest should have 0s
    • Print the matrix. The left diagonal should have only 1s, and the rest should have 0s
    • Print the matrix. The right diagonal and left diagonals should have 1s (the cross shape should be 1s) and the rest should have 0s.

  • Implement fast modular exponentiation in java. Article explaining the concept here, solution is the second code snippet here.

  • Check the summation problems toggle below, for each of the problems first implement it with a loop. Then use the formula to calculate the same value. (Take input numbers that are appropriate for each problem)

  • Summation problems