Welcome Post

Hello guys This is my first post just to welcome you all.

Comments

Post a Comment

Popular posts from this blog

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

Day 27: Testing - HackerRank 30 days of code solution

This problem is all about unit testing. Your company needs a function that meets the following requirements: For a given array of   integers, the function returns the index of the element with the minimum value in the array. If there is more than one element with the minimum value, the returned index should be the smallest one. If an empty array is passed to the function, it should raise an Exception. Note: The arrays are indexed from  . A colleague has written that function, and your task is to design   separated unit tests, testing if the function behaves correctly. The implementation in Python is listed below (Implementations in other languages can be found in the code template): def minimum_index ( seq ): if len ( seq ) == 0 : raise ValueError ( "Cannot get the minimum value index from an empty sequence" ) min_idx = 0 for i in range ( 1 , len ( seq )): if a [ i ] < a [ min_idx ]: mi...
Read more

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