https://leetcode.com/problems/jump-game-ii/description/?envType=study-plan-v2&envId=top-interview-150
class Solution {
public:
int jump(vector<int>& nums) {
int n = nums.
https://leetcode.com/problems/jump-game/?envType=study-plan-v2&envId=top-interview-150
class Solution {
public:
bool canJump(vector<int>& nums) {
int mx = 0;
for
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/description/?envType=study-plan-v2&envId=top-interview-150
class Solution {
public:
int maxProfit(vector<int>& prices) {
int state1 = 0;
https://leetcode.com/problems/best-time-to-buy-and-sell-stock/?envType=study-plan-v2&envId=top-interview-150
class Solution {
public:
int maxProfit(vector<int>& prices) {
int ans = 0;
int
https://leetcode.com/problems/rotate-array/description/?envType=study-plan-v2&envId=top-interview-150
class Solution {
public:
void rotate(vector<int>& nums, int k) {
int