Sheffield | 25-SDC-Nov | Hassan Osman | Sprint 1 | Analyse and Refactor Functions#122

Open

HassanOHOsman wants to merge 19 commits intoCodeYourFuture:mainfrom

HassanOHOsman:refactor/reduce-complexity

Commits on Feb 25, 2026

Refactor: Reduce looping to 1 process that performs both operation to reduce complexity and save time
HassanOHOsman
committed
explain complexity using Big O
HassanOHOsman
committed
Explain complexity using Big O Notation
HassanOHOsman
committed
convert the second array to set so that we use its methid .has()
HassanOHOsman
committed
filter through the first array element to check if the set has the same element in it
HassanOHOsman
committed
update the time complexity explanation to describe the state before the code was refactored
HassanOHOsman
committed
Explain the complexity using Big O notation
HassanOHOsman
committed
create set to achieve time efficieny - use it to store items we've already checked while looping
HassanOHOsman
committed
Loop over each element in an array and check if the set contains the second number (difference between target and first number)
HassanOHOsman
committed
each loop add the check number into the set to ensure considering distinc pairs
HassanOHOsman
committed
refactor and move set inside the function to avoid getting wrong results
HassanOHOsman
committed
update Optimal Time Complexity explanation
HassanOHOsman
committed

Commits on Feb 26, 2026