// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// canJump
//
// 55. Jump Game
// You are given an integer array nums. You are initially positioned at the array's

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// maxProfitII
// 
// 122. Best Time to Buy and Sell Stock II
// 
// You are given an integer array prices where prices[i] is the price of a given stock on the ith day.
// 
// On each day,

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// maxProfit
//
// 121. Best Time to Buy and Sell Stock
// You are given an array prices where prices[i] is the price of a given stock on the ith day.
//
// You want to maximize your profit

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// rotate
//
// 189. Rotate Array
//
// Given an integer array nums, rotate the array to the right by k steps, where k is non-negative.
//
// Example 1:
//
// Input: nums = [1,2,3,4,5,6,7], k = 3
// Output: [5,6,7,1,2,3,4]

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// majorityElement
//
// 169. Majority Element
// Given an array nums of size n, return the majority element.
//
// The majority element is the element that appears

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// removeDuplicates
//
// 80. Remove Duplicates from Sorted Array II
// Given an integer array nums sorted in non-decreasing order, remove some duplicates in-place such that each unique element appears

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// removeDuplicates
//
// 26. Remove Duplicates from Sorted Array
// Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element

// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
package topInterview
 
// removeElement
// 27. Remove element
// Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The order of the elements may be changed. Then return the number of elements in nums which are not equal to val.
//
// Consider the number of elements in nums which are not equal to val be k, to get accepted, you need to do the following

package topInterview
 
// [url]https://leetcode.com/studyplan/top-interview-150/[/url]
 
// merge problem
//
// 88. Merge Sorted Array
//
// You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n,
// representing the number of elements in nums1 and nums2 respectively.
//
// Merge nums1 and nums2 into a single array sorted in non-decreasing order.
// The final sorted array should