Halloween SalePremium questions, over 30% offUnlock all premium questions for over 30% off
Shortest Substring with Alphabet
Medium
FREE
This is a popular twist Meta interviewers often put on the classic leetcode problem to find a minimum window substring.
Given an input string and an alphabet (set of characters), find the shortest substring of the input that contains all characters from the alphabet at least once. ...
Asked at:Meta
More Meta interview questions
- Minimum Board Length for Holesmedium
- Split Array with Equal Totalseasy
- Word Pattern Matchingeasy
- Phone Keypad Letter Combinationmedium
- Find Shortest Distinct Prefixmedium
- Build Longest Concatenated Palindromehard
- Minimum Coins to Cover All Amountsmedium
- Find Median In Large Unsorted Arraymedium
OfferRetriever
Master technical interviews with real questions from top companies. Build your confidence and career.
LEGAL
© 2026 Purple Business Holdings LLC. All rights reserved. See Terms of Service.