Learn Data Structures & Algorithms - Crack Coding Interviews

Master Time Complexities, Recursion, Linked Lists, Stacks, Queues, Heaps, HashMaps, Arrays, Sort and Search Algorithms

What you'll learn
Learn popular Data Structures and Algorithms from Scratch using Java with simple and easy approach
Improve your Problem solving Skills with many logical techniques and Practice exercises
Become more confident and Ace coding Interviews from top tech companies
Deeper understanding on Stacks, Queues, LinkedList, Hashes, Heaps, Arrays etc
Learn various Search and Sort Algorithms with their time complexity estimation
Learn and Implement Recursive Programming to solve the tricky Programming puzzles
Requirements
No experience with data structures or algorithms needed
Basic understanding of Java or any programming language
Description
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 confidentlyIn 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 tutorial1. Recursion2. Linked List3. Stacks4. Queues5. Time Complexity6. Search Algorithms7. Sort Algorithms8. Binary Trees9. Arrays & Heaps10. Hash Map with its internal working processBy 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

Overview

Section 1: Introduction

Lecture 1 How this Course is designed to master Data Structures & Algos?

Lecture 2 Prerequisites to install Java and eclipse editor for programming

Section 2: Recursion Programming

Lecture 3 Where are Code files?

Lecture 4 What is Recursion? Rules of recursion to simplify the programs

Lecture 5 Algorithm - Get Sum of elements of Array using Recursion - Explained

Lecture 6 Generating Java recursion method from the designed Algorithm for Sum of elements

Lecture 7 Java Program for sum of elements

Lecture 8 Algorithm - Generate Factorial Series for any number with Recursion - explained

Lecture 9 Java Program to print Fibonacci Series using Recursion

Lecture 10 Algorithm - Generate Fibanocci Series using with Recursion - explained

Lecture 11 Java Program to print Fibonacci Series using Recursion

Section 3: LinkedList

Lecture 12 Where are Code files?

Lecture 13 Introduction to LInked Lists and understanding their structures

Lecture 14 Algorithm - Add the Nodes at the end of Linked List Explained

Lecture 15 Java Program in representing the Node and defining the Linked List

Lecture 16 Algorithm - How to print all the values in the Linked List - Explain

Lecture 17 Assignment - Check if there is Node with value 6

Lecture 18 Java Program to Add Nodes and Print the values in the LinkedList

Lecture 19 Algorithm - How to Add the nodes in the beginning of the Linked List - Explained

Lecture 20 Algorithm - How to add Nodes at the Given Index as Input to the method

Lecture 21 Assignment - Java program to add the nodes in the beginning

Lecture 22 Java Program to add the Nodes at the given index - example

Lecture 23 Algorithm - How to delete the Nodes at the end of LInked List - explained

Lecture 24 Algorithm - removing the first Node from the Linked List - explained

Lecture 25 Algorithm- Delete Node at specified Index of LinkedList- Explained

Lecture 26 Assignment - Delete node at specified index

Lecture 27 Assignment - Remove the node which has even values

Lecture 28 Algorithm - Reversing the Linked List without changing head & tail

Lecture 29 Java Program to demonstrate Reverse LinkedList - Example

Section 4: Stacks

Lecture 30 What is Stack data structure? and its main operations

Lecture 31 Implementation of Stack using Java Util Stack class and its methods

Lecture 32 Algorithm - How to reverse the Stack with temporary Stack

Lecture 33 Java Program to reverse the stack based on the discussed Algorithm

Lecture 34 Assignment - Insert the item in the Stack for given index

Lecture 35 Solution to the logic of inserting item in the Stack on any given index

Lecture 36 Algorithm - Find the minimum element from the Stack using temporary Stack

Lecture 37 Java Program logic to find out the minimum element from Stack

Lecture 38 Algorithm - Sort the given Stack in asc/desc order

Lecture 39 Java program logic to Sort the given stack using temporary Stack

Lecture 40 Assignment - Check if the String is balanced using Stack

Lecture 41 Solution - Java program to check if String is balanced using Stack

Section 5: Queues

Lecture 42 Introduction to Queues data structure and its operations

Lecture 43 Implementing Queue Enqueue and Dequeue operations using Arrays

Lecture 44 Java code review of Array Queue implementation algorithm

Lecture 45 Assignment - Implement Queue Operations using Stack

Lecture 46 Java Code Algorithm in implementing Queues using Stacks

Lecture 47 InBuilt Queue Interface implementation Classes - ArrayDeqeue

Lecture 48 Assignment - Reverse the Queue elements

Lecture 49 Solution - Reversing the Queue using Stack Data structure

Lecture 50 What are Priority Queues and how it works internally to store data

Lecture 51 Assignment - Implementation of Priority queue enqueue method using Arrays

Section 6: Time complexity

Lecture 52 Introduction to Time Complexity and what is constant time O(1)

Lecture 53 Understanding the time complexity between O(1) and O(n) for any program

Lecture 54 Sample Programs for estimating the time complexity in given logic

Lecture 55 Understand time complexities of O(n~2) O(logn) and O(n!)

Section 7: Sorting Algorithms

Lecture 56 What is Bubble Sort and how to design the sort algorithm

Lecture 57 Java program to implement Bubble sort and its Time complexity

Lecture 58 Selection Sort and its design algorithm to sort the array

Lecture 59 Java program to implement Selection sort and its Time complexity

Lecture 60 Introduction to Merge sort and its Divide & Conquer Strategy

Lecture 61 Java program to implement Divide the Array into two parts with recursion

Lecture 62 Algorithm to implement Merge of two arrays with recursion

Lecture 63 End to end java code on implementing Merge Sort with O(nlogn) time complexity

Lecture 64 Quick Sort Lecture - Coming Soon

Section 8: Search Algorithms

Lecture 65 What is Linear Search? Implement the Strategy with time complexity

Lecture 66 What is Binary Search? An algorithm to implement Binary search

Lecture 67 Algorithm to implement Binary Search with divide & Conquer recurssion

Lecture 68 Java program to implement the search with and with out recursion strategy

Lecture 69 Jump Search Algorithm with minimal time complexity - Explain

Lecture 70 Assignment Solution - Java program to implement Sqrt(n) time complexity search

Section 9: Binary Trees

Lecture 71 What are Tree Data Structures and Importance of Binary trees

Lecture 72 What are Binary Search trees and how does it works on creation

Lecture 73 Assignment - Implement Binary Search Tree with the given list of elements

Lecture 74 Algorithm to implement binary Search tree as per the tree sort guidelines

Lecture 75 Java code on working with Binary Search tree implementation with examples

Lecture 76 Extracting the values from Search tree in sorted order (Inorder traversal)

Lecture 77 Finding the minimum element in the Binary Search tree with O(logn) complexity

Lecture 78 Implementing the Java code with example on extracting the minimum element

Lecture 79 How to get height of the Binary Search tree using recursion

Lecture 80 Java code in implementing the Binary Search tree height calculation

Lecture 81 How to Search for an element in the Binary Search tree with O(logn) complexity

Section 10: HashMaps

Lecture 82 What is Map Data Structure and its operations to store Data

Lecture 83 Hash Map methods to store and retrieve the key value data

Lecture 84 How to determine Default Capacity and Load Factor for the Hash map

Lecture 85 How HashMap internally Store the Data? Importance of Hash function

Lecture 86 Importance of HashCode & generating Hash Value for the String

Lecture 87 What is HashMap Collision and how to resolve the Collision

Lecture 88 Commonly asked Interview Questions on HashMap DataStructure

Section 11: Code Download

Lecture 89 Download the full course Code files

Software engineers,College Graduates,Computer Science Students