Author: Ionut Paun

Cerinta completa Let’s consider a permutation P = {p1, p2, …, pN} of the set of N = {1, 2, 3, …, N} elements . P is called a magic set if it satisfies both of the following constraints: Given

Cerinta completa Johnny, like every mathematician, has his favorite sequence of distinct natural numbers. Let’s call this sequence . Johnny was very bored, so he wrote down copies of the sequence in his big notebook. One day, when Johnny was

Cerinta completa Let’s play Fairy Chess! You have an chessboard. An -leaper is a chess piece which can move from some square to some square if ; however, its movements are restricted to up (), down (), left (), and

Cerinta completa You are given a tree (a simple connected graph with no cycles). Find the maximum number of edges you can remove from the tree to get a forest such that each connected component of the forest contains an

Cerinta completa Li and Lu have integers, , that they want to divide fairly between the two of them. They decide that if Li gets integers with indices (which implies that Lu gets integers with indices ), then the measure

Cerinta completa Christy is interning at HackerRank. One day she has to distribute some chocolates to her colleagues. She is biased towards her friends and plans to give them more than the others. One of the program managers hears of

Cerinta completa The factorial of the integer , written , 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

Cerinta completa Given an array of integers, determine the minimum number of elements to delete to leave only elements of equal value. Example Delete the elements and leaving . If both twos plus either the or the are deleted, it

Cerinta completa Ema built a quantum computer! Help her test its capabilities by solving the problem below. Given a grid of size , each cell in the grid is either or . A valid plus is defined here as the

Cerinta completa HackerRank is starting a bus service in MountainView, California. The bus starts at time T = 0 at station1 and goes through station2, station3, station4 in that order and reaches the headquarters located at stationn. At every station,