Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator. Return the quotient after dividing dividend by divisor.
Divide Two Integers LeetCode Solution Read More »
Leetcode SolutionYou are given a string s and an array of strings words. All the strings of words are of the same length. Return the starting indices of all the concatenated substrings in s. You can return the answer in any order.
Substring with Concatenation of All Words LeetCode Solution Read More »
Leetcode SolutionGiven an array of integers nums, find the next permutation of nums.
Next Permutation LeetCode Solution Read More »
Leetcode SolutionGiven the array nums after the possible rotation and an integer target, return the index of target if it is in nums, or -1 if it is not in nums.
Search in Rotated Sorted Array LeetCode Solution Read More »
Leetcode SolutionWrite a program to solve a Sudoku puzzle by filling the empty cells.
Sudoku Solver LeetCode Solution Read More »
Leetcode SolutionGiven 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.
Largest Rectangle in Histogram LeetCode Solution Read More »
Leetcode SolutionGiven 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.
Search Insert Position LeetCode Solution Read More »
Leetcode SolutionGiven an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.
Permutations LeetCode Solution Read More »
Leetcode SolutionGiven a string containing just the characters ‘(‘ and ‘)’, return the length of the longest valid (well-formed) parentheses substring.
Longest Valid Parentheses LeetCode Solution Read More »
Leetcode SolutionGiven 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.
Swap Nodes in Pairs LeetCode Solution Read More »
Leetcode SolutionGiven 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.
Combination Sum LeetCode Solution Read More »
Leetcode SolutionGiven 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 II LeetCode Solution Read More »
Leetcode SolutionGiven an unsorted integer array nums, return the smallest missing positive integer.
First Missing Positive LeetCode Solution Read More »
Leetcode SolutionGiven 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.
Trapping Rain Water LeetCode Solution Read More »
Leetcode SolutionGiven two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string.
Multiply Strings LeetCode Solution Read More »
Leetcode Solution