feat: add LeetCode problem 167

[Vaibhav-Patidar]

Description of Change

Implemented the Two Sum II solution using the two-pointer approach. The function takes a sorted array and returns the 1-based indices of the two numbers whose sum equals the given target. It uses a single pass with O(n) time complexity and O(1) extra space. The result array is dynamically allocated, with memory management handled by the caller.

Checklist

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

Notes: Added the solution for Leetcode problem no.167 Two-Sum-II

[github-actions]

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]

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!