Some more screenshots from my sarcasm app :p






























Comments

Post a Comment

Popular posts from this blog

Day 20: Sorting - HackerRank 30 days of code solution

Objective Today, we're discussing a simple sorting algorithm called  Bubble Sort . Consider the following version of Bubble Sort: for ( int i = 0 ; i < n ; i ++) { // Track number of elements swapped during a single array traversal int numberOfSwaps = 0 ; for ( int j = 0 ; j < n - 1 ; j ++) { // Swap adjacent elements if they are in decreasing order if ( a [ j ] > a [ j + 1 ]) { swap ( a [ j ], a [ j + 1 ]); numberOfSwaps ++; } } // If no elements were swapped during a traversal, array is sorted if ( numberOfSwaps == 0 ) { break ; } } Task Given an array,  , of size   distinct elements, sort the array in  ascending  order using the  Bubble Sort  algorithm above. Once sorted, print the following   lines: Array is sorted in numSwaps swaps. where   is the number ...
Read more

Day 7: Arrays - HackerRank 30 days of code solution

Objective Today, we're learning about the  Array  data structure. Check out the  Tutorial  tab for learning materials and an instructional video! Task Given an array,  , of   integers, print  's elements in  reverse  order as a single line of space-separated numbers. Input Format The first line contains an integer,   (the size of our array). The second line contains   space-separated integers describing array  's elements. Constraints , where   is the   integer in the array. Output Format Print the elements of array   in reverse order as a single line of space-separated numbers. Sample Input 4 1 4 3 2 Sample Output 2 3 4 1 Solution : import java.io.*; import java.util.*; import java.math.*;   public class Solution {       public static void main(String[] args) {       ...
Read more

Day 19: Interfaces - HackerRank 30 days of code solution

Objective Today, we're learning about Interfaces. Check out the  Tutorial  tab for learning materials and an instructional video! Task The  AdvancedArithmetic  interface and the method declaration for the abstract  divisorSum(n)  method are provided for you in the editor below. Complete the implementation of  Calculator  class, which implements the  AdvancedArithmetic  interface. The implementation for the  divisorSum(n)  method must return the sum of all divisors of  . Input Format A single line containing an integer,  . Constraints Output Format You are not responsible for printing anything to stdout. The locked template code in the editor below will call your code and print the necessary output. Sample Input 6 Sample Output I implemented: AdvancedArithmetic 12 Explanation The integer   is evenly divisible by  ,  ,...
Read more