Python Solution Archives - TO THE INNOVATION

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].

Wildcard Matching LeetCode Solution

Leetcode Solution / Backtracking, C++ Solution, dynamic programming, Facebook, Google, Greedy, Hard, Java Solution, JavaScript Solution, LeetCode Solution, Python Solution, recursion, Snapchat, String, Twitter, Twosigma

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.

Multiply Strings LeetCode Solution

Leetcode Solution / C++ Solution, Facebook, Java Solution, JavaScript Solution, LeetCode Solution, Math, Medium, Python Solution, String, Twitter

Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string.

Trapping Rain Water LeetCode Solution

Leetcode Solution / Amazon, Apple, Array, Bloomberg, C++ Solution, dynamic programming, Google, Hard, Java Solution, JavaScript Solution, LeetCode Solution, Python Solution, Stack, Twitter, Two Pointers, Zenefits

Given 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.

First Missing Positive LeetCode Solution

Leetcode Solution / Array, C++ Solution, Hard, Hash Table, Java Solution, JavaScript Solution, LeetCode Solution, Python Solution

Given an unsorted integer array nums, return the smallest missing positive integer.

Combination Sum II LeetCode Solution

Leetcode Solution / Array, Backtracking, C++ Solution, Java Solution, JavaScript Solution, LeetCode Solution, Medium, Python Solution, Snapchat

Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sum to target.

Combination Sum LeetCode Solution

Leetcode Solution / Array, Backtracking, C++ Solution, Java Solution, JavaScript Solution, LeetCode Solution, Medium, Python Solution, Snapchat, Uber

Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target. You may return the combinations in any order.

Swap Nodes in Pairs LeetCode Solution

Leetcode Solution / Bloomberg, C++ Solution, Java Solution, JavaScript Solution, LeetCode Solution, Linked List, Microsoft, Python Solution, recursion, Uber

Given a linked list, swap every two adjacent nodes and return its head. You must solve the problem without modifying the values in the list’s nodes.

Longest Valid Parentheses LeetCode Solution

Leetcode Solution / C++ Solution, dynamic programming, Hard, Java Solution, JavaScript Solution, LeetCode Solution, Python Solution, Stack, String

Given a string containing just the characters ‘(‘ and ‘)’, return the length of the longest valid (well-formed) parentheses substring.

Permutations LeetCode Solution

Leetcode Solution / Array, Backtracking, C++ Solution, Java Solution, JavaScript Solution, LeetCode Solution, Linkedin, Medium, Microsoft, Python Solution

Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.

Largest Rectangle in Histogram LeetCode Solution

Leetcode Solution / Array, C++ Solution, Hard, Java Solution, JavaScript Solution, LeetCode Solution, Python Solution, Stack

Given an array of integers heights representing the histogram’s bar height where the width of each bar is 1, return the area of the largest rectangle in the histogram.