Group Anagrams LeetCode Solution
Given an array of strings strs, group the anagrams together. You can return the answer in any order.
String
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.
Multiply Strings LeetCode Solution
Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string.
Longest Valid Parentheses LeetCode Solution
Given a string containing just the characters ‘(‘ and ‘)’, return the length of the longest valid (well-formed) parentheses substring.
Substring with Concatenation of All Words LeetCode Solution
You 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.
Find the Index of the First Occurrence in a String LeetCode Solution
Given 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.
Regular Expression Matching LeetCode Solution
Given 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.
Valid Parentheses LeetCode Solution
Given a string s containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[‘ and ‘]’, determine if the input string is valid.
Text Justification LeetCode Solution
Given an array of strings words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully justified.
Basic Calculator II LeetCode Solution
Given a string s which represents an expression, evaluate this expression and return its value. The integer division should truncate toward zero.
Longest Palindromic Substring LeetCode Solution
Given 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.
Zigzag Conversion LeetCode Solution
The string PAYPALISHIRING is written in a zigzag pattern on a given number of rows like read line by line: “PAHNAPLSIIGYIR”.
Longest Substring Without Repeating Characters LeetCode Solution
Given a string s, find the length of the longest substring without repeating characters.