DSA Level 2 Data Structures Hashmap and Heaps Smallest Substring Of A String Containing All Characters Of Another String

Smallest Substring Of A String Containing All Characters Of Another String

hard

Hashmap and Heaps

Question Solve Solutions

1. You are given two strings s1 and s2 containing lowercase english alphabets.
2. You have to find the smallest substring of s1 that contains all the characters of s2.
3. If no such substring exists, print blank string("").

Input Format

Two strings s1 and s2

Output Format

A string

Constraints

1 <= length of string s1 and s2 <= 10000

Example

Input

timetopractice
toc

Output

toprac

Count Of All Subarrays With Zero Sum

Smallest Substring Of A String Containing All Unique Characters Of Itself

Related Questions

easy Double Pair Array easy Subdomain Visit Count easy Group Anagrams easy Isomorphic Strings easy Valid Anagram easy Longest Subarray With Sum Divisible By K easy The Skyline Problem easy Word Pattern easy Number Of Employees Under Every Manager easy Find Itinerary From Tickets easy Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K easy Largest Subarray With Zero Sum easy Count Distinct Elements In Every Window Of Size K easy Largest Subarray With Contiguous Elements medium Count Of All Subarrays With Zero Sum medium Smallest Substring Of A String Containing All Unique Characters Of Itself