These are the heap and trie problems every placement candidate should be able to solve, from checking a heap to finding words in a grid. Pick the structure first: a heap, two heaps or a trie. Trace a small input on paper, then check your program against every test.
