Theory of Programming

Trie Tree Practise – SPOJ – DICT

Posted on September 1, 2015December 24, 2016

Hello people..! In this post we will talk about solving another competitive programming question based on trie tree. I will take up the SPOJ problem – DICT. This is a little harder than the previous trie tree practise problem, PHONELST. Now, read the problem statement carefully a couple of times. Just so that you don’t […]

Competitive Coding

Trie Tree Practise – SPOJ – PHONELST

Posted on August 24, 2015December 24, 2016

Hello people..! In this post I will show you how to get started with solving Trie Tree based questions in competitive programming. Learning a data structure is different from solving competitive coding questions based on that data structure. In this post, I take up a very simple question so that your confidence is boosted. We […]