You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0]. Each element nums[i] represents the maximum length of a forward jump from index i. In other words, if you are at nums[i], you can jump to any nums[i + j] where: 0 <= j <= nums[i] and i + j < n. Return the minimum number of jumps to reach nums[n - 1].
Jump Game II LeetCode Solution Read More »
Leetcode SolutionGiven a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order.
Permutations II LeetCode Solution Read More »
Leetcode SolutionYou are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise).
Rotate Image LeetCode Solution Read More »
Leetcode SolutionGiven an array of strings strs, group the anagrams together. You can return the answer in any order.
Group Anagrams LeetCode Solution Read More »
Leetcode SolutionImplement pow(x, n), which calculates x raised to the power n.
Pow(x n) LeetCode Solution Read More »
Leetcode SolutionDesign a stack that supports push, pop, top, and retrieving the minimum element in constant time.
Min Stack LeetCode Solution Read More »
Leetcode SolutionGiven an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. If target is not found in the array, return [-1, -1].
Find First and Last Position of Element in Sorted Array LeetCode Solution Read More »
Leetcode Solution