LeetCode Solution

Longest Common Sequence Leetcode

by

We are going to solve a Hard coding Problem longest common sequence leetcode. LeetCode Link of the Problem is HERE. It is one of the most difficult sequence finding tasks on leetcode. We have tried to Solve this in Python3. Question Given two strings text1 and text2, you have to return the length of their longest common subsequence leetcode. If there … Read more

Container With Most Water – LeetCode Solutions

by

LeetCode has a Medium coding Problem in Its’ Algorithm Section “Container With Most Water”. Today We are going to solve this problem in Python. LeetCode Link of the Problem is HERE Question You are given an integer array height of length n. There are n vertical lines are drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find … Read more

Letter Combinations of a Phone Number – LeetCode Solutions

by

LeetCode has a Medium coding Problem in Its’ Algorithm Section “Letter Combinations of a Phone Number”. Today We are going to solve this problem in Python. LeetCode Link of the Problem is HERE Question Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order. … Read more

Pow(x n) LeetCode – Python Solutions

by

LeetCode has a Medium coding Problem in Its’ Algorithm Section “Pow(x n) LeetCode”. Today We are going to solve this problem in Python. LeetCode Link of the Problem is HERE Question Implement pow(x, n), which calculates x raised to the power n (i.e., xn). Examples Input: x = 2.00000, n = 10 Output: 1024.00000 Input: x = 2.10000, n = 3 … Read more

Group Anagrams LeetCode – Python Solutions

by

LeetCode has a Medium coding Problem in Its’ Algorithm Section “Group Anagrams LeetCode”. Today We are going to solve this problem in Python. LeetCode Link of the Problem is HERE Question Given an array of strings strs, group the anagrams together. You can return the answer in any order. An Anagram is a word or phrase formed by rearranging the letters … Read more

Rotate Image LeetCode – Python Solution

by

LeetCode has a Medium coding Problem in Its’ Algorithm Section “Rotate Image LeetCode”. Today We are going to solve this problem in Python. LeetCode Link of the Problem is HERE Question You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise). You have to rotate the image in place, which means you have … Read more

Permutations 2 LeetCode – Python Solution

by

LeetCode has a Medium coding Problem in Its’ Algorithm Section “Permutations 2 LeetCode”. Today We are going to solve this problem in Python. LeetCode Link of the Problem is HERE Questions Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order. Examples Input: nums = [1,1,2]Output:[[1,1,2],[1,2,1],[2,1,1]] Input: nums = [1,2,3]Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]] … Read more

Permutations LeetCode Python

by

LeetCode has a Medium coding Problem in Its’ Algorithm Section “Permutations LeetCode Python”. Today We are going to solve this problem in Python. LeetCode Link of the Problem is HERE Question Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order. Examples Input: nums = [1,2,3]Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]] Input: nums … Read more

Maximum Subarray LeetCode Python – Solution

by

LeetCode has an Easy coding Problem in Its’ Algorithm Section “Maximum Subarray LeetCode Python”. Today We are going to solve this problem in Python. LeetCode Link of the Problem is HERE Question Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. A subarray is a contiguous part of … Read more

Jump Game II LeetCode – Python Solutions.

by

LeetCode has a Medium coding Problem in Its’ Algorithm Section “Jump Game II”. Today We are going to solve this problem in Python. LeetCode Link of the Problem is HERE Question Given an array of non-negative integers nums, you are initially positioned at the first index of the array. Each element in the array represents your … Read more