Updated the code file for potd of october 2024, file name -> potd_15_10_2024.cpp for optimized solution for problem of the day with Time Complexity of O(n) and space Complexity of O(1).
Fixes: #[issue_number] (replace with the issue number, if applicable)
Use [x] to represent a checked (ticked) box.✅
Use [ ] to represent an unchecked box.❌
Type of Change
[ ] Question Added
[ ] Solution Added
[x] Updated Existing solution:
How to Test
Provide a brief description of how to test your changes. Include steps, commands, or screenshots if necessary.
Step 1 -> create a .cpp file for the code
Step 2 -> execute the code on command line or any code editor
Step 3
Checklist
[x] I have performed a self-review of my code.
[x] I have commented my code, particularly in hard-to-understand areas.
[x] I have made corresponding changes to the documentation (if applicable).
[x] My changes generate no new warnings.
[x] I have added tests to cover my changes (if applicable).
[ ] All new and existing tests pass.
Additional Notes
Please add any other information that is relevant to this pull request, including potential risks, alternative solutions considered, or future improvements.
Description
Updated the code file for potd of october 2024, file name -> potd_15_10_2024.cpp for optimized solution for problem of the day with Time Complexity of O(n) and space Complexity of O(1).
Fixes: #[issue_number] (replace with the issue number, if applicable)
Use [x] to represent a checked (ticked) box.✅ Use [ ] to represent an unchecked box.❌
Type of Change
How to Test
Provide a brief description of how to test your changes. Include steps, commands, or screenshots if necessary.
Checklist
Additional Notes
Please add any other information that is relevant to this pull request, including potential risks, alternative solutions considered, or future improvements.