Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). Example: Input: S = "ADOBECODEBANC", T = "ABC" Output: "BANC" I found interesting non-standard approach using just one pointer, which can solve that problem in…

Problem Given a non-empty string S and a dictionary wordDict containing a list of non-empty words, determine if S can be segmented into a space-separated sequence of one or more dictionary words. Note: The same word in the dictionary may be reused multiple times in the segmentation. You may assume the…