Flipkart

Implement a Trie (Prefix Tree) supporting insert, search, and prefix matching operations for a dynamic dictionary of words. Given a non-negative integer represented as a linked list, reverse the list in groups of k nodes and return the modified list. Find the minimum eating speed to finish all piles of bananas within h hours using binary search on answer space.