Is there any exert who can guide these 3 types of questions?
1] Suggest efficient/appropriate data structures for a given problem
[generally 4-5-6 line real life problem]
2] For Building a Spell Checker which DS suits most?
[Hash table, Trie, digital trees, AVL Trees, Red-Black Trees, Suffix Tree, Burst trie & Skip Lists]
3] Selection of Best Sorting Algorithm for a Particular problem