Cerinta completa In this problem you operate on two arrays of integers. We will call them the and the respectively. Your goal is just to maintain them under the modification operations, such as: 1 : Reverse the subarray of the
Jaggu Playing with Balloons
Cerinta completa Jaggu is a little kid and he likes playing with water balloons. He took 1 million ( 106 ) empty buckets and he filled the bucket with water balloons under the instruction of his sister Ishika. His sister
Tree: Postorder Traversal
Cerinta completa Complete the function in the editor below. It received parameter: a pointer to the root of a binary tree. It must print the values in the tree’s postorder traversal as a single line of space-separated values. Input Format
Jim and the Skyscrapers
Cerinta completa Jim has invented a new flying object called HZ42. HZ42 is like a broom and can only fly horizontally, independent of the environment. One day, Jim started his flight from Dubai’s highest skyscraper, traveled some distance and landed
Tree: Height of a Binary Tree
Cerinta completa The height of a binary tree is the number of edges between the tree’s root and its furthest leaf. For example, the following binary tree is of height : Function Description Complete the getHeight or height function in
Is This a Binary Search Tree?
Cerinta completa For the purposes of this challenge, we define a binary tree to be a binary search tree with the following ordering requirements: The value of every node in a node’s left subtree is less than the data value
Insert a node at a specific position in a linked list
Cerinta completa This challenge is part of a tutorial track by MyCodeSchool and is accompanied by a video lesson. Given a pointer to the head node of a linked list and an integer to insert at a certain position, create
The Strange Function
Cerinta completa One of the most important skills a programmer needs to learn early on is the ability to pose a problem in an abstract way. This skill is important not just for researchers but also in applied fields like
Swap Nodes [Algo]
Cerinta completa A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree,
Subsequence Weighting
Cerinta completa A subsequence of a sequence is a sequence which is obtained by deleting zero or more elements from the sequence. You are given a sequence A in which every element is a pair of integers i.e A =