juble의 개발노트

ProblemThere is a given list of strings where each string contains only lowercase letters from a-j, inclusive. The set of strings is said to be a GOOD SET if no string is a prefix of another string. In this case, print GOOD SET. Otherwise, print BAD SET on the first line followed by the string being checked.Note If two strings are identical, they are prefixes of each other. Examplewords = ['abcd..

ProblemHuffman coding assigns variable length codewords to fixed length input characters based on their frequencies. More frequent characters are assigned shorter codewords and less frequent characters are assigned longer codewords. All edges along the path to a character contain a code digit. If they are on the left side of the tree, they will be a 0 (zero). If on the right, they'll be a 1 (one..

ProblemComplete the preOrder function in the editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's preorder traversal as a single line of space-separated values.Input FormatOur test code passes the root node of a binary tree to the preOrder function.Constraints1 ≤ Nodes in the tree ≤ 500Output FormatPrint the tree's preorder traversal..

ProblemConsider an undirected graph where each edge weighs 6 units. Each of the nodes is labeled consecutively from 1 to n.You will be given a number of queries. For each query, you will be given a list of edges describing an undirected graph. After you create a representation of the graph, you must determine and report the shortest distance to each of the other nodes from a given starting posit..

ProblemJesse loves cookies and wants the sweetness of some cookies to be greater than value k. To do this, two cookies with the least sweetness are repeatedly mixed. This creates a special combined cookie with:sweetness = (1 × Least sweet cookie  + 2 × 2nd least sweet cookie).This occurs until all the cookies have a sweetness ≥ k.Given the sweetness of a number of cookies, determine the minimum ..

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..