Your Search on Learning Data Structures & Algorithms ends here. Ds & Algos are very easy if you know how exactly they work! And I am here to show its implementation process with very easy approach using Whiteboard teaching so that you will master on all the essential concepts to clear the Interviews.
The examples I picked in this course will fine tune your thought process and enhance your logical thinking ability. With the approach of Whiteboard teaching, You will have practical understanding of how Data structures Problems can be analyzed and solved!!
There are tons of Assignments & Interview Questions with solutions all over the course for practice so that you can progress in the course confidently
In this course, I use Java to teach the concepts but you can apply these concepts in any programming language. Our focus is on data structures and algorithms, not programming languages and tools.
Below are the list of Data Structure topics you will master from this tutorial
1. Recursion
2. Linked List
3. Stacks
4. Queues
5. Time Complexity
6. Search Algorithms
7. Sort Algorithms
8. Binary Trees
9. Arrays & Heaps
10. Hash Map with its internal working process
By end of this course, you will gain enough confidence in solving the Data Structure puzzle questions and also gain the ability to write algorithms for any given problem
Course Curriculum
-
StartWhere are Code files?
-
StartWhat is Recursion? Rules of recursion to simplify the programs (7:23)
-
StartAlgorithm - Get Sum of elements of Array using Recursion - Explained (6:56)
-
StartGenerating Java recursion method from the designed Algorithm for Sum of elements (3:53)
-
StartJava Program for sum of elements (8:24)
-
StartAlgorithm - Generate Factorial Series for any number with Recursion - explained (6:40)
-
StartJava Program to print Fibonacci Series using Recursion (4:14)
-
StartAlgorithm - Generate Fibanocci Series using with Recursion - explained (7:35)
-
StartJava Program to print Fibonacci Series using Recursion (3:51)
-
StartWhere are Code files?
-
StartIntroduction to LInked Lists and understanding their structures (8:02)
-
StartAlgorithm - Add the Nodes at the end of Linked List Explained (9:25)
-
StartJava Program in representing the Node and defining the Linked List (9:04)
-
StartAlgorithm - How to print all the values in the Linked List - Explain (6:32)
-
StartJava Program to Add Nodes and Print the values in the LinkedList (2:58)
-
StartAlgorithm - How to Add the nodes in the beginning of the Linked List - Explained (3:57)
-
StartAlgorithm - How to add Nodes at the Given Index as Input to the method (12:07)
-
StartJava Program to add the Nodes at the given index - example (5:19)
-
StartAlgorithm - How to delete the Nodes at the end of LInked List - explained (10:07)
-
StartAlgorithm - removing the first Node from the Linked List - explained (8:04)
-
StartAlgorithm- Delete Node at specified Index of LinkedList- Explained (6:26)
-
StartAlgorithm - Reversing the Linked List without changing head & tail (12:26)
-
StartJava Program to demonstrate Reverse LinkedList - Example (6:16)