594 - Longest Harmonious Subsequence
Problem Description
Problem Description
You are given a 0-indexed array of integers nums of length n. You are initially positioned at index 0.
Given an array of positive integers nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal to target....
Given a string s and an integer k, return the length of the longest substring of s that contains at most k distinct characters. ``` EX) Input: s = “eceba”, k...
Given a string s, find the length of the longest substring without duplicate characters. ``` EX) Input: s = “eceba”, k = 2 Output: 3 Explanation: The substri...