Prerequisites for the new Premium 'Detailed Explanation of': Dynamic Programming, Heaps, and Graphs Cards?
I am looking at becoming a premium member, but am wondering in which order I should take the Learn/Explore Cards in? For example, should I take Linked List -> Stack & Queue -> Binary Search Tree -> Recursion I -> Recursion II -> Heaps -> Graphs -> Dynamic Programming?

Comments (1)