Problem of The Day: Maximum Length of a Concatenated String with Unique Characters
Problem Statement ``` You are given an array of strings arr. A string s is formed by the concatenation of a subsequence of arr that has unique characters.
Recent posts
Problem of The Day: LRU Cache
Problem Statement ``` Design a data structure that follows the constraints of a Least Recently Used (LRU) cache.
Problem of The Day: Set Mismatch
Problem Statement ``` You have a set of integers s, which originally contains all the numbers from 1 to n. Unfortunately, due to some error, one of the numbe...
Problem of The Day: Redistribute Characters to Make All Strings Equal
Problem Statement ``` You are given an array of strings words (0-indexed).
Problem of The Day: Largest Substring Between Two Equal Characters
Problem Statement ``` Given a string s, return the length of the longest substring between two equal characters, excluding the two characters. If there is no...