## Maximum Product Subset Problem

Given an array of integers, find a subset in it that has maximum product of its elements.

Coding made easy

Given an array of integers, find a subset in it that has maximum product of its elements.

Given an unsorted array of integers, print all pairs with given difference k in it without using any extra space.

Given an unsorted array of integers, print all pairs with given difference k in it.

Quickselect is a selection algorithm to find the kth smallest element in an unordered list. It is closely related to the quicksort sorting algorithm.

Given an unsorted array of integers, check if it contains four elements tuple (Quadruplets) having given sum.

Given a linked list, write a function which deletes any duplicate nodes from the list by traversing the list only once.

Given an unsorted array of integers, find a triplet with given sum in it.

Given M sorted lists of variable length, print them in sorted order efficiently.

Given a string, calculate its rank among all its lexicographically sorted permutations. For example, consider below lexicographically sorted permutations

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 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.

Given an array of integers, check if array contains a sub-array having 0 sum.