Author: Ionut Paun

Cerinta completa You have a rectangular board consisting of rows, numbered from to , and columns, numbered from to . The top left is and the bottom right is . Initially – at time – there is a coin on

Cerinta completa A palindrome is a string that reads the same from left to right as it does from right to left. Given a string, , of lowercase English letters, we define a -length rotation as cutting the first characters

Cerinta completa White Falcon has a tree with nodes. Each node contains a linear function. Let’s denote by the linear function contained in the node . Let’s denote the path from node to node like this: , where and ,

Cerinta completa Suppose there is a circle. There are petrol pumps on that circle. Petrol pumps are numbered to (both inclusive). You have two pieces of information corresponding to each of the petrol pump: (1) the amount of petrol that

Cerinta completa Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the function and

Cerinta completa There is an integer array which does not contain more than two elements of the same value. How many distinct ascending triples () are present?  Input format The first line contains an integer, , denoting the number of

Cerinta completa We consider metric space to be a pair, , where is a set and such that the following conditions hold: where is the distance between points and . Let’s define the product of two metric spaces, , to

Cerinta completa In this challenge, you are required to implement inorder traversal of a tree. Complete the function in your editor below, which has parameter: a pointer to the root of a binary tree. It must print the values in

Cerinta completa Natural numbers from 1 to N have been placed in an increasing order over some helix ( a circular structure ). When the helix starts rotating, it is easy to find out The position of a given number

Cerinta completa Given a pointer to the root of a binary tree, print the top view of the binary tree. The tree as seen from the top the nodes, is called the top view of the tree. For example :