Binary search works. Both have a time compexity of O(NLogN)
2024-10-25 22:10:13
6
Rizzonance :
are these ai generated? how are you supposed to get the value from n, when you only give it a value in the next line?
2024-10-30 03:33:46
3
miraser31 :
what do these O(n) even mean
2024-10-28 23:49:31
0
Eastman :
This tiktok account is a game changer. I go on here for a break and instead get a refresher. Thank you and I appreciate you 🙌
2024-10-26 02:04:41
1
davidka23tcrf :
you can also convert the array into a map, loop over the array, and if the complement of the target minus the current index is in the map you have the solution, complexity is also O(n)
2024-10-26 11:03:11
0
NightEule :
Brutes force
2024-10-27 19:31:54
3
Kleines Mausi :
doesn't n need to be declared before r?
or am I misunderstanding something
2025-01-03 15:57:51
0
b :
😳😳😳
2024-10-25 15:21:15
0
Greg Hogg :
Wanna learn this stuff directly from me in a live class? Book a call with me at algomap.io/bootcamp :)
2024-10-25 15:03:54
0
To see more videos from user @greghogg5, please go to the Tikwm
homepage.