
In this section you will understand the topics covered in this course.
In this section you will hear about the different parts of the course.
In this section you will find some tips and tricks to ace that interview!
In this lecture, you will get introduced to the common data structures in programming.
In this lecture, we will talk about Arrays and its pros and cons.
In this lecture, lets understand the way to measure running time by solving a problem.
In this lecture, lets look into Logarithmic running time.
Now that you are familiar with arrays, lets learn about Queues and learn to implement a queue using arrays.
Having learnt to implement queues, lets see what it takes to implement a stack.
In the last part of this course, lets learn to implement a Dictionary.
There are four parts to this program.
In part 1 of this course, we start with the deep dive implementations on some of the basic linear structures such as Arrays, Queues, Stacks and Dictionary. Understanding data structures are key to problem solving.
In part 2 of the course we will deep dive into problem solving, strings, Linked List and recursion.
In part 3, we deep dive into more problem solving and dynamic programming.
Finally in part 4, we will cover Trees and Graphs.
Happy coding!