ALGORITHMS

Bipartite Graph Check is quite easy and can be implemented using BFS or DFS. I am assuming you already know what is Bipartite Graph. There is one critical case that comes in my mind right now is following one:

Now I will show a DFS based implemention of bipartite check. You might already know...

Continue reading...

Trie is one of my favourite data structures because its easy understand application of Trie and easy to implement as well. In case you don't know Trie comes from the word Retrieval because Trie can retrieve several words given prefix of the word. One most common usage of Trie that comes in mind...

Continue reading...