Longest Substring Without Repeating Characters LeetCode Solution
Given a string s, find the length of the longest substring without repeating characters.
Longest Substring Without Repeating Characters LeetCode Solution Read More »
Leetcode SolutionGiven a string s, find the length of the longest substring without repeating characters.
Longest Substring Without Repeating Characters LeetCode Solution Read More »
Leetcode SolutionThe string PAYPALISHIRING is written in a zigzag pattern on a given number of rows like read line by line: “PAHNAPLSIIGYIR”.
Zigzag Conversion LeetCode Solution Read More »
Leetcode SolutionGiven a string s, return the longest palindromic substring in s. A palindrome is a string which reads the same in both directions. For example, S = “aba” is a palindrome, S = “abc” is not.
Longest Palindromic Substring LeetCode Solution Read More »
Leetcode SolutionGiven a string s which represents an expression, evaluate this expression and return its value. The integer division should truncate toward zero.
Basic Calculator II LeetCode Solution Read More »
Leetcode SolutionGiven an array of strings words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully justified.
Text Justification LeetCode Solution Read More »
Leetcode SolutionGiven a string s containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[‘ and ‘]’, determine if the input string is valid.
Valid Parentheses LeetCode Solution Read More »
Leetcode SolutionGiven an input string s and a pattern p, implement regular expression matching with support for ‘.’ and ‘*’ where ‘.’ Matches any single character and ‘*’ Matches zero or more of the preceding element.
Regular Expression Matching LeetCode Solution Read More »
Leetcode SolutionGiven two strings needle and haystack, return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
Find the Index of the First Occurrence in a String 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 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 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 SolutionGiven 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 SolutionGiven an array of strings strs, group the anagrams together. You can return the answer in any order.
Group Anagrams LeetCode Solution Read More »
Leetcode Solution