Data Structures
Ways to organise data, and how to choose the right one for each problem.
0 of 28 lessons published
Syllabus
01 IntroductionWhy data structures matter. 3 lessons
- 1.1What is a data structure?Coming soon
- 1.2Time and space complexityComing soon
- 1.3Big O, Big Omega and Big ThetaComing soon
02 Arrays and StringsThe simplest structures. 4 lessons
- 2.1Arrays and dynamic arraysComing soon
- 2.2Two-pointer techniqueComing soon
- 2.3Sliding windowComing soon
- 2.4String manipulation problemsComing soon
03 Linked ListsChains of nodes. 4 lessons
- 3.1Singly linked listComing soon
- 3.2Doubly linked listComing soon
- 3.3Circular linked listComing soon
- 3.4Common linked list problemsComing soon
04 Stacks and QueuesOrdered access. 4 lessons
- 4.1Stack and its applicationsComing soon
- 4.2Queue and circular queueComing soon
- 4.3DequeComing soon
- 4.4Priority queueComing soon
05 HashingInstant lookup. 3 lessons
- 5.1Hash tables and hash functionsComing soon
- 5.2Collision handlingComing soon
- 5.3Hashing problemsComing soon
06 TreesHierarchical data. 6 lessons
- 6.1Binary trees and traversalsComing soon
- 6.2Binary search treesComing soon
- 6.3AVL trees and balancingComing soon
- 6.4HeapsComing soon
- 6.5TriesComing soon
- 6.6Segment treesComing soon
07 GraphsNetworks of connections. 4 lessons
- 7.1Graph representationComing soon
- 7.2BFS and DFSComing soon
- 7.3Topological sortComing soon
- 7.4Disjoint set (Union-Find)Coming soon