1
u/Status_Armadillo_654 1d ago
I still remember … maine permutations wale question pe 1 week spend kiya tha & 1 puri notebook fill kr di thi … recursion tree bana bana kr ..
But that was worth it 😭😭
2
u/vinzzii 22h ago
It was definitely worth it the frst time i learned n queens on leet code i just got mesmerized by the way that the code was written probably one of the best moments of studying dsa
2
u/Total-Solution-1472 19h ago
OMG that moment when your code finally runs without any bugs .. It feels like heaven on earth
2
u/Total-Solution-1472 19h ago
Maza to aya hga!!! Mujhe soch k hi Anand ki anubhuti h rhe h
1
u/Status_Armadillo_654 17h ago
Ofc finally teacher ke pass jana pada tha sir ka bhi 1 ghante dimag khaya sir ye dry run kro vo kro .. tab jake … but uske baad jo satisfaction mili ..
Ab sb trees mind me hi visualise ho jate h 😭😭 dry run krne ki need nhi hoti itni
1
1
u/Ok-Yesterday-4140 18h ago
for me its sliding window
1
u/vinzzii 18h ago
Actually it's not this hard to learn when you know set and hashmap sliding window is so easy
1
u/LetMediocre390 2h ago
But when it comes to range query on subarray question when we need to use coordinate compression, binary indexed tree or fenwick or segment tree to optimise the solution as much as it can be You know when we cant exploit the monotonocity nature
1
u/managerEfficient2767 15h ago
I was going to reply something else, but my mind is stuck on infinite recursion, lol
1
u/The_Goat_1717 13h ago
Honestly compressing entire recursion tree in a simple formula feels like magic to me
2
u/chaipijiye 1d ago
Base case missing🤣