.NET C# questions: reference vs value types, GC, parallelism, locking, WPF, binding mode etc.
A couple of algorithm-related questions
E.g.
User-story: write a function that checks whether I can draft a letter using a series of pre-existing words
Hint: no need to consider redundancy, combinations or permutations (yup real easy)
Give the related time complexity
- Average?
- Worst-case?
private Boolean CanWriteLetter(List<String> letterWords, List<String> paperWords)
{
// Fill the blank
}
If there is say a limitation on the capacity of letterWords and paperWords, how to make it work?