Add/0 1 knapsack in reduced space

[dishhaa03]

Description of Change

Added a new file named "0_1_knapsack_new.cpp" in the dynamic programming folder which solves the problem in reduced space complexity that is O(n).

Fixes #2604 [FEATURE] Reduce space complexity of 0-1 Knapsack problem #2604

Checklist

• [x] Added description of change
• [x] Added file name matches File name guidelines
• [x] Added tests and example, test must pass
• [ ] Added documentation so that the program is self-explanatory and educational - Doxygen guidelines
• [x] Relevant documentation/comments is changed or added
• [x] PR title follows semantic commit guidelines
• [x] Search previous suggestions before making a new one, as yours may be a duplicate.
• [x] I acknowledge that all my contributions will be made under the project's license.

Notes:

[github-actions[bot]]

This pull request has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions[bot]]

Please ping one of the maintainers once you commit the changes requested or make improvements on the code. If this is not the case and you need some help, feel free to ask for help in our Gitter channel or our Discord server. Thank you for your contributions!