Veritas des Liberty

摘要： You have an array of logs. Each log is a space delimited string of words. For each log, the first word in each log is an alphanumeric identifier. Then 阅读全文

摘要： We are given two arrays A and B of words. Each word is a string of lowercase letters. Now, say that word b is a subset of word a if every letter in b  阅读全文

摘要： A string S of lowercase letters is given. Then, we may make any number of moves. In each move, we choose one of the first K letters (starting from the 阅读全文

摘要： Given a balanced parentheses string S, compute the score of the string based on the following rule: () has score 1 AB has score A + B, where A and B a 阅读全文

摘要： To some string S, we will perform some replacement operations that replace groups of letters with new ones (not necessarily the same size). Each repla 阅读全文

摘要： We had some 2-dimensional coordinates, like "(1, 3)" or "(2, 0.5)". Then, we removed all commas, decimal points, and spaces, and ended up with the str 阅读全文

摘要： Given an expression such as expression = "e + 8 - a + 5" and an evaluation map such as {"e": 1} (given in terms of evalvars = ["e"] and evalints = [1] 阅读全文

摘要： X is a good number if after rotating each digit individually by 180 degrees, we get a valid number that is different from X. Each digit must be rotate 阅读全文

摘要： Special binary strings are binary strings with the following two properties: The number of 0's is equal to the number of 1's. Every prefix of the bina 阅读全文

摘要： You are given a string expression representing a Lisp-like expression to return the integer value of. The syntax for these expressions is given as fol 阅读全文