LeetCode 681. Next Closest Time
Description https://leetcode.com/problems/next-closest-time/ Given a time represented in the format “HH:MM”, form the next closest time by reusing the current digits.…
Category: String
LeetCode 159. Longest Substring with At Most Two Distinct Characters
Description https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/ Given a string s , find the length of the longest substring t that contains at most 2 distinct characters. Example 1: Input: “eceba”…
LeetCode 43. Multiply Strings
Description https://leetcode.com/problems/multiply-strings/ Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string. Note: You must not…
LeetCode 929. Unique Email Addresses
Description https://leetcode.com/problems/unique-email-addresses/ Every email consists of a local name and a domain name, separated by the @ sign. For example,…
LeetCode 49. Group Anagrams
Description https://leetcode.com/problems/group-anagrams/ Given an array of strings, group anagrams together. Example: Input: [“eat”, “tea”, “tan”, “ate”, “nat”, “bat”], Output: […
LeetCode 38. Count and Say
Description https://leetcode.com/problems/count-and-say/ The count-and-say sequence is a sequence of digit strings defined by the recursive formula: countAndSay(1) = “1” countAndSay(n) is the way…
LeetCode 242. Valid Anagram
Description https://leetcode.com/problems/valid-anagram/ Given two strings s and t , write a function to determine if t is an anagram of s. Example 1: Input: s = “anagram”,…
LeetCode 125. Valid Palindrome
Description https://leetcode.com/problems/valid-palindrome/ Given a string s, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. Example 1:…
LeetCode 344. Reverse String
Description https://leetcode.com/problems/reverse-string/ Write a function that reverses a string. The input string is given as an array of characters char[]. Do…
LeetCode 387. First Unique Character in a String
Description Given a string, find the first non-repeating character in it and return it’s index. If it doesn’t exist, return…