Decrease & Conquer Fake Coin Problem Fake coin problem is an interesting problem in which we have to find a fake coin out of a number of coins, which is assumed to be lighter than the real coins using just a balance scale, which can be used to compare the weights of two piles of coins.

Greedy Algorithms Fitting Shelves Problem [Greedy Algorithm] In this article, we will understand what fitting shelves problem is and will see a greedy approach algorithm of solving this problem.

divide and conquer Find floor in sorted array In this article, we are going to see various methods of finding the floor of a given number from a given sorted array. To solve this efficiently, the concept of Divide and Conquer / Binary Search is required.

List of Mathematical Algorithms Egyptian Fraction Problem [Greedy Algorithm] In this article, we will explore the fascinating concept of Egyptian Fractions and will learn what they are and will also see an example of how they can be solved using greedy algorithm techniques.

Algorithms Examples of Hash Functions In this article, we have listed several examples of good Hash Functions which you are used conveniently. This can be used to hash any data (numeric and string). Some examples are PJW hash, Division Hash, BUZ hash and much more.

Algorithms Separate chaining collision resolution technique In this article, we are going to see how we can actually resolve the collisions which happen during hash mapping using Separate chaining collision resolution technique.