Author: Ionut Paun

Cerinta completa We define the following: A subarray of array of length is a contiguous segment from through where . The sum of an array is the sum of its elements. Given an element array of integers, , and an

Cerinta completa You have an infinite number of 4 types of lego blocks of sizes given as (depth x height x width): d h w 1 1 1 1 1 2 1 1 3 1 1 4 Using these blocks,

Cerinta completa Whenever George asks Lily to hang out, she’s busy doing homework. George wants to help her finish it faster, but he’s in over his head! Can you help George understand Lily’s homework so she can hang out with

Cerinta completa Lena is preparing for an important coding competition that is preceded by a number of sequential preliminary contests. Initially, her luck balance is 0. She believes in “saving luck”, and wants to check her theory. Each contest is

Cerinta completa A tree of nodes is an un-directed connected graph having edges. Let us denote as the root node. If is a node such that it is at a distance of from , and is a node such that

Cerinta completa You are playing a matrix-based game with the following setup and rules: You are given a matrix with rows and columns. Each cell contains some points. When a player passes a cell their score increases by the number

Cerinta completa Given an array of integers, where all elements but one occur twice, find the unique element. Example The unique element is . Function Description Complete the lonelyinteger function in the editor below. lonelyinteger has the following parameter(s): int

Cerinta completa Kitty and Katty have plastic blocks. They label the blocks with sequential numbers from to and begin playing a game in turns, with Kitty always taking the first turn. The game’s rules are as follows: For each turn,

Cerinta completa Marc loves cupcakes, but he also likes to stay fit. Each cupcake has a calorie count, and Marc can walk a distance to expend those calories. If Marc has eaten cupcakes so far, after eating a cupcake with

Cerinta completa You are given an unordered array of unique integers incrementing from . You can swap any two elements a limited number of times. Determine the largest lexicographical value array that can be created by executing no more than