Yahoo India Web Search

Search results

1. www.geeksforgeeks.org › find-the-smallest-windowSmallest window in a String containing all characters of ...

   www.geeksforgeeks.org › find-the-smallest-window

   • Cached

   Mar 4, 2024 · Learn how to find the smallest substring in a string that contains all characters of another string. See examples, code, and time complexity analysis for C++, Java, Python, and C#.

   • Minimum Window Subsequence | Practice | GeeksforGeeks

     Given strings str1 and str2, find the minimum (contiguous)...

   • Smallest window in a string containing all the characters of ...

     Smallest window in a string containing all the characters of...

2. www.geeksforgeeks.org › problems › minimum-windowMinimum Window Subsequence | Practice | GeeksforGeeks

   www.geeksforgeeks.org › problems › minimum-window

   • Cached

   Given strings str1 and str2, find the minimum (contiguous) substring W of str1, so that str2 is a subsequence of W. If there is no such window in str1 that covers all characters in str2, return the empty string "".

3. www.geeksforgeeks.org › problems › smallest-windowSmallest window in a string containing all the characters of ...

   www.geeksforgeeks.org › problems › smallest-window

   • Cached

   Smallest window in a string containing all the characters of another string. Difficulty: Hard Accuracy: 30.19% Submissions: 134K+ Points: 8. Given two strings S and P. Find the smallest window in the string S consisting of all the characters (including duplicates) of the string P. Return "-1" in case there is no such window present.

4. leetcode.com › problems › minimum-window-substringMinimum Window Substring - LeetCode

   leetcode.com › problems › minimum-window-substring

   Find the smallest substring of s that contains all characters of t. Learn the solution, constraints, and follow up question for this hard problem.

5. walkccc.me › LeetCode › problems76. Minimum Window Substring - LeetCode Solutions

   walkccc.me › LeetCode › problems

   • Cached

   class Solution { public: string minWindow(string s, string t) { vector<int> count(128); int required = t.length(); int bestLeft = -1; int minLength = s.length() + 1; for (const char c : t) ++count[c]; for (int l = 0, r = 0; r < s.length(); ++r) { if (--count[s[r]] >= 0) --required; while (required == 0) { if (r - l + 1 < minLength) { bestLeft = ...

6. medium.com › @stheodorejohn › finding-the-minimumFinding the Minimum Window Substring! — ... - Medium

   medium.com › @stheodorejohn › finding-the-minimum

   • Cached

   Jul 31, 2023 · To find the minimum window substring, we utilize a sliding window technique. We start with two pointers, left and right, that define the window boundaries. We expand the window by moving the...

7. People also ask

   What is a minimum window substring?

   • Minimum Window Substring - Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "". The testcases will be generated such that the answer is unique.

   Minimum Window Substring - LeetCode

   leetcode.com/problems/minimum-window-substring/

   See all results for this question

   Which string is the minimum window?

   • Explanation: The entire string s is the minimum window. Output: "" Explanation: Both 'a's from t must be included in the window. Since the largest window of s only has one 'a', return empty string. s and t consist of uppercase and lowercase English letters. Follow up: Could you find an algorithm that runs in O(m + n) time?

   Minimum Window Substring - LeetCode

   leetcode.com/problems/minimum-window-substring/

   See all results for this question

   What is the minimum window substring of adobecodebanc?

   • Example 1: Input: s = "ADOBECODEBANC", t = "ABC" Output: "BANC" Explanation: The minimum window substring "BANC" includes 'A', 'B', and 'C' from string t. Example 2: Input: s = "a", t = "a" Output: "a" Explanation: The entire string s is the minimum window.

   Minimum Window Substring - LeetCode

   leetcode.com/problems/minimum-window-substring/

   See all results for this question

8. algo.monster › liteproblems › 727727. Minimum Window Subsequence - In-Depth Explanation

   algo.monster › liteproblems › 727

   • Cached

   In-depth solution and explanation for LeetCode 727. Minimum Window Subsequence in Python, Java, C++ and more. Intuitions, example walk through, and complexity analysis. Better than official and forum solutions.