Explore
101 visualisers you can step through forwards and backwards, with synced code and a reason for every move.
Showing 7 of 101
Pastel = track · chip = your mastery
- LinearArrayA collection of elements stored at contiguous memory locations.O(n)
- LinearStackA linear data structure that follows LIFO (Last In First Out) principle.O(1)
- LinearQueueA linear data structure that follows FIFO (First In First Out) principle.O(1)
- LinearLinked ListA linear data structure where elements are stored in nodes.O(n)
- LinearDequeA double-ended queue that allows insertion and deletion at both ends.O(1)
- Dynamic ProgrammingFibonacci (Memoization)An optimized approach to calculate Fibonacci numbers using memoization.O(n)
- BacktrackingSubsetsList every subset by deciding, for each item in turn, to include it or leave it out.O(n·2ⁿ)