Algorithms that run our Universe Minimum deletions to make frequency of each character unique The problem we will solve is that given a string s, we need to find the minimum number of characters to be deleted from s so that the frequency of each character in the string is unique.

Algorithms that run our Universe Minimum number of Fibonacci terms with sum equal to a given number N Given a number N, we need to find the minimum number of fibonacci numbers required that sums up to a given number N. Note a fibonacci number can be repeated

Algorithms that run our Universe Number of ways to represent a number N as sum of K Fibonacci terms The problem we will solve is that given a number N and K, we need to find the numbers of ways we can represent N as a sum of K fibonacci numbers. We will solve this problem efficiently using a recursive technique in O(N).

Algorithms that run our Universe Break a number in 3 parts (n/2, n/3, n/4) recursively to get maximum sum Given a number n, we can divide it in only three parts n/2, n/3 and n/4 recursively and find the maximum sum of the 3 parts. This can be solved in linear time using Dynamic Programming