Learn Data Structures & Algorithms for Interviews – PART 1

Course Curriculum

Chapter 1: Introduction

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

Lecture 2: Important Note

Lecture 3: Prerequisites to install Java and eclipse editor for programming

Chapter 2: Recursion Programming

Lecture 1: Where are Code files?

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

Lecture 3: Algorithm – Get Sum of elements of Array using Recursion – Explained

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

Lecture 5: Java Program for sum of elements

Lecture 6: Algorithm – Generate Factorial Series for any number with Recursion – explained

Lecture 7: Java Program to print Fibonacci Series using Recursion

Lecture 8: Algorithm – Generate Fibanocci Series using with Recursion – explained

Lecture 9: Java Program to print Fibonacci Series using Recursion

Chapter 3: LinkedList

Lecture 1: Where are Code files?

Lecture 2: Introduction to LInked Lists and understanding their structures

Lecture 3: Algorithm – Add the Nodes at the end of Linked List Explained

Lecture 4: Java Program in representing the Node and defining the Linked List

Lecture 5: Algorithm – How to print all the values in the Linked List – Explain

Lecture 6: Assignment – Check if there is Node with value 6

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

Lecture 8: Algorithm – How to Add the nodes in the beginning of the Linked List – Explained

Lecture 9: Algorithm – How to add Nodes at the Given Index as Input to the method

Lecture 10: Assignment – Java program to add the nodes in the beginning

Lecture 11: Java Program to add the Nodes at the given index – example

Lecture 12: Algorithm – How to delete the Nodes at the end of LInked List – explained

Lecture 13: Algorithm – removing the first Node from the Linked List – explained

Lecture 14: Algorithm- Delete Node at specified Index of LinkedList- Explained

Lecture 15: Assignment – Delete node at specified index

Lecture 16: Assignment – Remove the node which has even values

Lecture 17: Algorithm – Reversing the Linked List without changing head & tail

Lecture 18: Java Program to demonstrate Reverse LinkedList – Example

Chapter 4: Stacks

Lecture 1: What is Stack data structure? and its main operations

Lecture 2: Implementation of Stack using Java Util Stack class and its methods

Lecture 3: Algorithm – How to reverse the Stack with temporary Stack

Lecture 4: Java Program to reverse the stack based on the discussed Algorithm

Lecture 5: Assignment – Insert the item in the Stack for given index

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

Lecture 7: Algorithm – Find the minimum element from the Stack using temporary Stack

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

Lecture 9: Algorithm – Sort the given Stack in asc/desc order

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

Lecture 11: Assignment – Check if the String is balanced using Stack

Lecture 12: Solution – Java program to check if String is balanced using Stack

Chapter 5: Queues

Lecture 1: Introduction to Queues data structure and its operations

Lecture 2: Implementing Queue Enqueue and Dequeue operations using Arrays

Lecture 3: Java code review of Array Queue implementation algorithm

Lecture 4: Assignment – Implement Queue Operations using Stack

Lecture 5: Java Code Algorithm in implementing Queues using Stacks

Lecture 6: InBuilt Queue Interface implementation Classes – ArrayDeqeue

Lecture 7: Assignment – Reverse the Queue elements

Lecture 8: Solution – Reversing the Queue using Stack Data structure

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

Lecture 10: Assignment – Implementation of Priority queue enqueue method using Arrays

Chapter 6: Time complexity

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

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

Lecture 3: Sample Programs for estimating the time complexity in given logic

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

Chapter 7: Sorting Algorithms

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

Lecture 2: Java program to implement Bubble sort and its Time complexity

Lecture 3: Selection Sort and its design algorithm to sort the array

Lecture 4: Java program to implement Selection sort and its Time complexity

Lecture 5: Introduction to Merge sort and its Divide & Conquer Strategy

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

Lecture 7: Algorithm to implement Merge of two arrays with recursion

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

Lecture 9: Quick Sort Lecture – Coming Soon

Chapter 8: Search Algorithms

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

Lecture 2: What is Binary Search? An algorithm to implement Binary search

Lecture 3: Algorithm to implement Binary Search with divide & Conquer recurssion

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

Lecture 5: Jump Search Algorithm with minimal time complexity – Explain

Lecture 6: Assignment Solution – Java program to implement Sqrt(n) time complexity search

Chapter 9: Binary Trees

Lecture 1: What are Tree Data Structures and Importance of Binary trees

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

Lecture 3: Assignment – Implement Binary Search Tree with the given list of elements

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

Lecture 5: Java code on working with Binary Search tree implementation with examples

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

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

Lecture 8: Implementing the Java code with example on extracting the minimum element

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

Lecture 10: Java code in implementing the Binary Search tree height calculation

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

Chapter 10: HashMaps

Lecture 1: What is Map Data Structure and its operations to store Data

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

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

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

Lecture 5: Importance of HashCode & generating Hash Value for the String

Lecture 6: What is HashMap Collision and how to resolve the Collision

Lecture 7: Commonly asked Interview Questions on HashMap DataStructure

Chapter 11: Code Download