juble의 개발노트

ProblemYou have an infinite number of 4 types of lego blocks of sizes given as (depth x height x width):d h w1 1 11 1 21 1 31 1 4Using these blocks, you want to make a wall of height n and width m. Features of the wall are:- The wall should not have any holes in it.- The wall you build should be one solid structure, so there should not be a straight vertical break across all rows of bricks.- The..

ProblemImplement a simple text editor. The editor initially contains an empty string, S. Perform Q operations of the following 4 types:append(W) - Append string W to the end of S.delete(k) - Delete the last k characters of S.print(k) - Print the k^th character of S.undo - Undo the last (not previously undone) operation of type 1 or 2, reverting S to the state it was in prior to that operation.Ex..

ProblemGiven an array of integers and a target value, determine the number of pairs of array elements that have a difference equal to the target value. Examplek = 1arr = [1, 2, 3, 4]There are three values that differ by k = 1: 2 - 1 = 1, 3 - 2 = 1, and 4 - 3 = 1. Return 3. Function DescriptionComplete the pairs function below.pairs has the following parameter(s):int k: an integer, the target dif..

ProblemA bracket is considered to be any one of the following characters: (, ), {, }, [, or ].Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {}, and ().A matching pair of brackets is not balanced if the set of br..

ProblemA queue is an abstract data type that maintains the order in which elements were added to it, allowing the oldest elements to be removed from the front and new elements to be added to the rear. This is called a First-In-First-Out (FIFO) data structure because the first element added to the queue (i.e., the one that has been waiting the longest) is always the first one to be removed.A basi..

ProblemThis challenge is part of a tutorial track by MyCodeSchoolGiven pointers to the heads of two sorted linked lists, merge them into a single, sorted linked list. Either head pointer may be null meaning that the corresponding list is empty. ExampleHeadA refers to 1 → 3 → 7 → NULLheadB refers to 1 → 2 → NULLThe new list is 1 → 1 → 2 → 3 → 7 → NULL Function DescriptionComplete the mergeLists f..

ProblemSuppose there is a circle. There are N petrol pumps on that circle. Petrol pumps are numbered 0 to (N-1) (both inclusive). You have two pieces of information corresponding to each of the petrol pump: (1) the amount of petrol that particular petrol pump will give, and (2) the distance from that petrol pump to the next petrol pump.Initially, you have a tank of infinite capacity carrying no ..

ProblemIt is New Year's Day and people are in line for the Wonderland rollercoaster ride. Each person wears a sticker indicating their initial position in the queue from 1 to n. Any person can bribe the person directly in front of them to swap positions, but they still wear their original sticker. One person can bribe at most two others.Determine the minimum number of bribes that took place to g..

ProblemWe define super digit of an integer x using the following rules:Given an integer, we need to find the super digit of the integer.If x has only 1 digit, then its super digit is x.Otherwise, the super digit of x is equal to the super digit of the sum of the digits of x.For example, the super digit of 9875 will be calculated as: super_digit(9875) 9+8+7+5 = 29 super_digit(29) 2 + 9 = 11 ..

ProblemGiven a square grid of characters in the range ascii[a-z], rearrange elements of each row alphabetically, ascending. Determine if the columns are also in ascending alphabetical order, top to bottom. Return YES if they are or NO if they are not. Examplegrid = ['abc', 'ade', 'efg']The grid is illustrated below.a b ca d ee f gThe rows are already in alphabetical order. The columns a a e, b d..