This post provides an overview of some of the available techniques to implement a linked list in C++ programming language.
Implement Quicksort efficiently for inputs containing many repeated elements.
In this article, we will implement Ternary Search algorithm and compare its performance with Binary Search.
In this post, we will see how to implement a Multiset in Java.
In this post, we will see how to implement a Multimap in Java.
In this post, we will implement KMP Algorithm in C, C++ and Java programming language.
In this post, we will see how to implement our own Triplet class in Java using Pair class provided by many Java third-party libraries.
In this post, we will see how to implement our own Pair Class in Java.
The longest common subsequence (LCS) problem is the problem of finding the longest subsequence that is present in given two sequences in the same order. i.e. find a longest sequence which can be obtained from the first original sequence by deleting some items, and from the second original sequence by deleting other items.
Huffman Coding (also known as Huffman Encoding) is a algorithm for doing data compression and it forms the basic idea behind file compression. This post talks about fixed length and variable length encoding, uniquely decodable codes, prefix rules and construction of Huffman Tree.
A Treap Data Structure is basically a combination of a binary search tree and a heap. Binary Search Trees – Deletions and additions of nodes can make the tree unbalanced (heavier on sides, therefore, the property we value about BSTs, the ability to distribute data by equal divisions, goes out of whack). Therefore we …
Wildcard Pattern Matching: Given a string and a pattern containing wildcard characters i.e. ‘*’ and ‘?’, where ‘?’ can match to any single character in input string and ‘*’ can match to any number of characters including zero characters, design an efficient algorithm to find if the pattern matches with the complete input string or …