Constraints on length?

Please log in or register to answer this question.

Related questions

what are the constraints?

For a string s and an integer k , a selection of substrings is valid if the following conditions are met : The length of every substring is greater than or equal to k. Each substring is a palindrome. No two substrings overlap.

Given a binary String s (max length 10^6)containing 0 and 1 ,and queries array (max length 10^6) containg integers. Return an array ,each index having sum of all 1's in all window sizes of query[i] .

Given a string , remove at most two substrings from the string such that the remaining part of string contains only vowels. The resulting string should have maximum length possible.

Need help - Career length of a developer

Constraints on length?

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Categories