30. Substring With Concatenation Of All Words
Substring With Concatenation Of All Words
Substring With Concatenation Of All Words
Sequential Digits
Check If A String Contains All Binary Strings Of Size K
Minimum Number Of Removals To Balance An Array
Number Of Substrings With Only Ones
Count The Number Of Substrings With Dominant Ones
Find X Sum Of All K Long Subarrays 2
Find X Sum Of All K Long Subarrays 1
Minimum Time To Make Rope Colorful
Adjacent Increasing Subarrays Detection 2
Adjacent Increasing Subarrays Detection 1
Fruit Into Baskets
Longest Subarray With Maximum Bitwise And
Maxiumum Erasure Value
Count Subarrays Where Max Element Appears Atleast K Times
Count Subarrays Of Length Three With Condition
Longest Subarray After Deleting One Element
Max Consecutive Ones 3
Frequency Of Most Frequent Element
Number Of Substrings Containing All 3 Characters
Subarrays With K Different Integers
Minimum Number Of Flips To Make Binary String Alternating
Min Difference Between Highest And Lowest Of K Scores
Min Window Substring
Google’s - Sliding Window Maximum
Meta’s - Repeated DNA Sequences
Google’s - Best Time To Buy And Sell Stock
Google’s - Longest Repeating Substring With Replacement
Amazon’s - Minimum Size Subarray
Amazon’s - Number Of Sub Arrays Of Size K And Average Greater Than Or Equal To Threshold
Meta’s - Contains Duplicates 2
Meta’s - Longest Substring Without Repeating Chars