hackerrank vs leetcode

[LeetCode] Best Time to Buy and keep Stock IV, leetcode= Say you have an array for which Ith Element is the price of a given stock on day I . Design an algorithm to find the maximum profit. You may complete at most k transactions. Note:You may not engage in multiple transactions at the same time (ie, you must encrypt the stock before you buy again ).Solutions Use Dynamic Planning to solve the p

[LeetCode from zero to single row] No70.ClimbingStairs, leetcodeThis is an interesting question. First, let's look at the question: You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? There are three methods to implement this question (I think ): 1. recursion (corresponding code: climbStairs) If the stair has n layers, we rolled back to Th

LeetCode -- Permutation Sequence, leetcode The set[1,2,3,…,n]Contains a total of n! Unique permutations. By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3 ): "123" "132" "213" "231" "312" "321" Given n and k, return the kth permutation sequence. Note: Given n will be between 1 and 9 inclusive. Original question link: https://oj.leetcode.com/proble

Leetcode -- Kth Smallest Element in a BST, leetcode Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. Note:You may assume k is always valid, 1 ≤ k ≤ BST's total elements. Follow up:What if the BST is modified (insert/delete operations) often and you need to find the kth smallest frequently? How wocould you optimize the kthSmallest routine? Hint: Try to utilize

Leetcode-Maximum Gap, leetcode-maximum Given an unsorted array, find the maximum difference between the successive elements in its sorted form. Try to solve it in linear time/space. Return 0 if the array contains less than 2 elements. You may assume all elements in the array are non-negative integers and fit in the 32-bit signed integer range. Class Solution {public: int maximumGap (vector

Bitwise AND of Numbers Range -- LeetCode, leetcode Given a range [m, n] where 0 For example, given the range [5, 7], you shoshould return 4. Train of Thought: the first train of thought must start with bitwise AND from the first number, but the complexity is too high and new improvements are made. If there is a power of 2 in this range, from this point on, the power of the 2 is equal to n. If the power of

LeetCode | Best time to buy and keep stock 2, leetcode= Question: Say you have an array for which the ITh element is the price of a given stock on day I. Design an algorithm to find the maximum profit. you may complete as your transactions as you like (ie, buy one and every one share of the stock multiple times ). however, you may not engage in multiple transactions at the same time (ie, you must wait

Leetcode notes: 4Sum, leetcode notes 4sum I. Description Ii. problem-solving skills On the surface, this question is very similar to 3Sum. In fact, we can use the same thinking and method. However, in this case, the time complexity is O (n ^ 3 ), the space complexity is O (1) and will time out. This question can also be used to calculate the sum of the next two numbers after sorting. In a hash table, the

[LeetCode-interview algorithm classic-Java implementation] [002-Add Two Numbers (Two Numbers in a single-chain table)], leetcode -- java [002-Add Two Numbers )]Original question You are given two linked lists representing two non-negative numbers. the digits are stored in reverse order and each of their nodes contain a single digit. add the two numbers and return it as a linked list.Input: (2-> 4-> 3) + (5-

[Leetcode]-Maximum Depth of Binary Tree, leetcode-maximum Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Hide Tags: Tree, Depth-first SearchQuestion: obtain the maximum depth in a binary tree. The root node is defined as 1 depth.Idea: recursion is also adoptedRecursive termination conditions:A:

[Leetcode]-Path Sum, leetcode-pathsum Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. For example:Given the below binary tree and sum = 22,5/\4 8//\11 13 4/\\7 2 1Return true, as there exist a root-to-leaf path 5-> 4-> 11-> 2 which sum is 22. Hide Tags: Tree, Depth-first SearchQuestion: Find out if the sum

Leetcode 22, leetcode Generate Parentheses Question:Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:"()", "() ()()" Question:Returns the logarithm of parentheses and any combination to find all strings that meet the matching principle of parentheses. Ideas:Just consider the rule. The rule is to ensu

LeetCode 97: Interleaving String staggered, flip String leetcode Blog reprint please note address: http://blog.csdn.net/SunliyMonkey/article/details/48165711Description Address: https://leetcode.com/problems/interleaving-string/Three strings S1 , S2 , S3 , Judge S3 Whether S1 , S2 In combination. Example: S1 = aabcc S2 = dbbca When S3 = aadbbcbcac R

LeetCode -- Reverse Words in a String, leetcode Given an input string, reverse the string word by word. For example,Given s = "the sky is blue ",Return "blue is sky ". Click to show clarification. Clarification:What constitutes a word?A sequence of non-space characters constitutes a word.Cocould the input string contain leading or trailing spaces?Yes. However, your reversed string shocould not contain leadi

Leetcode [110]-Balanced Binary Tree, leetcode-balanced Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1. Determine whether a tree belongs to a balanced binary tree Determine the depth difference between the left and right nodes of the master no

Leetcode Note: Leetcode Letter Combinations of a Phone Number I. Description Given a digit string, return all possible letter combinations that the number coshould represent. A mapping of digit to letters (just like on the telephone buttons) is given below. Input:Digit string "23"Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"]. Ii. Question Analysis The question is: press a letter on your ph

68.4% Easy 543 Diameter of Binary Tree 43.2% Easy 476 Number complement 61.4% Easy 461 Hamming Distance 70.3% Easy 455 Assign Cookies 47% Easy 405 Convert a number to hexadecimal 41% Easy 371 Sum of integers 51.2% Easy 342 Power of Four 38.3% Easy 252 Meeting Rooms

Leetcode 17 Letter Combinations of a Phone Number, leetcode Given a digit string, return all possible letter combinations that the number coshould represent. A mapping of digit to letters (just like on the telephone buttons) is given below. Input:Digit string "23"Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"]. Cycle: Enter the number of digits {each character string consisting of the previo

LeetCode-Distinct Subsequences, leetcode-distinct Title: https://oj.leetcode.com/problems/distinct-subsequences/ Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie,"AC

LeetCode Rising Temperature, leetcode GivenWeatherTable, write a SQL query to find all dates 'IDs with higher temperature compared to its previous (yesterday's) dates. + --------- + ------------ + ---------------- + | Id (INT) | Date (DATE) | Temperature (INT) | + --------- + ------------ + ---------------- + | 1 | 2015-01-01 | 10 | 2 | 2015-01-02 | 25 | 3 | 2015-01-03 | 20 | 4 | 2015-01-04 | 30 | + ---