sixforeight
Region: US
Friday 04 September 2026 10:02:12 GMT
34365
3253
17
94
Music
Download
Comments
d✶rik :
you're probably the best leetcode explainer I've ever seen. your videos are really good
2026-09-04 12:30:05
64
The third turkey :
Hashmaps too OP plz nerf
2026-09-09 13:26:59
25
Ghost :
i lost you after you said "if"
2026-09-04 11:57:06
11
Zall :
Wouldn’t it be better to initialize the whole hashmap first then do the complement calcs ? genuine question, i would assume that it would be faster in case where, like in the example, if the complement needed is late in the array, so you will do your operations up to that point, adding time to the execution. But i may be completly wrong idk
2026-09-07 22:21:11
0
Zizzle Wizard :
I don’t even know wtf you said the question was
2026-09-13 09:31:11
0
profoundromeo.fun :
Such kind of tasks also can be solved using bitset
2026-09-08 15:49:57
1
Bislungo :
can i use hashset for that too? saving the sub nbvetween X and e[i] and chechink e[i] in the hashset. if i have e[i] in the hashset, than i got an operand. after this i just go through all e to search the second operand
2026-09-13 19:41:04
0
_Lu_☆ :
started leetcode today, ty bro <3
2026-09-16 17:09:31
1
gameidite :
I always did the inverse: compliments = {} for i, num in enumerate(nums) if num in compliments: return [compliments[num], i] else: compliments[target - num] = i
2026-09-09 02:47:46
0
CptJackSpanker :
How did I get here
2026-09-14 12:23:08
0
Ali :
i love your videos
2026-09-04 11:53:47
2
kikohogod :
bro one word at a time please.
2026-09-14 21:27:13
1
riseby :
👍👍👍
2026-09-09 07:56:59
0
To see more videos from user @sixforeight, please go to the Tikwm
homepage.
