Skip to content

bigWaitForItOh/Classic-Problems

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

73 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Classic-Problems

Explanation, Analysis and Implementation of algorithms of Classic Problems which often arise in competitive programming and engineering problems.

  1. Knapsack Problem (Fractional and 0-1)

  2. Coin Change Problem

  3. Infix to Postfix conversion

  4. Infix to Prefix Conversion

  5. Evaluation of a mathematical Expression

  6. Maximum Subarray Problem

  7. Sum of all substrings of a String (the string being a number)

  8. Longest Increasing Subsequence

  9. Nim Sum

  10. Job Sequence Problem

  11. Activity Selection Problem

  12. N Queens Problem

  13. Subset Sum Problem

About

Explanation, Analysis and Implementation of algorithms of Classic Problems which often arise in competitive programming and engineering scenarios.

Resources

Stars

4 stars

Watchers

1 watching

Forks

Releases

No releases published

Packages

 
 
 

Contributors