InterviewSolution
Saved Bookmarks
| 1. |
Given two strings string1 and string2, find the smallest substring in string1 containing all characters of string2 efficiently. |
| Answer» LENGTH of STRING1 * length of string2Explanation: DYNAMIC PROGRAMMING O(m*N) | |