Author: Ionut Paun

Cerinta completa There are people at the railway station, and each one wants to buy a ticket to go to one of different destinations. The people are in a queue. There are ticket windows from which tickets can be purchased.

Cerinta completa Manasa loves the nim game, in which there are buckets, each having balls. Two players play alternately. Each turn consists of removing some non-zero number of balls from one of the bucket. A player with lack of moves

Cerinta completa An Introduction to the Longest Increasing Subsequence Problem The task is to find the length of the longest subsequence in a given array of integers such that all elements of the subsequence are sorted in strictly ascending order.

Cerinta completa Given an array of strings of digits, try to find the occurrence of a given pattern of digits. In the grid and pattern arrays, each string represents a row in the grid. For example, consider the following grid:

Cerinta completa Bomberman lives in a rectangular grid. Each cell in the grid either contains a bomb or nothing at all. Each bomb can be planted in any cell of the grid but once planted, it will detonate after exactly

Cerinta completa Taum is planning to celebrate the birthday of his friend, Diksha. There are two types of gifts that Diksha wants from Taum: one is black and the other is white. To make her happy, Taum has to buy

Cerinta completa Bitville is a seaside city that has a number of shopping centers connected by bidirectional roads, each of which has a travel time associated with it. Each of the shopping centers may have a fishmonger who sells one

Cerinta completa Given an array of integers (), find all possible increasing subsequences of maximum length, . Then print the lexicographically longest increasing subsequence as a single line of space-separated integers; if there are less than subsequences of length ,

Cerinta completa Megan is playing a string game with the following rules: It starts with a string, . During each turn, she performs the following move: Choose an index in . The chosen index must be strictly greater than any

Cerinta completa Complete the function to compute the sum of two integers. Example Return . Function Description Complete the function with the following parameters: : the first value : the second value Returns – : the sum of and Constraints