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