Explanation, Analysis and Implementation of algorithms of Classic Problems which often arise in competitive programming and engineering problems.
-
Knapsack Problem (Fractional and 0-1)
-
Coin Change Problem
-
Infix to Postfix conversion
-
Infix to Prefix Conversion
-
Evaluation of a mathematical Expression
-
Maximum Subarray Problem
-
Sum of all substrings of a String (the string being a number)
-
Longest Increasing Subsequence
-
Nim Sum
-
Job Sequence Problem
-
Activity Selection Problem
-
N Queens Problem
-
Subset Sum Problem