@tarabyte.tech: Recursive thinking is a building block for dynamic programming, backtracking, and lots of other problem types. So… this is lesson 0 in our dynamic programming series. Recursion is one of the scarier concepts in computer science, but let’s learn it together. Then we can go and crush those leetcode problems. 💪 #computerscience #leetcode #softwareengineer #codingforbeginners #learnprogramming
My beef with recursion is that I just cannot visualize what’s going on. I need to visualise what’s happening for me to be able to code it, and with recursion it just feels impossible.
2025-11-17 14:45:29
99
GenxKris :
I nailed recursion back in the day when I had to learn LISP for an AI class.
2025-11-18 11:14:28
4
interdurozw :
Let’s blow up the stack!
2025-11-17 16:50:56
5
Oirionman_ :
If only the recurrence relation was always so trivial…
2025-11-17 04:47:52
6
Jose Cuervo 🫡 :
Awesome explanation, great job. Looking forward to more of this.
2025-11-17 16:46:20
3
. :
I used to struggle with recursion till I watched MIT open source by anna bell and it makes so much sense now
2025-11-17 04:00:31
76
Toto :
When I was learning recursion, the hardest part for me to grasp was the fact that once we got to the base case after multiple recursive calls, I needed to imagine that we were applying the operations backward as each recursive call returned to its caller.
2025-11-16 23:18:39
1
MedicaidHelp.org :
Hey Tara!!! You are going viral !!! Im so proud and happy for you!! Grats!!!! Seriously made my day!!!! Keep that energy ;)
2025-11-17 17:01:42
2
nomoredavo :
Okay but how do you derive recurrence relations from a problem you’ve never seen before 😭😭 especially those leetcode hardd man
2025-11-19 01:13:08
6
BelieveElikem :
Can you help me build the intuition of how it is multiplied in the backward direction when it hits the base ?. It’s like I can’t really get it. It hits the base but the function is already done running so how does it know to come back and multiply till the outermost call ?
2025-11-17 04:57:56
2
souhaibammani :
Great explanation. i'm waiting for dynamic prog explanation like this. Keep going and thanks !
2025-11-17 23:21:41
1
yeah :
i’m really looking forward to more dynamic programming help! i really struggled with that in my algorithms class, and you seem like a great teacher :)
2025-11-18 01:40:25
1
bilster :
( off topic ), not really. I'm memorizing singly linked lists. I'm an old action script 3.0 programmer. I don't know if I'm learning it right. the python syntax is confusing me. should I get a C programming book and use linked list examples in there to understand linked lists first?
2025-11-17 11:43:50
1
Danny :
With this you've got a new follower ❤️
2025-11-17 15:30:45
1
ahmedmohsen7414 :
Thank you very clear
2026-01-22 22:26:41
1
eagle :
wow it is so clear now. thanks a lot
2026-03-23 19:41:34
1
Muhammed Des :
Thanks for the lesson ❤️
2025-12-25 20:49:54
1
kipthemediocre :
The thing about recursion is that it’s usually not the best solution. Like factorial is the common example but it’s much more efficient to solve iteratively
2025-11-17 22:49:06
1
Penguin Changas :
got this in the class im learning it 😭
2025-11-18 17:08:43
2
908sohan :
Senior swe here also, not sure how I got this far😅, but thank you for making recursion so so much easier to understand and less daunting, wish I had this back in college days of learning ds&s!
2025-11-16 23:53:24
2
Nightwhisker :
Commenting to stay on proper-CS-schooling-tok 👏
2025-11-19 10:24:36
0
𝓜𝓪𝓻𝓿𝓲𝓷 :
That was very helpful can’t wait for the next, leet code is so hard😅
2025-11-17 18:32:44
1
Youssef :
I think if you were to do long form videos on youtube or slightly longer videos here on tiktok, you’d blow up
2025-11-17 06:16:09
1
Muntas Ahmed :
do u have YouTube?
2025-11-26 21:45:12
1
To see more videos from user @tarabyte.tech, please go to the Tikwm
homepage.