Leetcode Solution

LeetCode is the best platform to help you enhance your skills, expand your knowledge and prepare for technical interviews.

Here, List of all LeetCode Solution : See Leetcode Solution

Wildcard Matching LeetCode Solution

Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for ‘?’ and ‘*’ where: ‘?’ Matches any single character.’*’ Matches any sequence of characters (including the empty sequence).The matching should cover the entire input string.

Wildcard Matching LeetCode Solution Read More »

Leetcode Solution

Jump Game II LeetCode Solution

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 Solution
Scroll to Top