Sign in Subscribe

Topic

Hackerrank

A collection of 419 issues

Extra Long Factorials Solution

The factorial of the integer n, written n!, is defined as: Calculate and print the factorial of a given integer. For example, if , we calculate and get . Function Description Complete the extraLongFactorials function in the editor below. It should print the result and return. extraLongFactorials has the following parameter(s)

Hackerrank - Between Two Sets Solution

You will be given two arrays of integers and asked to determine all integers that satisfy the following two conditions: 1. The elements of the first array are all factors of the integer being considered 2. The integer being considered is a factor of all elements of the second array

Insertion Sort - Part 2 Solution

In Insertion Sort Part 1, you inserted one element into an array at its correct sorted position. Using the same approach repeatedly, can you sort an entire array? Guideline: You already can place an element into a sorted array. How can you use that code to build up a sorted

Insertion Sort - Part 1 Solution

Sorting One common task for computers is to sort data. For example, people might want to see all their files on a computer sorted by size. Since sorting is a simple problem with many different possible solutions, it is often used to introduce the study of algorithms. Insertion Sort These

Hackerrank - Encryption Solution

An English text needs to be encrypted using the following encryption scheme. First, the spaces are removed from the text. Let be the length of this text. Then, characters are written into a grid, whose rows and columns have the following constraints: For example, the sentence , after removing spaces is

Hackerrank - Kangaroo Solution

You are choreographing a circus show with various animals. For one act, you are given two kangaroos on a number line ready to jump in the positive direction (i.e, toward positive infinity). * The first kangaroo starts at location and moves at a rate of meters per jump. * The second

Hackerrank - 2D Array - DS - Solution

Given a 2D Array, : 1 1 1 0 0 0 0 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 We define an hourglass in to be a subset of

Hackerrank - Balanced Brackets Solution

A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types

Sherlock and Moving Tiles Solution

Sherlock is given square tiles, initially both of whose sides have length placed in an plane; so that the bottom left corner of each square coincides with the the origin and their sides are parallel to the axes. At , both squares start moving along line (along the positive and ) with

Hackerrank - Symmetric Difference Solution

Objective Today, we're learning about a new data type: sets. Concept If the inputs are given on one line separated by a space character, use split() to get the separate values in the form of a list: >> a = raw_input() 5 4 3 2 >>