• LOGIN
  • No products in the cart.

The topic every technical interview tests: complexity and Big O, arrays, linked lists, stacks, queues, trees, heaps, hash tables and graphs, plus sorting, searching, recursion and dynamic programming, implemented in C++.

Course Curriculum

1. Complexity
1.1 Why data structures matter 00:08:00
1.2 Time and space complexity, Big O 00:14:00
2. Linear Structures
2.1 Arrays and dynamic arrays 00:10:00
2.2 Singly and doubly linked lists 00:15:00
2.3 Stacks and their applications 00:12:00
2.4 Queues, circular queues and deques 00:12:00
3. Hashing
3.1 Hash tables and collision handling 00:14:00
4. Trees
4.1 Binary trees and traversals 00:14:00
4.2 Binary search trees 00:14:00
4.3 Heaps and priority queues 00:12:00
4.4 Balanced trees overview: AVL and Red-Black 00:09:00
5. Graphs
5.1 Graph representations 00:10:00
5.2 BFS and DFS 00:14:00
5.3 Shortest paths: Dijkstra 00:12:00
6. Algorithms
6.1 Linear and binary search 00:10:00
6.2 Sorting: bubble, selection, insertion 00:12:00
6.3 Merge sort and quick sort 00:14:00
6.4 Recursion and backtracking 00:12:00
6.5 Greedy algorithms 00:10:00
6.6 Dynamic programming 00:15:00
6.7 Final project: implement and benchmark a data structures library 00:22:00

Course Reviews

N.A

ratings
  • 5 stars0
  • 4 stars0
  • 3 stars0
  • 2 stars0
  • 1 stars0

No Reviews found for this course.