MCPcopy Create free account
hub / github.com/Vishruth-S/CompetitiveCode / solution2.py

File solution2.py

GeeksForGeeks/SumOfPairs/solution2.py:None–None  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

1# Map Approach [O(n)] :
2# Idea is to create a hashmap to store freq of the elements, and lookup those elements while traversing the array to check if their sum is equal to the given sum or not
3# GeeksforGeeks Explanation: https://youtu.be/bvKMZXc0jQU
4

Callers

nothing calls this directly

Calls 1

getPairsCountFunction · 0.85

Tested by

no test coverage detected