Video yükleniyor...

Video Yüklenemedi

Ana Sayfaya Dön

Staring at DSA problems and still not getting it..? lets you watch the solution happen step by step, index by index no more guessing... you literally see it

25,388 görüntüleme • 6 ay önce •via X (Twitter)

9 Yorum

Het Suthar profil fotoğrafı
Het Suthar6 ay önce

Liked that people are working in this area too for better visualization try if u connect each step as a node and explain the process between each node as a string, use this as ref :

Czerian.eth  ⟠ ✪ 𝕏  profil fotoğrafı
Czerian.eth  ⟠ ✪ 𝕏 6 ay önce

@threadreaderapp unroll

Ankur Verma profil fotoğrafı
Ankur Verma6 ay önce

👍

Bharat Placed profil fotoğrafı
Bharat Placed6 ay önce

Do you have insta page as well ?

Aryan Utkarsh profil fotoğrafı
Aryan Utkarsh6 ay önce

Wanna collaborate to make this better, like a finished product, and less AI generated?....Loved the idea

Nagendra Rawat profil fotoğrafı
Nagendra Rawat6 ay önce

Great resources 👍

Vaishnavi profil fotoğrafı
Vaishnavi6 ay önce

☺

Dhanvina profil fotoğrafı
Dhanvina6 ay önce

These resources are super helpful for starting DSA without losing motivation!

Vaishnavi profil fotoğrafı
Vaishnavi6 ay önce

Yes

Benzer Videolar

Holy shit… someone just made DSA finally click. Not static notes Not boring pseudocode Not guessing what happens in memory Real data structures — animating step-by-step — visually. It’s called Data Structure Visualizations and it lets you watch algorithms run in real time. Here’s why this is different: Instead of dumping theory, it shows execution live • nodes getting inserted • trees rotating • pointers moving • queues filling • stacks popping • graphs traversing • heaps rebalancing You literally see algorithms think. Everything is interactive: • Binary Search Trees • AVL Trees (with rotations) • Red-Black Trees • Heaps & Priority Queues • Graph BFS / DFS • Dijkstra & MST • Hash Tables • Tries • Sorting (Quick, Merge, Heap…) • Dynamic Programming No black box. Just input → steps → result Watch in real time: • AVL rotations balancing themselves • BFS exploring layer by layer • DFS diving deep then backtracking • Dijkstra relaxing edges step-by-step • Quick sort partition visually • Heap forming after each insert • Hash collisions resolving live This solves the biggest DSA problem: Most resources teach code → memorize → hope it works This shows input → execution → visualization → understanding Which means you finally understand: • why AVL rotates • how heap property maintains • how BFS differs from DFS • how Dijkstra actually updates distances • what happens during rehashing • how quicksort partitions • how trees rebalance Even better: You control everything Change values Insert nodes Run step-by-step Pause execution Replay algorithms Learning DSA becomes interactive Not passive Not confusing Not theoretical Just… visible. Perfect for: • DSA beginners • interview prep • visual learners • CS students • LeetCode prep • teaching algorithms • debugging understanding This is the kind of resource that makes trees, graphs, and sorting finally click. Link: We’re moving from reading DSA → watching DSA execute And once you can see algorithms… you stop memorizing and start understanding.

Suryansh Tiwari

14,627 görüntüleme • 7 ay önce