How the solution is O(1)?

SUSHANTA_MUKHERJEE · March 10, 2022, 9:24pm

How the solution is O(1) ?

Usman_Younas · March 11, 2022, 6:32am

I am unable to find the lesson for which you asked the question. Could you please provide me with the direct link to that lesson so I can look into it?
thanks!

Saba_Rehman · March 14, 2022, 4:21am

Hi @SUSHANTA_MUKHERJEE
The O(1) time complexity is for functions related to the HashSet (set function) and Linked List (deletion at head).
The overall time complexity for the algorithm is O(n). Hope this helps!