Max of All Subarrays of Size k Using Max Heap in C++
This problem, also referred to as the “sliding window maximum” problem, can be efficiently solved using heaps. We’ve already discussed an O(n) solution.
Tag: Leetcode
Is Subsequence – LeetCode Solution [Easy]
Given two strings s and t, return true if s is a subsequence of t, or false otherwise.