You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
|121|[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/)|[Java](https://github.com/guobinhit/myleetcode/blob/master/codes/java/leetcodes/src/main/java/com/hit/basmath/interview/top_interview_questions/easy_collection/dynamic_programming/_121.java) & [Go](../master/codes/go/leetcodes/interview/easy_collection/121.go) |Easy| Dynamic Programming
905
-
|122|[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii)|[Java](https://github.com/guobinhit/myleetcode/blob/master/codes/java/leetcodes/src/main/java/com/hit/basmath/interview/top_interview_questions/easy_collection/array/_122.java) & Python|Easy| Array
905
+
|122|[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii)|[Java](https://github.com/guobinhit/myleetcode/blob/master/codes/java/leetcodes/src/main/java/com/hit/basmath/interview/top_interview_questions/easy_collection/array/_122.java) & [Go](../master/codes/go/leetcodes/interview/easy_collection/122.go)|Easy| Array
|141|[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)|[Java](https://github.com/guobinhit/myleetcode/blob/master/codes/java/leetcodes/src/main/java/com/hit/basmath/learn/linked_list/_141.java) & [Go](../master/codes/go/leetcodes/interview/easy_collection/141.go)|Easy| Linked List
@@ -913,15 +913,15 @@ You can also ask for problem solving ideas and discuss in GitHub issues directly
|234|[Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/description/)|[Java](https://github.com/guobinhit/myleetcode/blob/master/codes/java/leetcodes/src/main/java/com/hit/basmath/learn/linked_list/_234.java) & Python|Easy| Linked List
918
-
|237|[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/description/)|[Java](https://github.com/guobinhit/myleetcode/blob/master/codes/java/leetcodes/src/main/java/com/hit/basmath/interview/top_interview_questions/easy_collection/linked_list/_237.java) & Python |Easy| Linked List
|234|[Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/description/)|[Java](https://github.com/guobinhit/myleetcode/blob/master/codes/java/leetcodes/src/main/java/com/hit/basmath/learn/linked_list/_234.java) & [Go](../master/codes/go/leetcodes/interview/easy_collection/234.go)|Easy| Linked List
918
+
|237|[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/description/)|[Java](https://github.com/guobinhit/myleetcode/blob/master/codes/java/leetcodes/src/main/java/com/hit/basmath/interview/top_interview_questions/easy_collection/linked_list/_237.java) & [Go](../master/codes/go/leetcodes/interview/easy_collection/237.go) |Easy| Linked List
|278|[First Bad Version](https://leetcode.com/problems/first-bad-version/description/)|[Java](https://github.com/guobinhit/myleetcode/blob/master/codes/java/leetcodes/src/main/java/com/hit/basmath/learn/binary_search/_278.java) & [Python](https://github.com/guobinhit/myleetcode/blob/master/codes/python/leetcodes/src/main/python/com/hit/basmath/learn/binary_search/_278.py)|Easy| Sorting and Searching
|326|[Power of Three](https://leetcode.com/problems/power-of-three/description/)|[Java](https://github.com/guobinhit/myleetcode/blob/master/codes/java/leetcodes/src/main/java/com/hit/basmath/interview/top_interview_questions/easy_collection/math/_326.java) & Python |Easy| Math
|350|[Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/description/)|[Java](https://github.com/guobinhit/myleetcode/blob/master/codes/java/leetcodes/src/main/java/com/hit/basmath/learn/binary_search/_350.java) & Python |Easy| Array
926
926
|384|[Shuffle an Array](https://leetcode.com/problems/shuffle-an-array/description/)|[Java](https://github.com/guobinhit/myleetcode/blob/master/codes/java/leetcodes/src/main/java/com/hit/basmath/interview/top_interview_questions/easy_collection/design/_384.java) & Python |Medium| Design
927
927
|387|[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/description/)|[Java](https://github.com/guobinhit/myleetcode/blob/master/codes/java/leetcodes/src/main/java/com/hit/basmath/learn/hash_table/_387.java) & Python |Easy| Strings
* Say you have an array for which the ith element is the price of a given stock on day i.
7
+
* <p>
8
+
* Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times).
9
+
* <p>
10
+
* Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).
11
+
* <p>
12
+
* Example 1:
13
+
* <p>
14
+
* Input: [7,1,5,3,6,4]
15
+
* Output: 7
16
+
* <p>
17
+
* Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.
18
+
* Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.
19
+
* <p>
20
+
* Example 2:
21
+
* <p>
22
+
* Input: [1,2,3,4,5]
23
+
* Output: 4
24
+
* <p>
25
+
* Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
26
+
* Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are
27
+
* engaging multiple transactions at the same time. You must sell before buying again.
28
+
* <p>
29
+
* Example 3:
30
+
* <p>
31
+
* Input: [7,6,4,3,1]
32
+
* Output: 0
33
+
* <p>
34
+
* Explanation: In this case, no transaction is done, i.e. max profit = 0.
* You are given an n x n 2D matrix representing an image.
7
+
* <p>
8
+
* Rotate the image by 90 degrees (clockwise).
9
+
* <p>
10
+
* Note:
11
+
* <p>
12
+
* You have to rotate the image in-place, which means you have to modify the input 2D matrix directly. DO NOT allocate another 2D matrix and do the rotation.
13
+
* <p>
14
+
* Example 1:
15
+
* <p>
16
+
* Given input matrix =
17
+
* <p>
18
+
* [
19
+
* [1,2,3],
20
+
* [4,5,6],
21
+
* [7,8,9]
22
+
* ],
23
+
* <p>
24
+
* rotate the input matrix in-place such that it becomes:
25
+
* <p>
26
+
* [
27
+
* [7,4,1],
28
+
* [8,5,2],
29
+
* [9,6,3]
30
+
* ]
31
+
* <p>
32
+
* Example 2:
33
+
* <p>
34
+
* Given input matrix =
35
+
* <p>
36
+
* [
37
+
* [ 5, 1, 9,11],
38
+
* [ 2, 4, 8,10],
39
+
* [13, 3, 6, 7],
40
+
* [15,14,12,16]
41
+
* ],
42
+
* <p>
43
+
* rotate the input matrix in-place such that it becomes:
0 commit comments