See things in action
Introduction Trie is an n-ary tree data structure, which is also known as a prefix tree. This name came into existence from the term ‘Information retrieval‘, indeed this data structure tries to achieve faster lookup for a given word from a set of words dictionary. However it is fairly different from the binary search tree,…
Problem Given K sorted arrays write an efficient algorithm to merge them into one. Example Given the below sorted array where K = 3 k1 : 4 5 6 k2 : 1 2 3 k3 : 8 9 10 output sorted list : 1 2 3 4 5 6 8 9 10 Constraints [1] 1…
Problem Given an absolute path of the directory that may contain special symbols like .(Current directory), ..(Patent directory) & actual directory name. Write an effecient algorithm to get the actual path where the cd will land. Example Input: /com/./../working/../example/./interview output: /example/interview [1] . Will keep us in the current direction [2] .. Will take the…
Introduction I’m sure most of you have seen/used the last watched history feature of youtube. But ever wondered how it must be working internally? Well I am also curious about this to decipher how it really works so effortlessly. Before we dive into the discussion I have divided this blog into two parts where in…