LeetCode 104. Maximum Depth of Binary Tree
Description:
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.
LeetCode 101. Symmetric Tree
LeetCode 101. Symmetric Tree
Description:
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
LeetCode 100.Same Tree
LeetCode 100.Same Tree
Description:
Given two binary trees, write a function to check if they are the same or not.
Two binary trees are considered the same if they are structurally identical and the nodes have the same value.
LeetCode 35. Search Insert Position
LeetCode 35. Search Insert Position
Description:
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the array.
LeetCode 88. Merge Sorted Array
LeetCode 88. Merge Sorted Array
Description:
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
Note:
You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectively.
LeetCode 119. Pascal's Triangle II
LeetCode 119. Pascal’s Triangle II
Description:
Given an index k, return the kth row of the Pascal’s triangle.
For example, given k = 3,
Return [1,3,3,1].
LeetCode 118. Pascal's Triangle
LeetCode 118. Pascal’s Triangle
Description:
Given numRows, generate the first numRows of Pascal’s triangle.
LeetCode 122. Best Time to Buy and Sell Stock II
LeetCode 122. Best Time to Buy and Sell Stock II
Description:
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 many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
LeetCode 26.Remove Duplicates from Sorted Array
LeetCode 26.Remove Duplicates from Sorted Array
Description:
Given a sorted array, remove the duplicates in-place such that each element appear only once and return the new length.
Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
LeetCode 189.Rotate Array
LeetCode 189.Rotate Array
Description:
Rotate an array of n elements to the right by k steps.
For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].