LeetCode 45: Jump Game II
Problem DescriptionYou 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
Good LeetCode Problems
The post maintains a list of leetcode problems that deserve a second try after some time but are less tricky so we do not provide the solution here.43. Multiple Strings44. Wildcard Matching49. Group A
LeetCode 42: Trapping Rain Water
Problem DescriptionGiven n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.Example 1Input: height = [0,1,0,2,1,0,
LeetCode 35: Search Insert Position
Problem DescriptionGiven a sorted array of distinct integers 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 mu
LeetCode 33 + 81: Search in Rotated Sorted Array (II)
Problem DescriptionP33There is an integer array nums sorted in ascending order (with distinct values).Prior to being passed to your function, nums is possibly rotated at an unknown pivot index k (1 &l
LeetCode 32: Longest Valid Parentheses
Problem DescriptionGiven a string containing just the characters '(' and ')', return the length of the longest valid (well-formed) parentheses substring.Example 1Input: s = "(()" Output: 2 E
LeetCode 31: Next Permutation
Problem DescriptionA permutation of an array of integers is an arrangement of its members into a sequence or linear order.For example, for arr = [1,2,3], the following are all the permutations of arr:
LeetCode 30: Substring with Concatenation of All Words
Problem DescriptionYou are given a string s and an array of strings words. All the strings of words are of the same length.A concatenated substring in s is a substring that contains all the strings of
LeetCode 29: Divide Two Integers
Problem DescriptionGiven two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator.The integer division should truncate toward zero, which means l
LeetCode 25: Reverse Nodes in k-Group
Problem DescriptionGiven the head of a linked list, reverse the nodes of the list k at a time, and return the modified list.k is a positive integer and is less than or equal to the length of the linke