Search for a command to run...
Articles tagged with #algorithms
Understanding the Problem It is simply to find the common prefix in between the strings in the list strs. strs contains strings like strs = ["flower","flow","flight"]. In this case the common prefix will be ”fl” which is included in every string in c...
Understanding the Problem It is a simple task to return the number which appears the most in the list nums. If the input is nums = [2,2,1,1,1,2,2], the number that appears the most will be 2, thus return 2. Approach I would first acquire the unique n...
Understanding the Problem A given string with brackets have three types of brackets; brackets (), braces {} and squared brackets []. It is to return True if the brackets are paired to open and close in a correct way, like (){}[] or {[()]}. Other stri...
Understanding the Problem A given list nums has numbers from -100 to 100 in an arranged order. The task is to change nums in place by finding duplicate numbers and removing them. nums should stay with unique numbers only. It is not important to retur...
Understanding the Problem A binary tree is given as root. It can go both left and right, or only left or only right. It is to return the minimum difference between the nodes. It should be an absolute number though. As an example, if there is a tree t...
Understanding the Problem It is a palindrome problem with some extra steps to solve it. Some sentences are included in the test cases like s = "A man, a plan, a canal: Panama". It is only to be left with lower case alpha numerical characters, which w...