Lesson 14 of 15 • 2 upvotes • 6:04mins
Graphs are a very versatile data structure in themselves. In addition to that Graphs are very frequently used in real life problems. In this lesson, we discuss the basics of a graph and how to represent it in its two most common forms the Adjacency Lists and the Adjacency Matrix.
15 lessons • 1h 48m
Overview Of The Course: Ultimate Guide To Acing A Coding Interview
2:47mins
Starting With Linked Lists
6:30mins
Typical Problems On Linked Lists
8:54mins
Binary Trees: Meaning And Associated Terminology
6:03mins
Binary Search Trees: Writing, Traversing And Deleting
7:10mins
Heaps: Meaning, Types & Implementation
7:49mins
Importance Of Binary Search
6:42mins
Mergesort: Meaning & Implementation
8:03mins
Quicksort: Meaning & Coding
8:53mins
Introduction To Dynamic Programming
7:06mins
Levelling Up In Dynamic Programming
9:52mins
Learn The Greedy Programming Paradigm
5:46mins
Learn Bitwise Operations Tricks
8:23mins
Introduction To Graph Theory
6:04mins
Breadth First Search And Depth First Search
8:51mins