Author: Ionut Paun

Cerinta completa There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. Example There are

Cerinta completa You have an empty sequence, and you will be given queries. Each query is one of these three types: 1 x -Push the element x into the stack. 2 -Delete the element present at the top of the

Cerinta completa People connect with each other in a social network. A connection between Person and Person is represented as . When two persons belonging to different communities connect, the net effect is the merge the communities which and belong

Cerinta completa White Falcon just solved the data structure problem below using heavy-light decomposition. Can you help her find a new solution that doesn’t require implementing any fancy techniques? There are types of query operations that can be performed on

Cerinta completa Roy has taken a liking to the Binary Search Trees(BST). He is interested in knowing the number of ways an array of integers can be arranged to form a BST. Thus, he tries a few combinations, and notes

Cerinta completa Transforming data into some other data is typical of a programming job. This problem is about a particular kind of transformation which we’ll call the max transform. Let be a zero-indexed array of integers. For , let denote

Cerinta completa Chinese Version Russian Version You are given a tree with N nodes and each has a value associated with it. You are given Q queries, each of which is either an update or a retrieval operation. The update

Cerinta completa This challenge is part of a MyCodeSchool tutorial track and is accompanied by a video lesson. This exercise focuses on traversing a linked list. You are given a pointer to the node of a linked list. The task

Cerinta completa Meera teaches a class of students, and every day in her classroom is an adventure. Today is drawing day! The students are sitting around a round table, and they are numbered from to in the clockwise direction. This

Cerinta completa Skyline Real Estate Developers is planning to demolish a number of old, unoccupied buildings and construct a shopping mall in their place. Your task is to find the largest solid area in which the mall can be constructed.