"Cu cât aștepți mai mult să faci ceva ce ar trebui să faci acum, cu atât sunt mai mari șansele să nu mai faci niciodata acel lucru"
Challenge: Best Sum Scor cont: 100.0 / 100 Submission status: Accepted Submission score: 1.0 Submission ID: 464808483 Limbaj: cpp14 Link challenge: https://www.hackerrank.com/challenges/best-sum/problem Cerinta You are given two arrays *A* and *B* of length **N**. Let S be the set of
Challenge: Baby Step, Giant Step Scor cont: 30.0 / 30 Submission status: Accepted Submission score: 1.0 Submission ID: 464724516 Limbaj: cpp14 Link challenge: https://www.hackerrank.com/challenges/baby-step-giant-step/problem Cerinta You are standing at point $(0, 0)$ on an infinite plane. In one step, you
Challenge: A Circle and a Square Scor cont: 35.0 / 35 Submission status: Accepted Submission score: 1.0 Submission ID: 464727903 Limbaj: cpp14 Link challenge: https://www.hackerrank.com/challenges/a-circle-and-a-square/problem Cerinta In this challenge, you must implement part of a [raster graphics](https://en.wikipedia.org/wiki/Raster_graphics) editor that takes
Cerinta completa Of the following data structures, which has a Last in First Out ordering? In other words, the one that came in last will be the first to be popped. Limbajul de programare folosit: N/A (quiz / MCQ) Raspuns
Cerinta completa Which of the following data structures can handle updates and queries in log(n) time on an array? Limbajul de programare folosit: N/A (quiz / MCQ) Raspuns corect: Segment Tree Explicatie: Correct answer is Segment Tree. Please refer to
Cerinta completa If we have a tree of n nodes, how many edges will it have? Limbajul de programare folosit: N/A (quiz / MCQ) Raspuns corect: n-1 Explicatie: Correct answer is n-1. An undirected tree with n nodes must have
Cerinta completa You are a waiter at a party. There is a pile of numbered plates. Create an empty array. At each iteration, , remove each plate from the top of the stack in order. Determine if the number on
Cerinta completa Consider an -integer sequence, . We perform a query on by using an integer, , to calculate the result of the following expression: In other words, if we let , then you need to calculate . Given and
Cerinta completa Consider a lowercase English alphabetic letter character denoted by . A shift operation on some turns it into the next letter in the alphabet. For example, and , , . Given a zero-indexed string, , of lowercase letters,
Cerinta completa Andy and Lily love playing games with numbers and trees. Today they have a tree consisting of nodes and edges. Each edge has an integer weight, . Before the game starts, Andy chooses an unordered pair of distinct