Category: algorithms
Given a string s of ‘(‘ , ‘)’ and lowercase English characters. Your task is to remove the minimum number of parentheses ( ‘(‘ or ‘)’, in any positions …
Given two sequences pushed and popped with distinct values, return true if and only if this could have been the result of a sequence of push and pop operations …
Given a binary tree with the following rules: root.val == 0 If treeNode.val == x and treeNode.left != null, then treeNode.left.val == 2 * x + 1 If treeNode.val …
Given the array nums, for each nums find out how many numbers in the array are smaller than it. That is, for each nums you have to count the …
Given an integer num, find the closest two integers in absolute difference whose product equals num + 1 or num + 2. Return the two integers in any order. …