Author: Ionut Paun

Cerinta completa This challenge is part of a tutorial track by MyCodeSchool You are given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete nodes and return

Cerinta completa Given an array, you are asked to perform a number of queries and divide the array into what are called, beautiful subsequences. The array has length . A function is defined to be a minimal possible , such

Cerinta completa This challenge uses the famous KMP algorithm. It isn’t really important to understand how KMP works, but you should understand what it calculates. A KMP algorithm takes a string, , of length as input. Let’s assume that the

Cerinta completa Taylor loves trees, and this new challenge has him stumped! Consider a tree, , consisting of nodes. Each node is numbered from to , and each node has an integer, , attached to it. A query on tree

Cerinta completa A Sumo wrestling championship is scheduled to be held this winter in the HackerCity where N wrestlers from different parts of the world are going to participate. The rules state that two wrestlers can fight against each other

Cerinta completa In this challenge, the task is to debug the existing code to successfully execute all provided test files. Given two strings consisting of digits 0 and 1 only, find the XOR of the two strings. To know more

Cerinta completa There are nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between and , inclusive. The second node will be between and , inclusive. Given a

Cerinta completa Given a tree of N nodes, where each node is uniquely numbered in between [1, N]. Each node also has a value which is initially 0. You need to perform following two operations in the tree. Update Operation

Cerinta completa You are given non-negative integers, . We define the score for some permutation () of length to be the maximum of for . Find the permutation with the minimum possible score and print its score. Note: is the

Cerinta completa You are given a square grid with some cells open (.) and some blocked (X). Your playing piece can move along any row or column until it reaches the edge of the grid or a blocked cell. Given