Open Issues Need Help
View All on GitHub [OPTIMIZE] Two Sum (LeetCode #1) 6 months ago
AI Summary: This issue aims to optimize the existing brute-force O(n^2) solution for the LeetCode Two Sum problem. The goal is to refactor it to an O(n) time complexity using a hash map, ensuring the code is clean, well-commented with complexity analysis, and includes example test cases.
Complexity:
1/5
help wanted good first issue easy
A collection of LeetCode problems solved in C++ with explanations, complexity analysis, and room for optimization. Perfect for learning and contributing.
C++